./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.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_operatoramount_amount250_file-20.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 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:26:56,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:26:56,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:26:56,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:26:56,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:26:56,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:26:56,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:26:56,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:26:56,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:26:56,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:26:56,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:26:56,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:26:56,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:26:56,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:26:56,151 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:26:56,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:26:56,152 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:26:56,152 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:26:56,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:26:56,153 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:26:56,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:26:56,154 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 -> 7baede3f4b218899c5fa728f3d2f15c45a27c02194fa196820f87130200e77ba [2025-03-17 04:26:56,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:26:56,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:26:56,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:26:56,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:26:56,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:26:56,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-03-17 04:26:57,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a5ce40/7aa6893affc342cf8be1a64c04e3e5f1/FLAG9950ceadc [2025-03-17 04:26:57,876 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:26:57,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-20.i [2025-03-17 04:26:57,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a5ce40/7aa6893affc342cf8be1a64c04e3e5f1/FLAG9950ceadc [2025-03-17 04:26:57,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b8a5ce40/7aa6893affc342cf8be1a64c04e3e5f1 [2025-03-17 04:26:57,903 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:26:57,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:26:57,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:26:57,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:26:57,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:26:57,909 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:26:57" (1/1) ... [2025-03-17 04:26:57,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ce94517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:57, skipping insertion in model container [2025-03-17 04:26:57,910 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:26:57" (1/1) ... [2025-03-17 04:26:57,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:26:58,056 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_operatoramount_amount250_file-20.i[916,929] [2025-03-17 04:26:58,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:26:58,177 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:26:58,185 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_operatoramount_amount250_file-20.i[916,929] [2025-03-17 04:26:58,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:26:58,263 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:26:58,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58 WrapperNode [2025-03-17 04:26:58,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:26:58,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:26:58,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:26:58,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:26:58,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,351 INFO L138 Inliner]: procedures = 26, calls = 62, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2025-03-17 04:26:58,352 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:26:58,353 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:26:58,353 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:26:58,353 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:26:58,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,377 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,414 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 04:26:58,414 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,435 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:26:58,469 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:26:58,469 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:26:58,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:26:58,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (1/1) ... [2025-03-17 04:26:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:26:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:26:58,503 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 04:26:58,507 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 04:26:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:26:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:26:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:26:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:26:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:26:58,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:26:58,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:26:58,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:26:59,291 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L369: havoc property_#t~bitwise38#1;havoc property_#t~short39#1;havoc property_#t~bitwise40#1;havoc property_#t~short41#1;havoc property_#t~short42#1;havoc property_#t~ite44#1;havoc property_#t~bitwise43#1;havoc property_#t~short45#1; [2025-03-17 04:26:59,383 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-03-17 04:26:59,385 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:26:59,403 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:26:59,404 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:26:59,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:26:59 BoogieIcfgContainer [2025-03-17 04:26:59,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:26:59,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:26:59,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:26:59,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:26:59,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:26:57" (1/3) ... [2025-03-17 04:26:59,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eeab5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:26:59, skipping insertion in model container [2025-03-17 04:26:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:26:58" (2/3) ... [2025-03-17 04:26:59,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eeab5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:26:59, skipping insertion in model container [2025-03-17 04:26:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:26:59" (3/3) ... [2025-03-17 04:26:59,411 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-20.i [2025-03-17 04:26:59,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:26:59,423 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-20.i that has 2 procedures, 185 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:26:59,472 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:26:59,480 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;@5b2d04a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:26:59,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:26:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 185 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 04:26:59,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:26:59,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:59,503 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:26:59,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:59,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -815350086, now seen corresponding path program 1 times [2025-03-17 04:26:59,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:59,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646292293] [2025-03-17 04:26:59,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:59,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:26:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:26:59,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:59,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-17 04:26:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646292293] [2025-03-17 04:26:59,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646292293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:26:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265865358] [2025-03-17 04:26:59,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:59,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:26:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:26:59,986 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 04:26:59,988 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 04:27:00,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:27:00,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:27:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:00,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:27:00,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:27:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 4608 trivial. 0 not checked. [2025-03-17 04:27:00,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:27:00,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265865358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:27:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:27:00,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337980916] [2025-03-17 04:27:00,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:00,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:27:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:00,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:27:00,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:27:00,291 INFO L87 Difference]: Start difference. First operand has 185 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 134 states have internal predecessors, (200), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-17 04:27:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:00,338 INFO L93 Difference]: Finished difference Result 366 states and 641 transitions. [2025-03-17 04:27:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:27:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) Word has length 326 [2025-03-17 04:27:00,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:00,348 INFO L225 Difference]: With dead ends: 366 [2025-03-17 04:27:00,348 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 04:27:00,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 327 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 04:27:00,355 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:00,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:27:00,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 04:27:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-17 04:27:00,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.4732824427480915) internal successors, (193), 131 states have internal predecessors, (193), 49 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 04:27:00,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 291 transitions. [2025-03-17 04:27:00,408 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 291 transitions. Word has length 326 [2025-03-17 04:27:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:00,409 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 291 transitions. [2025-03-17 04:27:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (49), 2 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-17 04:27:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 291 transitions. [2025-03-17 04:27:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:27:00,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:00,417 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:00,425 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 04:27:00,618 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 04:27:00,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -569082655, now seen corresponding path program 1 times [2025-03-17 04:27:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553914594] [2025-03-17 04:27:00,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:00,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:27:00,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:27:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:00,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:00,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:00,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553914594] [2025-03-17 04:27:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553914594] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:00,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:00,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:00,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980212649] [2025-03-17 04:27:00,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:00,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:00,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:00,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:00,958 INFO L87 Difference]: Start difference. First operand 182 states and 291 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:01,070 INFO L93 Difference]: Finished difference Result 464 states and 740 transitions. [2025-03-17 04:27:01,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 326 [2025-03-17 04:27:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:01,074 INFO L225 Difference]: With dead ends: 464 [2025-03-17 04:27:01,076 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 04:27:01,077 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 04:27:01,078 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 157 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:01,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 595 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:27:01,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 04:27:01,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 280. [2025-03-17 04:27:01,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 226 states have (on average 1.5176991150442478) internal successors, (343), 227 states have internal predecessors, (343), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-17 04:27:01,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 445 transitions. [2025-03-17 04:27:01,113 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 445 transitions. Word has length 326 [2025-03-17 04:27:01,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:01,115 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 445 transitions. [2025-03-17 04:27:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 445 transitions. [2025-03-17 04:27:01,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:27:01,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:01,121 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:01,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:27:01,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:01,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -576842014, now seen corresponding path program 1 times [2025-03-17 04:27:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:01,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826015290] [2025-03-17 04:27:01,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:01,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:27:01,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:27:01,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:01,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826015290] [2025-03-17 04:27:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826015290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:01,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:01,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195871743] [2025-03-17 04:27:01,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:01,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:01,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:01,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:01,401 INFO L87 Difference]: Start difference. First operand 280 states and 445 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:01,477 INFO L93 Difference]: Finished difference Result 566 states and 894 transitions. [2025-03-17 04:27:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:01,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 326 [2025-03-17 04:27:01,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:01,483 INFO L225 Difference]: With dead ends: 566 [2025-03-17 04:27:01,484 INFO L226 Difference]: Without dead ends: 287 [2025-03-17 04:27:01,485 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 04:27:01,486 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 136 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:01,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 550 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:27:01,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-17 04:27:01,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 232. [2025-03-17 04:27:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 180 states have internal predecessors, (269), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 04:27:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 367 transitions. [2025-03-17 04:27:01,512 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 367 transitions. Word has length 326 [2025-03-17 04:27:01,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:01,514 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 367 transitions. [2025-03-17 04:27:01,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 367 transitions. [2025-03-17 04:27:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-17 04:27:01,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:01,519 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:01,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:27:01,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:01,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash 384772003, now seen corresponding path program 1 times [2025-03-17 04:27:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:01,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748602408] [2025-03-17 04:27:01,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:01,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-17 04:27:01,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-17 04:27:01,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:01,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:01,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:01,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748602408] [2025-03-17 04:27:01,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748602408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:01,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:01,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945451022] [2025-03-17 04:27:01,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:01,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:01,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:01,733 INFO L87 Difference]: Start difference. First operand 232 states and 367 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:01,766 INFO L93 Difference]: Finished difference Result 465 states and 737 transitions. [2025-03-17 04:27:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 326 [2025-03-17 04:27:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:01,771 INFO L225 Difference]: With dead ends: 465 [2025-03-17 04:27:01,771 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 04:27:01,772 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 04:27:01,773 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:01,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:27:01,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 04:27:01,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-17 04:27:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 182 states have (on average 1.489010989010989) internal successors, (271), 182 states have internal predecessors, (271), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 04:27:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 369 transitions. [2025-03-17 04:27:01,793 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 369 transitions. Word has length 326 [2025-03-17 04:27:01,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:01,794 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 369 transitions. [2025-03-17 04:27:01,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:01,794 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 369 transitions. [2025-03-17 04:27:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-03-17 04:27:01,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:01,797 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:01,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:27:01,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:01,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1156460985, now seen corresponding path program 1 times [2025-03-17 04:27:01,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:01,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356683216] [2025-03-17 04:27:01,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:01,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:01,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-03-17 04:27:01,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-03-17 04:27:01,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:01,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:02,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:02,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356683216] [2025-03-17 04:27:02,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356683216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:02,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:02,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:27:02,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172514033] [2025-03-17 04:27:02,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:02,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:27:02,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:02,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:27:02,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:27:02,100 INFO L87 Difference]: Start difference. First operand 234 states and 369 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:02,376 INFO L93 Difference]: Finished difference Result 651 states and 1024 transitions. [2025-03-17 04:27:02,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:27:02,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 328 [2025-03-17 04:27:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:02,379 INFO L225 Difference]: With dead ends: 651 [2025-03-17 04:27:02,380 INFO L226 Difference]: Without dead ends: 418 [2025-03-17 04:27:02,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:27:02,381 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 185 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:02,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 909 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:27:02,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-03-17 04:27:02,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2025-03-17 04:27:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 313 states have (on average 1.463258785942492) internal successors, (458), 313 states have internal predecessors, (458), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 04:27:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 654 transitions. [2025-03-17 04:27:02,413 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 654 transitions. Word has length 328 [2025-03-17 04:27:02,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:02,414 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 654 transitions. [2025-03-17 04:27:02,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 654 transitions. [2025-03-17 04:27:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-17 04:27:02,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:02,419 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:02,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:27:02,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1834803, now seen corresponding path program 1 times [2025-03-17 04:27:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370877722] [2025-03-17 04:27:02,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:02,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 04:27:02,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 04:27:02,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:02,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370877722] [2025-03-17 04:27:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370877722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:27:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762440405] [2025-03-17 04:27:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:04,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:27:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:04,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:27:04,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:27:04,434 INFO L87 Difference]: Start difference. First operand 416 states and 654 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:06,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:06,265 INFO L93 Difference]: Finished difference Result 1521 states and 2362 transitions. [2025-03-17 04:27:06,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:27:06,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 329 [2025-03-17 04:27:06,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:06,273 INFO L225 Difference]: With dead ends: 1521 [2025-03-17 04:27:06,274 INFO L226 Difference]: Without dead ends: 1106 [2025-03-17 04:27:06,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:27:06,277 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 852 mSDsluCounter, 1752 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:06,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 2411 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 04:27:06,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2025-03-17 04:27:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 644. [2025-03-17 04:27:06,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 490 states have (on average 1.4591836734693877) internal successors, (715), 490 states have internal predecessors, (715), 147 states have call successors, (147), 6 states have call predecessors, (147), 6 states have return successors, (147), 147 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 04:27:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1009 transitions. [2025-03-17 04:27:06,364 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1009 transitions. Word has length 329 [2025-03-17 04:27:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:06,365 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1009 transitions. [2025-03-17 04:27:06,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1009 transitions. [2025-03-17 04:27:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-17 04:27:06,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:06,368 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:06,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:27:06,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:06,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:06,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1661769934, now seen corresponding path program 1 times [2025-03-17 04:27:06,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:06,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384238616] [2025-03-17 04:27:06,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:06,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:06,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-17 04:27:06,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-17 04:27:06,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:06,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384238616] [2025-03-17 04:27:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384238616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:27:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530381493] [2025-03-17 04:27:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:27:07,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:07,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:27:07,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:27:07,274 INFO L87 Difference]: Start difference. First operand 644 states and 1009 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-17 04:27:07,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:07,645 INFO L93 Difference]: Finished difference Result 1675 states and 2607 transitions. [2025-03-17 04:27:07,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:27:07,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) Word has length 329 [2025-03-17 04:27:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:07,652 INFO L225 Difference]: With dead ends: 1675 [2025-03-17 04:27:07,652 INFO L226 Difference]: Without dead ends: 1032 [2025-03-17 04:27:07,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:27:07,655 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 446 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:07,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1474 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:27:07,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-17 04:27:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1026. [2025-03-17 04:27:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 805 states have (on average 1.4596273291925466) internal successors, (1175), 807 states have internal predecessors, (1175), 208 states have call successors, (208), 12 states have call predecessors, (208), 12 states have return successors, (208), 206 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-17 04:27:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1591 transitions. [2025-03-17 04:27:07,733 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1591 transitions. Word has length 329 [2025-03-17 04:27:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:07,733 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1591 transitions. [2025-03-17 04:27:07,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 3 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 3 states have call predecessors, (49), 3 states have call successors, (49) [2025-03-17 04:27:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1591 transitions. [2025-03-17 04:27:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:07,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:07,737 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:07,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:27:07,738 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1664860809, now seen corresponding path program 1 times [2025-03-17 04:27:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:07,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366341235] [2025-03-17 04:27:07,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:07,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:07,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:07,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:07,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:07,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:08,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:08,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366341235] [2025-03-17 04:27:08,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366341235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:08,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:27:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358480494] [2025-03-17 04:27:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:27:08,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:27:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:27:08,936 INFO L87 Difference]: Start difference. First operand 1026 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:09,453 INFO L93 Difference]: Finished difference Result 2016 states and 3116 transitions. [2025-03-17 04:27:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:27:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 330 [2025-03-17 04:27:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:09,466 INFO L225 Difference]: With dead ends: 2016 [2025-03-17 04:27:09,466 INFO L226 Difference]: Without dead ends: 1555 [2025-03-17 04:27:09,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 04:27:09,469 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 349 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:09,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 984 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:27:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2025-03-17 04:27:09,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1182. [2025-03-17 04:27:09,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 945 states have (on average 1.4645502645502646) internal successors, (1384), 949 states have internal predecessors, (1384), 220 states have call successors, (220), 16 states have call predecessors, (220), 16 states have return successors, (220), 216 states have call predecessors, (220), 220 states have call successors, (220) [2025-03-17 04:27:09,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1824 transitions. [2025-03-17 04:27:09,552 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1824 transitions. Word has length 330 [2025-03-17 04:27:09,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:09,554 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1824 transitions. [2025-03-17 04:27:09,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:09,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1824 transitions. [2025-03-17 04:27:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:09,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:09,558 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:27:09,559 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:09,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:09,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1310471481, now seen corresponding path program 1 times [2025-03-17 04:27:09,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:09,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529960867] [2025-03-17 04:27:09,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:09,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:09,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:09,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:09,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:11,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:11,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529960867] [2025-03-17 04:27:11,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529960867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:11,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:11,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:27:11,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465526747] [2025-03-17 04:27:11,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:11,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:27:11,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:11,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:27:11,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:27:11,620 INFO L87 Difference]: Start difference. First operand 1182 states and 1824 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:12,486 INFO L93 Difference]: Finished difference Result 3085 states and 4736 transitions. [2025-03-17 04:27:12,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:27:12,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 330 [2025-03-17 04:27:12,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:12,498 INFO L225 Difference]: With dead ends: 3085 [2025-03-17 04:27:12,499 INFO L226 Difference]: Without dead ends: 1904 [2025-03-17 04:27:12,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:27:12,505 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 601 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:12,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1099 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:27:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2025-03-17 04:27:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1619. [2025-03-17 04:27:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1295 states have (on average 1.4455598455598455) internal successors, (1872), 1303 states have internal predecessors, (1872), 297 states have call successors, (297), 26 states have call predecessors, (297), 26 states have return successors, (297), 289 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-17 04:27:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2466 transitions. [2025-03-17 04:27:12,640 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2466 transitions. Word has length 330 [2025-03-17 04:27:12,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:12,640 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2466 transitions. [2025-03-17 04:27:12,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:12,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2466 transitions. [2025-03-17 04:27:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:12,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:12,643 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:12,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:27:12,643 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash -27377369, now seen corresponding path program 1 times [2025-03-17 04:27:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364300515] [2025-03-17 04:27:12,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:12,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:12,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:12,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:12,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:12,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364300515] [2025-03-17 04:27:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364300515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:12,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406109333] [2025-03-17 04:27:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:12,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:12,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:12,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:12,749 INFO L87 Difference]: Start difference. First operand 1619 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:12,905 INFO L93 Difference]: Finished difference Result 3978 states and 6059 transitions. [2025-03-17 04:27:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 330 [2025-03-17 04:27:12,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:12,917 INFO L225 Difference]: With dead ends: 3978 [2025-03-17 04:27:12,918 INFO L226 Difference]: Without dead ends: 2479 [2025-03-17 04:27:12,920 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 04:27:12,921 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 119 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:12,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 557 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:27:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-03-17 04:27:13,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2405. [2025-03-17 04:27:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 2081 states have (on average 1.4641999038923594) internal successors, (3047), 2089 states have internal predecessors, (3047), 297 states have call successors, (297), 26 states have call predecessors, (297), 26 states have return successors, (297), 289 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-17 04:27:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3641 transitions. [2025-03-17 04:27:13,097 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3641 transitions. Word has length 330 [2025-03-17 04:27:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:13,098 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 3641 transitions. [2025-03-17 04:27:13,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3641 transitions. [2025-03-17 04:27:13,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:13,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:13,103 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:13,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:27:13,104 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:13,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:13,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1698103528, now seen corresponding path program 1 times [2025-03-17 04:27:13,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:13,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027395552] [2025-03-17 04:27:13,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:13,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:13,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:13,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:13,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:13,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:13,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:13,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:13,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027395552] [2025-03-17 04:27:13,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027395552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:13,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:13,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:27:13,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342316841] [2025-03-17 04:27:13,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:13,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:27:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:13,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:27:13,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:27:13,236 INFO L87 Difference]: Start difference. First operand 2405 states and 3641 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:13,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:13,361 INFO L93 Difference]: Finished difference Result 4665 states and 7062 transitions. [2025-03-17 04:27:13,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:27:13,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 330 [2025-03-17 04:27:13,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:13,378 INFO L225 Difference]: With dead ends: 4665 [2025-03-17 04:27:13,378 INFO L226 Difference]: Without dead ends: 2597 [2025-03-17 04:27:13,383 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 04:27:13,384 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 96 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:13,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 600 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:27:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2597 states. [2025-03-17 04:27:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2597 to 2523. [2025-03-17 04:27:13,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2523 states, 2199 states have (on average 1.4538426557526147) internal successors, (3197), 2207 states have internal predecessors, (3197), 297 states have call successors, (297), 26 states have call predecessors, (297), 26 states have return successors, (297), 289 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-17 04:27:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3791 transitions. [2025-03-17 04:27:13,515 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3791 transitions. Word has length 330 [2025-03-17 04:27:13,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:13,516 INFO L471 AbstractCegarLoop]: Abstraction has 2523 states and 3791 transitions. [2025-03-17 04:27:13,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:13,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3791 transitions. [2025-03-17 04:27:13,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-17 04:27:13,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:13,521 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:13,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:27:13,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:13,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:13,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2133428622, now seen corresponding path program 1 times [2025-03-17 04:27:13,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:13,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545166114] [2025-03-17 04:27:13,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:13,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-17 04:27:13,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-17 04:27:13,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545166114] [2025-03-17 04:27:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545166114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:13,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:13,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:27:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238064765] [2025-03-17 04:27:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:13,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:27:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:13,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:27:13,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:27:13,676 INFO L87 Difference]: Start difference. First operand 2523 states and 3791 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:13,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:13,865 INFO L93 Difference]: Finished difference Result 4680 states and 7018 transitions. [2025-03-17 04:27:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:27:13,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 330 [2025-03-17 04:27:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:13,880 INFO L225 Difference]: With dead ends: 4680 [2025-03-17 04:27:13,880 INFO L226 Difference]: Without dead ends: 2581 [2025-03-17 04:27:13,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:27:13,887 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 109 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:13,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 990 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:27:13,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2025-03-17 04:27:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 2507. [2025-03-17 04:27:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2183 states have (on average 1.4498396701786533) internal successors, (3165), 2191 states have internal predecessors, (3165), 297 states have call successors, (297), 26 states have call predecessors, (297), 26 states have return successors, (297), 289 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-17 04:27:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3759 transitions. [2025-03-17 04:27:14,023 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3759 transitions. Word has length 330 [2025-03-17 04:27:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:14,024 INFO L471 AbstractCegarLoop]: Abstraction has 2507 states and 3759 transitions. [2025-03-17 04:27:14,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:14,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3759 transitions. [2025-03-17 04:27:14,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-17 04:27:14,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:14,027 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:14,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:27:14,028 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:14,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:14,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1296272847, now seen corresponding path program 1 times [2025-03-17 04:27:14,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:14,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248262937] [2025-03-17 04:27:14,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:14,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-17 04:27:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-17 04:27:14,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:14,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:15,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:15,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248262937] [2025-03-17 04:27:15,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248262937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:15,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:15,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:27:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885239589] [2025-03-17 04:27:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:15,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:27:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:27:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:27:15,481 INFO L87 Difference]: Start difference. First operand 2507 states and 3759 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:16,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:27:16,313 INFO L93 Difference]: Finished difference Result 3914 states and 5888 transitions. [2025-03-17 04:27:16,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:27:16,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) Word has length 331 [2025-03-17 04:27:16,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:27:16,326 INFO L225 Difference]: With dead ends: 3914 [2025-03-17 04:27:16,327 INFO L226 Difference]: Without dead ends: 2932 [2025-03-17 04:27:16,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:27:16,330 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 429 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:27:16,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 1367 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:27:16,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2025-03-17 04:27:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2511. [2025-03-17 04:27:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2511 states, 2187 states have (on average 1.4490169181527206) internal successors, (3169), 2195 states have internal predecessors, (3169), 297 states have call successors, (297), 26 states have call predecessors, (297), 26 states have return successors, (297), 289 states have call predecessors, (297), 297 states have call successors, (297) [2025-03-17 04:27:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2511 states to 2511 states and 3763 transitions. [2025-03-17 04:27:16,505 INFO L78 Accepts]: Start accepts. Automaton has 2511 states and 3763 transitions. Word has length 331 [2025-03-17 04:27:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:27:16,506 INFO L471 AbstractCegarLoop]: Abstraction has 2511 states and 3763 transitions. [2025-03-17 04:27:16,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 1 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 1 states have call predecessors, (49), 1 states have call successors, (49) [2025-03-17 04:27:16,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2511 states and 3763 transitions. [2025-03-17 04:27:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2025-03-17 04:27:16,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:27:16,511 INFO L218 NwaCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:27:16,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:27:16,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:27:16,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:27:16,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1806807024, now seen corresponding path program 1 times [2025-03-17 04:27:16,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:27:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72337867] [2025-03-17 04:27:16,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:27:16,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:27:16,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 331 statements into 1 equivalence classes. [2025-03-17 04:27:18,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 331 of 331 statements. [2025-03-17 04:27:18,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:27:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:27:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4704 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4704 trivial. 0 not checked. [2025-03-17 04:27:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:27:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72337867] [2025-03-17 04:27:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72337867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:27:58,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:27:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 04:27:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490682691] [2025-03-17 04:27:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:27:58,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 04:27:58,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:27:58,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 04:27:58,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:27:58,736 INFO L87 Difference]: Start difference. First operand 2511 states and 3763 transitions. Second operand has 19 states, 19 states have (on average 4.684210526315789) internal successors, (89), 19 states have internal predecessors, (89), 5 states have call successors, (49), 1 states have call predecessors, (49), 1 states have return successors, (49), 5 states have call predecessors, (49), 5 states have call successors, (49)