./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f9f68a3a1240fc969efb46a01cb5f627c0ce9dd351fdfdef3544b10231a4d97 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:34:21,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:34:21,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:34:21,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:34:21,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:34:21,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:34:21,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:34:21,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:34:21,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:34:21,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:34:21,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:34:21,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:34:21,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:34:21,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:34:21,973 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:34:21,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:34:21,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:34:21,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:21,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:34:21,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:34:21,976 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f9f68a3a1240fc969efb46a01cb5f627c0ce9dd351fdfdef3544b10231a4d97 [2025-03-03 10:34:22,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:34:22,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:34:22,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:34:22,220 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:34:22,220 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:34:22,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label02.c [2025-03-03 10:34:23,418 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9683ad/b8e1295e532d44829b869c2afbf60d7e/FLAG190436878 [2025-03-03 10:34:23,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:34:23,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label02.c [2025-03-03 10:34:23,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9683ad/b8e1295e532d44829b869c2afbf60d7e/FLAG190436878 [2025-03-03 10:34:23,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a9683ad/b8e1295e532d44829b869c2afbf60d7e [2025-03-03 10:34:23,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:34:23,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:34:23,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:23,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:34:23,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:34:23,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:23" (1/1) ... [2025-03-03 10:34:23,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b52740c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:23, skipping insertion in model container [2025-03-03 10:34:23,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:34:23" (1/1) ... [2025-03-03 10:34:24,067 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:34:24,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label02.c[7651,7664] [2025-03-03 10:34:24,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:24,671 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:34:24,685 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label02.c[7651,7664] [2025-03-03 10:34:24,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:34:24,925 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:34:24,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24 WrapperNode [2025-03-03 10:34:24,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:34:24,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:24,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:34:24,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:34:24,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:24,967 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,256 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:34:25,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:34:25,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:34:25,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:34:25,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:34:25,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,443 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 10:34:25,446 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:34:25,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:34:25,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:34:25,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:34:25,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (1/1) ... [2025-03-03 10:34:25,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:34:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:34:25,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:34:25,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:34:25,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:34:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:34:25,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:34:25,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:34:25,816 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:34:25,817 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:34:29,065 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:34:29,065 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:34:29,065 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:34:29,175 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:34:29,175 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:34:29,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:34:29,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:34:29,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:29 BoogieIcfgContainer [2025-03-03 10:34:29,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:34:29,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:34:29,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:34:29,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:34:29,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:34:23" (1/3) ... [2025-03-03 10:34:29,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543053eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:29, skipping insertion in model container [2025-03-03 10:34:29,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:34:24" (2/3) ... [2025-03-03 10:34:29,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@543053eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:34:29, skipping insertion in model container [2025-03-03 10:34:29,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:34:29" (3/3) ... [2025-03-03 10:34:29,207 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label02.c [2025-03-03 10:34:29,220 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:34:29,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label02.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:34:29,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:34:29,304 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;@6c39dc33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:34:29,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:34:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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-03-03 10:34:29,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 10:34:29,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:29,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:29,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:29,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash -652944758, now seen corresponding path program 1 times [2025-03-03 10:34:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:29,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788345052] [2025-03-03 10:34:29,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:29,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 10:34:29,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 10:34:29,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:29,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:29,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788345052] [2025-03-03 10:34:29,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788345052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:29,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:29,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393183594] [2025-03-03 10:34:29,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:29,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:29,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:29,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:29,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:29,806 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-03-03 10:34:34,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:34,649 INFO L93 Difference]: Finished difference Result 3143 states and 6127 transitions. [2025-03-03 10:34:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:34,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2025-03-03 10:34:34,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:34,666 INFO L225 Difference]: With dead ends: 3143 [2025-03-03 10:34:34,666 INFO L226 Difference]: Without dead ends: 2257 [2025-03-03 10:34:34,670 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-03-03 10:34:34,672 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 2205 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5311 mSolverCounterSat, 1364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2205 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 6675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1364 IncrementalHoareTripleChecker+Valid, 5311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:34,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2205 Valid, 782 Invalid, 6675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1364 Valid, 5311 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2025-03-03 10:34:34,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2025-03-03 10:34:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2025-03-03 10:34:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.513741134751773) internal successors, (3415), 2256 states have internal predecessors, (3415), 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-03-03 10:34:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3415 transitions. [2025-03-03 10:34:34,770 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3415 transitions. Word has length 62 [2025-03-03 10:34:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:34,771 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3415 transitions. [2025-03-03 10:34:34,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 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-03-03 10:34:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3415 transitions. [2025-03-03 10:34:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 10:34:34,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:34,774 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 10:34:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:34:34,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:34,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash 157165806, now seen corresponding path program 1 times [2025-03-03 10:34:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415893794] [2025-03-03 10:34:34,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 10:34:34,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 10:34:34,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:34,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:35,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:35,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415893794] [2025-03-03 10:34:35,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415893794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:35,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:35,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:35,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271784282] [2025-03-03 10:34:35,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:35,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:35,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:35,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:35,076 INFO L87 Difference]: Start difference. First operand 2257 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-03-03 10:34:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:38,125 INFO L93 Difference]: Finished difference Result 6051 states and 9520 transitions. [2025-03-03 10:34:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:38,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2025-03-03 10:34:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:38,136 INFO L225 Difference]: With dead ends: 6051 [2025-03-03 10:34:38,137 INFO L226 Difference]: Without dead ends: 3759 [2025-03-03 10:34:38,139 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-03-03 10:34:38,139 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:38,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 711 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:34:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2025-03-03 10:34:38,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2025-03-03 10:34:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3304949441192124) internal successors, (5000), 3758 states have internal predecessors, (5000), 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-03-03 10:34:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5000 transitions. [2025-03-03 10:34:38,197 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5000 transitions. Word has length 133 [2025-03-03 10:34:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5000 transitions. [2025-03-03 10:34:38,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 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-03-03 10:34:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5000 transitions. [2025-03-03 10:34:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-03 10:34:38,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:38,205 INFO L218 NwaCegarLoop]: trace histogram [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, 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-03-03 10:34:38,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:34:38,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:38,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:38,206 INFO L85 PathProgramCache]: Analyzing trace with hash -516085991, now seen corresponding path program 1 times [2025-03-03 10:34:38,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:38,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086292941] [2025-03-03 10:34:38,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:38,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:38,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-03 10:34:38,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-03 10:34:38,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:38,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:34:38,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086292941] [2025-03-03 10:34:38,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086292941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:38,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:38,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422053388] [2025-03-03 10:34:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:34:38,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:38,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:34:38,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:34:38,812 INFO L87 Difference]: Start difference. First operand 3759 states and 5000 transitions. Second operand has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 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-03-03 10:34:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:41,164 INFO L93 Difference]: Finished difference Result 9057 states and 12624 transitions. [2025-03-03 10:34:41,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:41,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 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 274 [2025-03-03 10:34:41,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:41,177 INFO L225 Difference]: With dead ends: 9057 [2025-03-03 10:34:41,177 INFO L226 Difference]: Without dead ends: 5263 [2025-03-03 10:34:41,181 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-03-03 10:34:41,181 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:41,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 324 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:34:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2025-03-03 10:34:41,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5261. [2025-03-03 10:34:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.3241444866920151) internal successors, (6965), 5260 states have internal predecessors, (6965), 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-03-03 10:34:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6965 transitions. [2025-03-03 10:34:41,247 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6965 transitions. Word has length 274 [2025-03-03 10:34:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:41,247 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6965 transitions. [2025-03-03 10:34:41,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.25) internal successors, (205), 3 states have internal predecessors, (205), 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-03-03 10:34:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6965 transitions. [2025-03-03 10:34:41,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-03 10:34:41,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:41,250 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:34:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:34:41,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:41,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:41,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1861286966, now seen corresponding path program 1 times [2025-03-03 10:34:41,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997551804] [2025-03-03 10:34:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:41,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-03 10:34:41,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-03 10:34:41,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:41,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:34:41,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:41,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997551804] [2025-03-03 10:34:41,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997551804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:41,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:41,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:41,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202198567] [2025-03-03 10:34:41,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:41,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:41,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:41,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:41,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:41,475 INFO L87 Difference]: Start difference. First operand 5261 states and 6965 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-03-03 10:34:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:43,793 INFO L93 Difference]: Finished difference Result 15026 states and 20134 transitions. [2025-03-03 10:34:43,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 288 [2025-03-03 10:34:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:43,815 INFO L225 Difference]: With dead ends: 15026 [2025-03-03 10:34:43,815 INFO L226 Difference]: Without dead ends: 9767 [2025-03-03 10:34:43,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:43,820 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 675 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:43,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1261 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:34:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-03-03 10:34:43,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-03-03 10:34:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2974605775138235) internal successors, (12671), 9766 states have internal predecessors, (12671), 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-03-03 10:34:43,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12671 transitions. [2025-03-03 10:34:43,930 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12671 transitions. Word has length 288 [2025-03-03 10:34:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:43,930 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12671 transitions. [2025-03-03 10:34:43,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-03-03 10:34:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12671 transitions. [2025-03-03 10:34:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-03-03 10:34:43,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:43,933 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:34:43,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:34:43,933 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:43,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:43,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2092001536, now seen corresponding path program 1 times [2025-03-03 10:34:43,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:43,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469026793] [2025-03-03 10:34:43,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:43,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:43,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-03-03 10:34:43,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-03-03 10:34:43,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:43,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:34:44,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469026793] [2025-03-03 10:34:44,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469026793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:44,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:44,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514147061] [2025-03-03 10:34:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:44,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:44,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:44,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:44,104 INFO L87 Difference]: Start difference. First operand 9767 states and 12671 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-03-03 10:34:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:46,313 INFO L93 Difference]: Finished difference Result 26291 states and 34784 transitions. [2025-03-03 10:34:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:46,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 292 [2025-03-03 10:34:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:46,342 INFO L225 Difference]: With dead ends: 26291 [2025-03-03 10:34:46,342 INFO L226 Difference]: Without dead ends: 16526 [2025-03-03 10:34:46,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:46,347 INFO L435 NwaCegarLoop]: 1222 mSDtfsCounter, 710 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:46,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1230 Invalid, 2958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:34:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-03-03 10:34:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 16526. [2025-03-03 10:34:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16526 states, 16525 states have (on average 1.2953101361573374) internal successors, (21405), 16525 states have internal predecessors, (21405), 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-03-03 10:34:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16526 states to 16526 states and 21405 transitions. [2025-03-03 10:34:46,536 INFO L78 Accepts]: Start accepts. Automaton has 16526 states and 21405 transitions. Word has length 292 [2025-03-03 10:34:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:46,537 INFO L471 AbstractCegarLoop]: Abstraction has 16526 states and 21405 transitions. [2025-03-03 10:34:46,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-03-03 10:34:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states and 21405 transitions. [2025-03-03 10:34:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 10:34:46,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:46,541 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-03 10:34:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:34:46,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:46,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2040375074, now seen corresponding path program 1 times [2025-03-03 10:34:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390916187] [2025-03-03 10:34:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:46,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 10:34:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 10:34:46,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:46,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-03 10:34:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390916187] [2025-03-03 10:34:46,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390916187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:34:46,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009464687] [2025-03-03 10:34:46,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:46,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:46,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:46,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:46,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:46,707 INFO L87 Difference]: Start difference. First operand 16526 states and 21405 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-03-03 10:34:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:48,812 INFO L93 Difference]: Finished difference Result 33050 states and 42808 transitions. [2025-03-03 10:34:48,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:48,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 296 [2025-03-03 10:34:48,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:48,836 INFO L225 Difference]: With dead ends: 33050 [2025-03-03 10:34:48,837 INFO L226 Difference]: Without dead ends: 16526 [2025-03-03 10:34:48,844 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-03-03 10:34:48,846 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 694 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 2672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:48,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 431 Invalid, 2672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:34:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16526 states. [2025-03-03 10:34:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16526 to 15024. [2025-03-03 10:34:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15024 states, 15023 states have (on average 1.1913732277174998) internal successors, (17898), 15023 states have internal predecessors, (17898), 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-03-03 10:34:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15024 states to 15024 states and 17898 transitions. [2025-03-03 10:34:48,984 INFO L78 Accepts]: Start accepts. Automaton has 15024 states and 17898 transitions. Word has length 296 [2025-03-03 10:34:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:48,985 INFO L471 AbstractCegarLoop]: Abstraction has 15024 states and 17898 transitions. [2025-03-03 10:34:48,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-03-03 10:34:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15024 states and 17898 transitions. [2025-03-03 10:34:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-03 10:34:48,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:48,994 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:34:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:34:48,994 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:48,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 978170268, now seen corresponding path program 1 times [2025-03-03 10:34:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826601412] [2025-03-03 10:34:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:49,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-03 10:34:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-03 10:34:49,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:49,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:34:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:49,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826601412] [2025-03-03 10:34:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826601412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:49,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:49,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871350980] [2025-03-03 10:34:49,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:49,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:49,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:49,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:49,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:49,502 INFO L87 Difference]: Start difference. First operand 15024 states and 17898 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-03-03 10:34:51,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:51,650 INFO L93 Difference]: Finished difference Result 38307 states and 46180 transitions. [2025-03-03 10:34:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:51,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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 375 [2025-03-03 10:34:51,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:51,688 INFO L225 Difference]: With dead ends: 38307 [2025-03-03 10:34:51,688 INFO L226 Difference]: Without dead ends: 23285 [2025-03-03 10:34:51,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:51,700 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 780 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:51,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 105 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [738 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:34:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2025-03-03 10:34:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 23285. [2025-03-03 10:34:51,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.190474145335853) internal successors, (27719), 23284 states have internal predecessors, (27719), 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-03-03 10:34:51,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 27719 transitions. [2025-03-03 10:34:51,887 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 27719 transitions. Word has length 375 [2025-03-03 10:34:51,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:51,888 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 27719 transitions. [2025-03-03 10:34:51,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 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-03-03 10:34:51,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 27719 transitions. [2025-03-03 10:34:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-03-03 10:34:51,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:51,893 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:51,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:34:51,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:51,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1379028873, now seen corresponding path program 1 times [2025-03-03 10:34:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074656132] [2025-03-03 10:34:51,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:51,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-03-03 10:34:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-03-03 10:34:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:34:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074656132] [2025-03-03 10:34:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074656132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442894002] [2025-03-03 10:34:52,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:52,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:52,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:52,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:52,149 INFO L87 Difference]: Start difference. First operand 23285 states and 27719 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-03-03 10:34:53,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:53,932 INFO L93 Difference]: Finished difference Result 54078 states and 64450 transitions. [2025-03-03 10:34:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:34:53,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 389 [2025-03-03 10:34:53,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:53,974 INFO L225 Difference]: With dead ends: 54078 [2025-03-03 10:34:53,974 INFO L226 Difference]: Without dead ends: 30795 [2025-03-03 10:34:53,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:53,991 INFO L435 NwaCegarLoop]: 1196 mSDtfsCounter, 676 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:53,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1204 Invalid, 2453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:34:54,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30795 states. [2025-03-03 10:34:54,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30795 to 30795. [2025-03-03 10:34:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30795 states, 30794 states have (on average 1.1701630187698902) internal successors, (36034), 30794 states have internal predecessors, (36034), 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-03-03 10:34:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30795 states to 30795 states and 36034 transitions. [2025-03-03 10:34:54,330 INFO L78 Accepts]: Start accepts. Automaton has 30795 states and 36034 transitions. Word has length 389 [2025-03-03 10:34:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:54,331 INFO L471 AbstractCegarLoop]: Abstraction has 30795 states and 36034 transitions. [2025-03-03 10:34:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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-03-03 10:34:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30795 states and 36034 transitions. [2025-03-03 10:34:54,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-03-03 10:34:54,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:54,337 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:34:54,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:34:54,338 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:54,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1291140969, now seen corresponding path program 1 times [2025-03-03 10:34:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244157339] [2025-03-03 10:34:54,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:54,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-03-03 10:34:54,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-03-03 10:34:54,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:54,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 10:34:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:55,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244157339] [2025-03-03 10:34:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244157339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:55,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:55,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:34:55,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816230987] [2025-03-03 10:34:55,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:55,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:34:55,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:55,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:34:55,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:55,073 INFO L87 Difference]: Start difference. First operand 30795 states and 36034 transitions. Second operand has 5 states, 5 states have (on average 62.6) internal successors, (313), 4 states have internal predecessors, (313), 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-03-03 10:34:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:34:58,668 INFO L93 Difference]: Finished difference Result 70602 states and 81885 transitions. [2025-03-03 10:34:58,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:34:58,668 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 62.6) internal successors, (313), 4 states have internal predecessors, (313), 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 390 [2025-03-03 10:34:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:34:58,771 INFO L225 Difference]: With dead ends: 70602 [2025-03-03 10:34:58,771 INFO L226 Difference]: Without dead ends: 39809 [2025-03-03 10:34:58,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:34:58,787 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 1421 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 6012 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 6342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 6012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:34:58,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 403 Invalid, 6342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 6012 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-03 10:34:58,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39809 states. [2025-03-03 10:34:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39809 to 35301. [2025-03-03 10:34:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35301 states, 35300 states have (on average 1.1544475920679886) internal successors, (40752), 35300 states have internal predecessors, (40752), 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-03-03 10:34:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35301 states to 35301 states and 40752 transitions. [2025-03-03 10:34:59,069 INFO L78 Accepts]: Start accepts. Automaton has 35301 states and 40752 transitions. Word has length 390 [2025-03-03 10:34:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:34:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 35301 states and 40752 transitions. [2025-03-03 10:34:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.6) internal successors, (313), 4 states have internal predecessors, (313), 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-03-03 10:34:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 35301 states and 40752 transitions. [2025-03-03 10:34:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-03-03 10:34:59,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:34:59,073 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:34:59,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:34:59,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:34:59,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:34:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1941369106, now seen corresponding path program 1 times [2025-03-03 10:34:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:34:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473157871] [2025-03-03 10:34:59,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:34:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:34:59,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-03 10:34:59,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-03 10:34:59,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:34:59,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:34:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:34:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:34:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473157871] [2025-03-03 10:34:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473157871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:34:59,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:34:59,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:34:59,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253610733] [2025-03-03 10:34:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:34:59,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:34:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:34:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:34:59,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:34:59,212 INFO L87 Difference]: Start difference. First operand 35301 states and 40752 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-03-03 10:35:01,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:01,585 INFO L93 Difference]: Finished difference Result 93130 states and 108776 transitions. [2025-03-03 10:35:01,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:01,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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 400 [2025-03-03 10:35:01,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:01,653 INFO L225 Difference]: With dead ends: 93130 [2025-03-03 10:35:01,653 INFO L226 Difference]: Without dead ends: 57831 [2025-03-03 10:35:01,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:01,692 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 619 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 619 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:01,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 559 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [619 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:35:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57831 states. [2025-03-03 10:35:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57831 to 57831. [2025-03-03 10:35:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57831 states, 57830 states have (on average 1.142330970084731) internal successors, (66061), 57830 states have internal predecessors, (66061), 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-03-03 10:35:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57831 states to 57831 states and 66061 transitions. [2025-03-03 10:35:02,290 INFO L78 Accepts]: Start accepts. Automaton has 57831 states and 66061 transitions. Word has length 400 [2025-03-03 10:35:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:02,291 INFO L471 AbstractCegarLoop]: Abstraction has 57831 states and 66061 transitions. [2025-03-03 10:35:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 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-03-03 10:35:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 57831 states and 66061 transitions. [2025-03-03 10:35:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2025-03-03 10:35:02,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:02,295 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:35:02,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:35:02,296 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:02,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1279189703, now seen corresponding path program 1 times [2025-03-03 10:35:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992424361] [2025-03-03 10:35:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:02,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-03 10:35:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-03 10:35:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 452 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:35:03,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992424361] [2025-03-03 10:35:03,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992424361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:35:03,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606476506] [2025-03-03 10:35:03,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:03,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:35:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:35:03,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:35:03,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:35:03,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 421 statements into 1 equivalence classes. [2025-03-03 10:35:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 421 of 421 statements. [2025-03-03 10:35:03,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:03,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:03,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:35:03,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:35:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 312 proven. 60 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:35:03,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:35:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 312 proven. 60 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:35:04,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606476506] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:35:04,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:35:04,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2025-03-03 10:35:04,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115908280] [2025-03-03 10:35:04,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:35:04,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 10:35:04,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:04,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 10:35:04,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 10:35:04,118 INFO L87 Difference]: Start difference. First operand 57831 states and 66061 transitions. Second operand has 11 states, 11 states have (on average 80.36363636363636) internal successors, (884), 11 states have internal predecessors, (884), 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-03-03 10:35:27,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:27,377 INFO L93 Difference]: Finished difference Result 210288 states and 240307 transitions. [2025-03-03 10:35:27,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 10:35:27,377 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 80.36363636363636) internal successors, (884), 11 states have internal predecessors, (884), 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 421 [2025-03-03 10:35:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:27,535 INFO L225 Difference]: With dead ends: 210288 [2025-03-03 10:35:27,535 INFO L226 Difference]: Without dead ends: 150957 [2025-03-03 10:35:27,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2025-03-03 10:35:27,575 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 11516 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 47260 mSolverCounterSat, 3181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11516 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 50441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3181 IncrementalHoareTripleChecker+Valid, 47260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:27,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11516 Valid, 399 Invalid, 50441 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3181 Valid, 47260 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2025-03-03 10:35:27,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150957 states. [2025-03-03 10:35:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150957 to 125421. [2025-03-03 10:35:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125421 states, 125420 states have (on average 1.129237761122628) internal successors, (141629), 125420 states have internal predecessors, (141629), 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-03-03 10:35:28,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125421 states to 125421 states and 141629 transitions. [2025-03-03 10:35:28,756 INFO L78 Accepts]: Start accepts. Automaton has 125421 states and 141629 transitions. Word has length 421 [2025-03-03 10:35:28,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:28,756 INFO L471 AbstractCegarLoop]: Abstraction has 125421 states and 141629 transitions. [2025-03-03 10:35:28,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 80.36363636363636) internal successors, (884), 11 states have internal predecessors, (884), 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-03-03 10:35:28,756 INFO L276 IsEmpty]: Start isEmpty. Operand 125421 states and 141629 transitions. [2025-03-03 10:35:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2025-03-03 10:35:28,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:28,762 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:35:28,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:35:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 10:35:28,963 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:28,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1524017795, now seen corresponding path program 1 times [2025-03-03 10:35:28,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14858822] [2025-03-03 10:35:28,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:28,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 470 statements into 1 equivalence classes. [2025-03-03 10:35:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 470 of 470 statements. [2025-03-03 10:35:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:35:29,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:29,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14858822] [2025-03-03 10:35:29,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14858822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:29,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:29,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:29,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469958806] [2025-03-03 10:35:29,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:29,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:29,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:29,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:29,300 INFO L87 Difference]: Start difference. First operand 125421 states and 141629 transitions. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-03-03 10:35:31,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:31,828 INFO L93 Difference]: Finished difference Result 254595 states and 287095 transitions. [2025-03-03 10:35:31,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:31,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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 470 [2025-03-03 10:35:31,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:31,961 INFO L225 Difference]: With dead ends: 254595 [2025-03-03 10:35:31,961 INFO L226 Difference]: Without dead ends: 128425 [2025-03-03 10:35:31,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:31,994 INFO L435 NwaCegarLoop]: 1186 mSDtfsCounter, 662 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2085 mSolverCounterSat, 596 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 2681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 596 IncrementalHoareTripleChecker+Valid, 2085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:31,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1193 Invalid, 2681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [596 Valid, 2085 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:35:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128425 states. [2025-03-03 10:35:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128425 to 122417. [2025-03-03 10:35:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122417 states, 122416 states have (on average 1.0901271075676382) internal successors, (133449), 122416 states have internal predecessors, (133449), 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-03-03 10:35:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122417 states to 122417 states and 133449 transitions. [2025-03-03 10:35:33,060 INFO L78 Accepts]: Start accepts. Automaton has 122417 states and 133449 transitions. Word has length 470 [2025-03-03 10:35:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:33,060 INFO L471 AbstractCegarLoop]: Abstraction has 122417 states and 133449 transitions. [2025-03-03 10:35:33,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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-03-03 10:35:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 122417 states and 133449 transitions. [2025-03-03 10:35:33,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-03 10:35:33,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:33,066 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:33,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:35:33,066 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:33,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1338492182, now seen corresponding path program 1 times [2025-03-03 10:35:33,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:33,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944289257] [2025-03-03 10:35:33,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:33,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:33,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-03 10:35:33,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-03 10:35:33,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:33,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:33,432 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 10:35:33,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:33,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944289257] [2025-03-03 10:35:33,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944289257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:33,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:33,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:33,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082489046] [2025-03-03 10:35:33,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:33,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:33,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:33,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:33,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:33,433 INFO L87 Difference]: Start difference. First operand 122417 states and 133449 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-03 10:35:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:35,772 INFO L93 Difference]: Finished difference Result 267362 states and 290929 transitions. [2025-03-03 10:35:35,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:35,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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 480 [2025-03-03 10:35:35,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:35,964 INFO L225 Difference]: With dead ends: 267362 [2025-03-03 10:35:35,964 INFO L226 Difference]: Without dead ends: 144947 [2025-03-03 10:35:36,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:36,047 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 710 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2181 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:36,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 587 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2181 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:35:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144947 states. [2025-03-03 10:35:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144947 to 135935. [2025-03-03 10:35:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135935 states, 135934 states have (on average 1.0866082069239484) internal successors, (147707), 135934 states have internal predecessors, (147707), 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-03-03 10:35:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135935 states to 135935 states and 147707 transitions. [2025-03-03 10:35:37,904 INFO L78 Accepts]: Start accepts. Automaton has 135935 states and 147707 transitions. Word has length 480 [2025-03-03 10:35:37,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:37,904 INFO L471 AbstractCegarLoop]: Abstraction has 135935 states and 147707 transitions. [2025-03-03 10:35:37,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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-03-03 10:35:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 135935 states and 147707 transitions. [2025-03-03 10:35:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-03 10:35:37,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:37,910 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:37,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:35:37,910 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:37,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 915593362, now seen corresponding path program 1 times [2025-03-03 10:35:37,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:37,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191527129] [2025-03-03 10:35:37,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:37,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:37,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-03 10:35:37,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-03 10:35:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-03-03 10:35:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191527129] [2025-03-03 10:35:38,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191527129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:38,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:38,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:38,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325723809] [2025-03-03 10:35:38,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:38,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:38,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:38,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:38,174 INFO L87 Difference]: Start difference. First operand 135935 states and 147707 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-03-03 10:35:40,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:40,343 INFO L93 Difference]: Finished difference Result 277125 states and 300796 transitions. [2025-03-03 10:35:40,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:40,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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 488 [2025-03-03 10:35:40,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:40,501 INFO L225 Difference]: With dead ends: 277125 [2025-03-03 10:35:40,501 INFO L226 Difference]: Without dead ends: 134433 [2025-03-03 10:35:40,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:40,581 INFO L435 NwaCegarLoop]: 1307 mSDtfsCounter, 723 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:40,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1314 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 1962 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:35:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134433 states. [2025-03-03 10:35:41,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134433 to 118662. [2025-03-03 10:35:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118662 states, 118661 states have (on average 1.0838607461592267) internal successors, (128612), 118661 states have internal predecessors, (128612), 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-03-03 10:35:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118662 states to 118662 states and 128612 transitions. [2025-03-03 10:35:41,928 INFO L78 Accepts]: Start accepts. Automaton has 118662 states and 128612 transitions. Word has length 488 [2025-03-03 10:35:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:41,928 INFO L471 AbstractCegarLoop]: Abstraction has 118662 states and 128612 transitions. [2025-03-03 10:35:41,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 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-03-03 10:35:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 118662 states and 128612 transitions. [2025-03-03 10:35:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-03 10:35:41,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:41,934 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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] [2025-03-03 10:35:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:35:41,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:41,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:41,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1440703129, now seen corresponding path program 1 times [2025-03-03 10:35:41,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:41,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039440965] [2025-03-03 10:35:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:41,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-03 10:35:41,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-03 10:35:41,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:41,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 597 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-03 10:35:42,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039440965] [2025-03-03 10:35:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039440965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:42,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307441200] [2025-03-03 10:35:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:42,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:42,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:42,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:42,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:42,254 INFO L87 Difference]: Start difference. First operand 118662 states and 128612 transitions. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-03-03 10:35:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:35:44,765 INFO L93 Difference]: Finished difference Result 274121 states and 298654 transitions. [2025-03-03 10:35:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:35:44,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 494 [2025-03-03 10:35:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:35:44,934 INFO L225 Difference]: With dead ends: 274121 [2025-03-03 10:35:44,934 INFO L226 Difference]: Without dead ends: 154710 [2025-03-03 10:35:44,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:44,993 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 668 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 2790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:35:44,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1226 Invalid, 2790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:35:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154710 states. [2025-03-03 10:35:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154710 to 149453. [2025-03-03 10:35:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149453 states, 149452 states have (on average 1.0755560313679309) internal successors, (160744), 149452 states have internal predecessors, (160744), 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-03-03 10:35:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149453 states to 149453 states and 160744 transitions. [2025-03-03 10:35:46,713 INFO L78 Accepts]: Start accepts. Automaton has 149453 states and 160744 transitions. Word has length 494 [2025-03-03 10:35:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:35:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 149453 states and 160744 transitions. [2025-03-03 10:35:46,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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-03-03 10:35:46,713 INFO L276 IsEmpty]: Start isEmpty. Operand 149453 states and 160744 transitions. [2025-03-03 10:35:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 10:35:46,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:35:46,720 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:35:46,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:35:46,721 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:35:46,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:35:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -702905517, now seen corresponding path program 1 times [2025-03-03 10:35:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:35:46,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957931384] [2025-03-03 10:35:46,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:35:46,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:35:46,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 10:35:46,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 10:35:46,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:35:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:35:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 787 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-03 10:35:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:35:47,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957931384] [2025-03-03 10:35:47,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957931384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:35:47,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:35:47,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:35:47,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840565400] [2025-03-03 10:35:47,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:35:47,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:35:47,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:35:47,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:35:47,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:35:47,235 INFO L87 Difference]: Start difference. First operand 149453 states and 160744 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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)