./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label36.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:44:47,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:44:47,783 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:44:47,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:44:47,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:44:47,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:44:47,805 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:44:47,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:44:47,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:44:47,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:44:47,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:44:47,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:44:47,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:44:47,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:44:47,807 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:44:47,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:44:47,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:44:47,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:44:47,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:44:47,808 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:44:47,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:47,809 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:44:47,809 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f [2025-02-05 11:44:47,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:44:48,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:44:48,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:44:48,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:44:48,008 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:44:48,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2025-02-05 11:44:49,160 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91c0c82cd/ba07e66c00f3478aae4d7d78a0c1ad0e/FLAGca1f082ed [2025-02-05 11:44:49,560 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:44:49,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2025-02-05 11:44:49,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91c0c82cd/ba07e66c00f3478aae4d7d78a0c1ad0e/FLAGca1f082ed [2025-02-05 11:44:49,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/91c0c82cd/ba07e66c00f3478aae4d7d78a0c1ad0e [2025-02-05 11:44:49,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:44:49,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:44:49,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:49,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:44:49,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:44:49,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:49" (1/1) ... [2025-02-05 11:44:49,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637fae3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:49, skipping insertion in model container [2025-02-05 11:44:49,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:44:49" (1/1) ... [2025-02-05 11:44:49,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:44:49,846 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c[1933,1946] [2025-02-05 11:44:50,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:50,350 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:44:50,364 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c[1933,1946] [2025-02-05 11:44:50,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:44:50,688 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:44:50,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50 WrapperNode [2025-02-05 11:44:50,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:44:50,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:50,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:44:50,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:44:50,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:50,758 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,085 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:44:51,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:44:51,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:44:51,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:44:51,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:44:51,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,222 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,358 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:44:51,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:44:51,625 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:44:51,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:44:51,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:44:51,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (1/1) ... [2025-02-05 11:44:51,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:44:51,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:44:51,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:44:51,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:44:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:44:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:44:51,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:44:51,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:44:51,719 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:44:51,721 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:44:56,083 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:44:56,086 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:44:56,086 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:44:56,222 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:44:56,223 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:44:56,248 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:44:56,248 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:44:56,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:56 BoogieIcfgContainer [2025-02-05 11:44:56,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:44:56,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:44:56,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:44:56,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:44:56,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:44:49" (1/3) ... [2025-02-05 11:44:56,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2120c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:56, skipping insertion in model container [2025-02-05 11:44:56,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:44:50" (2/3) ... [2025-02-05 11:44:56,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2120c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:44:56, skipping insertion in model container [2025-02-05 11:44:56,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:44:56" (3/3) ... [2025-02-05 11:44:56,258 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label36.c [2025-02-05 11:44:56,269 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:44:56,270 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label36.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:44:56,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:44:56,349 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;@24581e4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:44:56,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:44:56,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 11:44:56,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:56,361 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:56,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1639512387, now seen corresponding path program 1 times [2025-02-05 11:44:56,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:56,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165438675] [2025-02-05 11:44:56,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:56,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 11:44:56,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 11:44:56,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:56,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:44:56,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:56,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165438675] [2025-02-05 11:44:56,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165438675] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:56,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:56,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:44:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110786149] [2025-02-05 11:44:56,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:56,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:56,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:56,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:56,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:56,575 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:01,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:01,344 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-02-05 11:45:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-05 11:45:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:01,360 INFO L225 Difference]: With dead ends: 3035 [2025-02-05 11:45:01,360 INFO L226 Difference]: Without dead ends: 1873 [2025-02-05 11:45:01,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-05 11:45:01,366 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 894 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:01,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-02-05 11:45:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-02-05 11:45:01,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-02-05 11:45:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-02-05 11:45:01,458 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 11 [2025-02-05 11:45:01,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:01,459 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-02-05 11:45:01,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:01,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-02-05 11:45:01,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 11:45:01,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:01,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:45:01,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:01,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1754172877, now seen corresponding path program 1 times [2025-02-05 11:45:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793985186] [2025-02-05 11:45:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:01,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 11:45:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 11:45:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:01,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:01,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:01,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793985186] [2025-02-05 11:45:01,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793985186] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:01,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:01,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:45:01,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955944555] [2025-02-05 11:45:01,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:01,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:01,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:01,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:01,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:01,741 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:04,857 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-02-05 11:45:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-02-05 11:45:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:04,867 INFO L225 Difference]: With dead ends: 5317 [2025-02-05 11:45:04,867 INFO L226 Difference]: Without dead ends: 3460 [2025-02-05 11:45:04,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-05 11:45:04,872 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:04,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:45:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-02-05 11:45:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-02-05 11:45:04,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-02-05 11:45:04,974 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 83 [2025-02-05 11:45:04,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:04,975 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-02-05 11:45:04,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:04,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-02-05 11:45:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 11:45:04,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:04,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:04,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:45:04,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:05,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash -800842171, now seen corresponding path program 1 times [2025-02-05 11:45:05,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:05,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727795274] [2025-02-05 11:45:05,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:05,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:05,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 11:45:05,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 11:45:05,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:05,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:05,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727795274] [2025-02-05 11:45:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727795274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:45:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196590616] [2025-02-05 11:45:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:05,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:05,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:05,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:05,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:05,357 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:09,320 INFO L93 Difference]: Finished difference Result 10095 states and 13939 transitions. [2025-02-05 11:45:09,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 11:45:09,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:09,355 INFO L225 Difference]: With dead ends: 10095 [2025-02-05 11:45:09,356 INFO L226 Difference]: Without dead ends: 6638 [2025-02-05 11:45:09,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-05 11:45:09,364 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:09,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 903 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:45:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6638 states. [2025-02-05 11:45:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6631. [2025-02-05 11:45:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-02-05 11:45:09,563 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 97 [2025-02-05 11:45:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:09,564 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-02-05 11:45:09,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-02-05 11:45:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 11:45:09,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:09,568 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:09,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:45:09,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1308429267, now seen corresponding path program 1 times [2025-02-05 11:45:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345492261] [2025-02-05 11:45:09,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:09,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 11:45:09,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 11:45:09,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:09,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:09,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:09,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:09,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345492261] [2025-02-05 11:45:09,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345492261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:09,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:09,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:09,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744438364] [2025-02-05 11:45:09,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:09,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:09,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:09,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:09,708 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:13,093 INFO L93 Difference]: Finished difference Result 16437 states and 21419 transitions. [2025-02-05 11:45:13,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 11:45:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:13,118 INFO L225 Difference]: With dead ends: 16437 [2025-02-05 11:45:13,119 INFO L226 Difference]: Without dead ends: 9808 [2025-02-05 11:45:13,123 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-02-05 11:45:13,124 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1027 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2392 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:13,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 831 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2392 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:45:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9808 states. [2025-02-05 11:45:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9808 to 9797. [2025-02-05 11:45:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9797 states, 9796 states have (on average 1.273887300939159) internal successors, (12479), 9796 states have internal predecessors, (12479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:13,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9797 states to 9797 states and 12479 transitions. [2025-02-05 11:45:13,226 INFO L78 Accepts]: Start accepts. Automaton has 9797 states and 12479 transitions. Word has length 100 [2025-02-05 11:45:13,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:13,226 INFO L471 AbstractCegarLoop]: Abstraction has 9797 states and 12479 transitions. [2025-02-05 11:45:13,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:13,226 INFO L276 IsEmpty]: Start isEmpty. Operand 9797 states and 12479 transitions. [2025-02-05 11:45:13,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 11:45:13,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:13,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:13,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:45:13,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:13,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:13,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1217532669, now seen corresponding path program 1 times [2025-02-05 11:45:13,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:13,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345215740] [2025-02-05 11:45:13,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:13,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:13,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 11:45:13,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 11:45:13,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:13,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:13,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:13,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345215740] [2025-02-05 11:45:13,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345215740] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:13,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:13,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:13,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854007906] [2025-02-05 11:45:13,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:13,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:13,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:13,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:13,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:13,707 INFO L87 Difference]: Start difference. First operand 9797 states and 12479 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:18,986 INFO L93 Difference]: Finished difference Result 29891 states and 37880 transitions. [2025-02-05 11:45:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:18,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2025-02-05 11:45:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:19,020 INFO L225 Difference]: With dead ends: 29891 [2025-02-05 11:45:19,020 INFO L226 Difference]: Without dead ends: 20096 [2025-02-05 11:45:19,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-05 11:45:19,025 INFO L435 NwaCegarLoop]: 1035 mSDtfsCounter, 2127 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 5795 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2127 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 6341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 5795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:19,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2127 Valid, 1311 Invalid, 6341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 5795 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 11:45:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20096 states. [2025-02-05 11:45:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20096 to 20066. [2025-02-05 11:45:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20066 states, 20065 states have (on average 1.1846997258908547) internal successors, (23771), 20065 states have internal predecessors, (23771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20066 states to 20066 states and 23771 transitions. [2025-02-05 11:45:19,222 INFO L78 Accepts]: Start accepts. Automaton has 20066 states and 23771 transitions. Word has length 177 [2025-02-05 11:45:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:19,223 INFO L471 AbstractCegarLoop]: Abstraction has 20066 states and 23771 transitions. [2025-02-05 11:45:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20066 states and 23771 transitions. [2025-02-05 11:45:19,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-02-05 11:45:19,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:19,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:19,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:45:19,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:19,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:19,227 INFO L85 PathProgramCache]: Analyzing trace with hash -74439868, now seen corresponding path program 1 times [2025-02-05 11:45:19,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:19,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607043628] [2025-02-05 11:45:19,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:19,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:19,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-05 11:45:19,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-05 11:45:19,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:19,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:19,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:19,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607043628] [2025-02-05 11:45:19,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607043628] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:19,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:19,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024286963] [2025-02-05 11:45:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:19,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:19,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:19,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:19,450 INFO L87 Difference]: Start difference. First operand 20066 states and 23771 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:22,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:22,202 INFO L93 Difference]: Finished difference Result 45653 states and 54286 transitions. [2025-02-05 11:45:22,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:22,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-02-05 11:45:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:22,244 INFO L225 Difference]: With dead ends: 45653 [2025-02-05 11:45:22,244 INFO L226 Difference]: Without dead ends: 26376 [2025-02-05 11:45:22,264 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-02-05 11:45:22,266 INFO L435 NwaCegarLoop]: 830 mSDtfsCounter, 859 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 655 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 655 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:22,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 950 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [655 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26376 states. [2025-02-05 11:45:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26376 to 25578. [2025-02-05 11:45:22,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25578 states, 25577 states have (on average 1.1777378113148531) internal successors, (30123), 25577 states have internal predecessors, (30123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:22,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25578 states to 25578 states and 30123 transitions. [2025-02-05 11:45:22,526 INFO L78 Accepts]: Start accepts. Automaton has 25578 states and 30123 transitions. Word has length 210 [2025-02-05 11:45:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:22,526 INFO L471 AbstractCegarLoop]: Abstraction has 25578 states and 30123 transitions. [2025-02-05 11:45:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:22,527 INFO L276 IsEmpty]: Start isEmpty. Operand 25578 states and 30123 transitions. [2025-02-05 11:45:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 11:45:22,532 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:22,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:22,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:45:22,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:22,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1362398263, now seen corresponding path program 1 times [2025-02-05 11:45:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:22,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429102128] [2025-02-05 11:45:22,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:22,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 11:45:22,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 11:45:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:22,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:22,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429102128] [2025-02-05 11:45:22,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429102128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:22,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:22,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:22,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381000352] [2025-02-05 11:45:22,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:22,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:22,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:22,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:22,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:22,859 INFO L87 Difference]: Start difference. First operand 25578 states and 30123 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:25,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:25,443 INFO L93 Difference]: Finished difference Result 51187 states and 60304 transitions. [2025-02-05 11:45:25,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:25,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 273 [2025-02-05 11:45:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:25,481 INFO L225 Difference]: With dead ends: 51187 [2025-02-05 11:45:25,482 INFO L226 Difference]: Without dead ends: 26398 [2025-02-05 11:45:25,503 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-02-05 11:45:25,504 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 722 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2542 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 2542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:25,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1918 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 2542 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 11:45:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26398 states. [2025-02-05 11:45:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26398 to 26366. [2025-02-05 11:45:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26366 states, 26365 states have (on average 1.161236487767874) internal successors, (30616), 26365 states have internal predecessors, (30616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:25,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26366 states to 26366 states and 30616 transitions. [2025-02-05 11:45:25,721 INFO L78 Accepts]: Start accepts. Automaton has 26366 states and 30616 transitions. Word has length 273 [2025-02-05 11:45:25,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:25,721 INFO L471 AbstractCegarLoop]: Abstraction has 26366 states and 30616 transitions. [2025-02-05 11:45:25,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 26366 states and 30616 transitions. [2025-02-05 11:45:25,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-05 11:45:25,726 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:25,726 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:25,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:45:25,726 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:25,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:25,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1638811850, now seen corresponding path program 1 times [2025-02-05 11:45:25,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552512201] [2025-02-05 11:45:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:25,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-05 11:45:25,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-05 11:45:25,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:25,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 11:45:25,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:25,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552512201] [2025-02-05 11:45:25,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552512201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:25,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:25,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:25,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809249552] [2025-02-05 11:45:25,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:25,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:25,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:25,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:25,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:25,935 INFO L87 Difference]: Start difference. First operand 26366 states and 30616 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:32,336 INFO L93 Difference]: Finished difference Result 77344 states and 91883 transitions. [2025-02-05 11:45:32,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:32,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2025-02-05 11:45:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:32,402 INFO L225 Difference]: With dead ends: 77344 [2025-02-05 11:45:32,402 INFO L226 Difference]: Without dead ends: 51767 [2025-02-05 11:45:32,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-05 11:45:32,426 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 1709 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 7166 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 8156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 7166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:32,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 1123 Invalid, 8156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 7166 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-02-05 11:45:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51767 states. [2025-02-05 11:45:32,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51767 to 51641. [2025-02-05 11:45:32,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51641 states, 51640 states have (on average 1.1673315259488768) internal successors, (60281), 51640 states have internal predecessors, (60281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:33,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51641 states to 51641 states and 60281 transitions. [2025-02-05 11:45:33,116 INFO L78 Accepts]: Start accepts. Automaton has 51641 states and 60281 transitions. Word has length 299 [2025-02-05 11:45:33,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:33,116 INFO L471 AbstractCegarLoop]: Abstraction has 51641 states and 60281 transitions. [2025-02-05 11:45:33,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 51641 states and 60281 transitions. [2025-02-05 11:45:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-05 11:45:33,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:33,121 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:45:33,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1325208918, now seen corresponding path program 1 times [2025-02-05 11:45:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461201421] [2025-02-05 11:45:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:33,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-05 11:45:33,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-05 11:45:33,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:33,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:45:33,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:33,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461201421] [2025-02-05 11:45:33,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461201421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:33,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:33,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:33,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589381595] [2025-02-05 11:45:33,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:33,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:33,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:33,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:33,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:33,445 INFO L87 Difference]: Start difference. First operand 51641 states and 60281 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:37,625 INFO L93 Difference]: Finished difference Result 119022 states and 137807 transitions. [2025-02-05 11:45:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:37,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 302 [2025-02-05 11:45:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:37,691 INFO L225 Difference]: With dead ends: 119022 [2025-02-05 11:45:37,692 INFO L226 Difference]: Without dead ends: 59507 [2025-02-05 11:45:37,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-02-05 11:45:37,748 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 1470 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 4300 mSolverCounterSat, 780 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 5080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 780 IncrementalHoareTripleChecker+Valid, 4300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:37,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1168 Invalid, 5080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [780 Valid, 4300 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-02-05 11:45:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59507 states. [2025-02-05 11:45:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59507 to 58715. [2025-02-05 11:45:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58715 states, 58714 states have (on average 1.1381782879722042) internal successors, (66827), 58714 states have internal predecessors, (66827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58715 states to 58715 states and 66827 transitions. [2025-02-05 11:45:38,596 INFO L78 Accepts]: Start accepts. Automaton has 58715 states and 66827 transitions. Word has length 302 [2025-02-05 11:45:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:38,597 INFO L471 AbstractCegarLoop]: Abstraction has 58715 states and 66827 transitions. [2025-02-05 11:45:38,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 58715 states and 66827 transitions. [2025-02-05 11:45:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-02-05 11:45:38,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:38,600 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:38,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:45:38,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:38,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 553810621, now seen corresponding path program 1 times [2025-02-05 11:45:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:38,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303154893] [2025-02-05 11:45:38,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:38,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-02-05 11:45:38,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-02-05 11:45:38,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:38,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:38,768 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:38,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:38,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303154893] [2025-02-05 11:45:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303154893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108070554] [2025-02-05 11:45:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:38,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:38,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:38,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:38,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:38,770 INFO L87 Difference]: Start difference. First operand 58715 states and 66827 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:41,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:41,660 INFO L93 Difference]: Finished difference Result 126858 states and 146406 transitions. [2025-02-05 11:45:41,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:41,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2025-02-05 11:45:41,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:41,737 INFO L225 Difference]: With dead ends: 126858 [2025-02-05 11:45:41,738 INFO L226 Difference]: Without dead ends: 68932 [2025-02-05 11:45:41,773 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-02-05 11:45:41,773 INFO L435 NwaCegarLoop]: 1429 mSDtfsCounter, 1155 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 737 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 3028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 737 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:41,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 1518 Invalid, 3028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [737 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:45:41,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68932 states. [2025-02-05 11:45:42,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68932 to 68931. [2025-02-05 11:45:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68931 states, 68930 states have (on average 1.1272305237197155) internal successors, (77700), 68930 states have internal predecessors, (77700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68931 states to 68931 states and 77700 transitions. [2025-02-05 11:45:42,635 INFO L78 Accepts]: Start accepts. Automaton has 68931 states and 77700 transitions. Word has length 327 [2025-02-05 11:45:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:42,636 INFO L471 AbstractCegarLoop]: Abstraction has 68931 states and 77700 transitions. [2025-02-05 11:45:42,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:42,638 INFO L276 IsEmpty]: Start isEmpty. Operand 68931 states and 77700 transitions. [2025-02-05 11:45:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 11:45:42,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:42,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:42,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:45:42,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:42,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:42,643 INFO L85 PathProgramCache]: Analyzing trace with hash -623695077, now seen corresponding path program 1 times [2025-02-05 11:45:42,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:42,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731625147] [2025-02-05 11:45:42,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:42,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 11:45:42,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 11:45:42,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-02-05 11:45:43,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731625147] [2025-02-05 11:45:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731625147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:43,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938057675] [2025-02-05 11:45:43,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:43,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:43,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:43,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:43,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:43,047 INFO L87 Difference]: Start difference. First operand 68931 states and 77700 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:45,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:45,938 INFO L93 Difference]: Finished difference Result 137090 states and 154636 transitions. [2025-02-05 11:45:45,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-02-05 11:45:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:46,013 INFO L225 Difference]: With dead ends: 137090 [2025-02-05 11:45:46,014 INFO L226 Difference]: Without dead ends: 68948 [2025-02-05 11:45:46,055 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-02-05 11:45:46,055 INFO L435 NwaCegarLoop]: 1728 mSDtfsCounter, 706 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:46,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1871 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:45:46,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68948 states. [2025-02-05 11:45:46,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68948 to 68925. [2025-02-05 11:45:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68925 states, 68924 states have (on average 1.10327317044861) internal successors, (76042), 68924 states have internal predecessors, (76042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68925 states to 68925 states and 76042 transitions. [2025-02-05 11:45:47,245 INFO L78 Accepts]: Start accepts. Automaton has 68925 states and 76042 transitions. Word has length 362 [2025-02-05 11:45:47,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:47,245 INFO L471 AbstractCegarLoop]: Abstraction has 68925 states and 76042 transitions. [2025-02-05 11:45:47,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 68925 states and 76042 transitions. [2025-02-05 11:45:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 11:45:47,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:47,259 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:47,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:45:47,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:47,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2038353741, now seen corresponding path program 1 times [2025-02-05 11:45:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588910159] [2025-02-05 11:45:47,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:47,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 11:45:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 11:45:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:45:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:47,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588910159] [2025-02-05 11:45:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588910159] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:47,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:47,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:45:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429641950] [2025-02-05 11:45:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:47,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:45:47,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:47,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:45:47,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:45:47,843 INFO L87 Difference]: Start difference. First operand 68925 states and 76042 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:51,228 INFO L93 Difference]: Finished difference Result 151224 states and 167948 transitions. [2025-02-05 11:45:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:45:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 457 [2025-02-05 11:45:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:51,320 INFO L225 Difference]: With dead ends: 151224 [2025-02-05 11:45:51,320 INFO L226 Difference]: Without dead ends: 83088 [2025-02-05 11:45:51,355 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-02-05 11:45:51,356 INFO L435 NwaCegarLoop]: 1621 mSDtfsCounter, 860 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 644 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:51,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 1762 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [644 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:45:51,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83088 states. [2025-02-05 11:45:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83088 to 83069. [2025-02-05 11:45:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83069 states, 83068 states have (on average 1.0809698078682526) internal successors, (89794), 83068 states have internal predecessors, (89794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83069 states to 83069 states and 89794 transitions. [2025-02-05 11:45:52,371 INFO L78 Accepts]: Start accepts. Automaton has 83069 states and 89794 transitions. Word has length 457 [2025-02-05 11:45:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:45:52,371 INFO L471 AbstractCegarLoop]: Abstraction has 83069 states and 89794 transitions. [2025-02-05 11:45:52,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 83069 states and 89794 transitions. [2025-02-05 11:45:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-02-05 11:45:52,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:45:52,378 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:45:52,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:45:52,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:45:52,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:45:52,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2142748438, now seen corresponding path program 1 times [2025-02-05 11:45:52,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:45:52,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760471301] [2025-02-05 11:45:52,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:45:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:45:52,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-02-05 11:45:52,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-02-05 11:45:52,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:45:52,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:45:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-05 11:45:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:45:52,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760471301] [2025-02-05 11:45:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760471301] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:45:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:45:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:45:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508711076] [2025-02-05 11:45:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:45:52,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:45:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:45:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:45:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:52,773 INFO L87 Difference]: Start difference. First operand 83069 states and 89794 transitions. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:45:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:45:58,676 INFO L93 Difference]: Finished difference Result 238786 states and 259440 transitions. [2025-02-05 11:45:58,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:45:58,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 493 [2025-02-05 11:45:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:45:58,839 INFO L225 Difference]: With dead ends: 238786 [2025-02-05 11:45:58,839 INFO L226 Difference]: Without dead ends: 156506 [2025-02-05 11:45:58,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:45:58,872 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1724 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 6321 mSolverCounterSat, 1038 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 7359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1038 IncrementalHoareTripleChecker+Valid, 6321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:45:58,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 926 Invalid, 7359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1038 Valid, 6321 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 11:45:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156506 states. [2025-02-05 11:46:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156506 to 146877. [2025-02-05 11:46:00,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146877 states, 146876 states have (on average 1.0772488357526075) internal successors, (158222), 146876 states have internal predecessors, (158222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:00,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146877 states to 146877 states and 158222 transitions. [2025-02-05 11:46:00,269 INFO L78 Accepts]: Start accepts. Automaton has 146877 states and 158222 transitions. Word has length 493 [2025-02-05 11:46:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:00,270 INFO L471 AbstractCegarLoop]: Abstraction has 146877 states and 158222 transitions. [2025-02-05 11:46:00,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:00,270 INFO L276 IsEmpty]: Start isEmpty. Operand 146877 states and 158222 transitions. [2025-02-05 11:46:00,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-02-05 11:46:00,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:00,275 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:00,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:46:00,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:00,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:00,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1835719151, now seen corresponding path program 1 times [2025-02-05 11:46:00,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:00,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607291667] [2025-02-05 11:46:00,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:00,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:00,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 11:46:00,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 11:46:00,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:00,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 361 proven. 75 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2025-02-05 11:46:00,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607291667] [2025-02-05 11:46:00,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607291667] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:46:00,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481811698] [2025-02-05 11:46:00,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:00,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:46:00,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:46:00,962 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:46:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:46:01,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-02-05 11:46:01,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-02-05 11:46:01,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:01,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:01,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:46:01,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:46:01,571 INFO L134 CoverageAnalysis]: Checked inductivity of 809 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-02-05 11:46:01,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:46:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481811698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:46:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:46:01,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430677963] [2025-02-05 11:46:01,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:01,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:01,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:01,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:01,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:46:01,583 INFO L87 Difference]: Start difference. First operand 146877 states and 158222 transitions. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:05,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:05,481 INFO L93 Difference]: Finished difference Result 380528 states and 410379 transitions. [2025-02-05 11:46:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:05,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 504 [2025-02-05 11:46:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:05,822 INFO L225 Difference]: With dead ends: 380528 [2025-02-05 11:46:05,822 INFO L226 Difference]: Without dead ends: 234440 [2025-02-05 11:46:05,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 503 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:46:05,906 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1025 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:05,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 965 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:46:06,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234440 states. [2025-02-05 11:46:08,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234440 to 224148. [2025-02-05 11:46:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224148 states, 224147 states have (on average 1.066425158489741) internal successors, (239036), 224147 states have internal predecessors, (239036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224148 states to 224148 states and 239036 transitions. [2025-02-05 11:46:08,868 INFO L78 Accepts]: Start accepts. Automaton has 224148 states and 239036 transitions. Word has length 504 [2025-02-05 11:46:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:08,868 INFO L471 AbstractCegarLoop]: Abstraction has 224148 states and 239036 transitions. [2025-02-05 11:46:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 224148 states and 239036 transitions. [2025-02-05 11:46:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2025-02-05 11:46:08,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:08,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:08,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:46:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 11:46:09,079 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1048483308, now seen corresponding path program 1 times [2025-02-05 11:46:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140047940] [2025-02-05 11:46:09,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:09,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 566 statements into 1 equivalence classes. [2025-02-05 11:46:09,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 566 of 566 statements. [2025-02-05 11:46:09,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:09,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2025-02-05 11:46:09,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:09,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140047940] [2025-02-05 11:46:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140047940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856133622] [2025-02-05 11:46:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:09,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:09,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:09,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:09,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:09,844 INFO L87 Difference]: Start difference. First operand 224148 states and 239036 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:14,902 INFO L93 Difference]: Finished difference Result 534863 states and 570983 transitions. [2025-02-05 11:46:14,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:14,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 566 [2025-02-05 11:46:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:15,346 INFO L225 Difference]: With dead ends: 534863 [2025-02-05 11:46:15,347 INFO L226 Difference]: Without dead ends: 311504 [2025-02-05 11:46:16,043 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-02-05 11:46:16,043 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 996 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 3209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:16,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 564 Invalid, 3209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 11:46:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311504 states. [2025-02-05 11:46:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311504 to 268216. [2025-02-05 11:46:18,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268216 states, 268215 states have (on average 1.0657084801372034) internal successors, (285839), 268215 states have internal predecessors, (285839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268216 states to 268216 states and 285839 transitions. [2025-02-05 11:46:19,538 INFO L78 Accepts]: Start accepts. Automaton has 268216 states and 285839 transitions. Word has length 566 [2025-02-05 11:46:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 268216 states and 285839 transitions. [2025-02-05 11:46:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 268216 states and 285839 transitions. [2025-02-05 11:46:19,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-02-05 11:46:19,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:19,569 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:19,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:46:19,569 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:19,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:19,570 INFO L85 PathProgramCache]: Analyzing trace with hash 958790854, now seen corresponding path program 1 times [2025-02-05 11:46:19,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:19,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77089460] [2025-02-05 11:46:19,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:19,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:19,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-02-05 11:46:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-02-05 11:46:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:19,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2025-02-05 11:46:20,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77089460] [2025-02-05 11:46:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77089460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:20,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103572854] [2025-02-05 11:46:20,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:20,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:20,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:20,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:20,711 INFO L87 Difference]: Start difference. First operand 268216 states and 285839 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)