./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label06.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label06.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 df2b5c022524eef310b1de6141625f90d464b51feae63f6fbead126ad9876e79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:59:01,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:59:02,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:59:02,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:59:02,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:59:02,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:59:02,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:59:02,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:59:02,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:59:02,069 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:59:02,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:59:02,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:59:02,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:59:02,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:59:02,069 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:59:02,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:59:02,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:59:02,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:59:02,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:59:02,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:59:02,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:59:02,073 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 -> df2b5c022524eef310b1de6141625f90d464b51feae63f6fbead126ad9876e79 [2025-03-16 14:59:02,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:59:02,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:59:02,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:59:02,302 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:59:02,302 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:59:02,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label06.c [2025-03-16 14:59:03,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875b40030/05b4e5330d0b4f7994d08bb58efe41ca/FLAGe1b1fcd34 [2025-03-16 14:59:03,894 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:59:03,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label06.c [2025-03-16 14:59:03,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875b40030/05b4e5330d0b4f7994d08bb58efe41ca/FLAGe1b1fcd34 [2025-03-16 14:59:03,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875b40030/05b4e5330d0b4f7994d08bb58efe41ca [2025-03-16 14:59:03,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:59:03,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:59:03,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:59:03,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:59:03,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:59:03,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:59:03" (1/1) ... [2025-03-16 14:59:03,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c937912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:03, skipping insertion in model container [2025-03-16 14:59:03,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:59:03" (1/1) ... [2025-03-16 14:59:04,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:59:04,242 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/Problem13_label06.c[3786,3799] [2025-03-16 14:59:04,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:59:04,823 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:59:04,836 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/Problem13_label06.c[3786,3799] [2025-03-16 14:59:05,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:59:05,134 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:59:05,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05 WrapperNode [2025-03-16 14:59:05,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:59:05,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:59:05,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:59:05,137 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:59:05,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,193 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,534 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 14:59:05,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:59:05,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:59:05,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:59:05,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:59:05,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,800 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-16 14:59:05,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:05,980 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:06,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:59:06,021 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:59:06,021 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:59:06,021 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:59:06,022 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (1/1) ... [2025-03-16 14:59:06,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:59:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:06,049 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-16 14:59:06,054 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-16 14:59:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:59:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:59:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:59:06,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:59:06,125 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:59:06,127 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:59:10,008 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 14:59:10,012 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:59:10,013 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:59:10,162 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 14:59:10,162 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:59:10,190 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:59:10,190 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:59:10,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:10 BoogieIcfgContainer [2025-03-16 14:59:10,191 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:59:10,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:59:10,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:59:10,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:59:10,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:59:03" (1/3) ... [2025-03-16 14:59:10,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa3cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:10, skipping insertion in model container [2025-03-16 14:59:10,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:59:05" (2/3) ... [2025-03-16 14:59:10,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44fa3cef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:59:10, skipping insertion in model container [2025-03-16 14:59:10,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:59:10" (3/3) ... [2025-03-16 14:59:10,197 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label06.c [2025-03-16 14:59:10,210 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:59:10,211 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label06.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:59:10,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:59:10,293 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;@6a189185, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:59:10,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:59:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 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-16 14:59:10,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 14:59:10,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:10,306 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] [2025-03-16 14:59:10,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:10,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:10,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1849873722, now seen corresponding path program 1 times [2025-03-16 14:59:10,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:10,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586485332] [2025-03-16 14:59:10,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:10,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:10,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 14:59:10,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 14:59:10,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:10,403 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-16 14:59:10,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:10,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586485332] [2025-03-16 14:59:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586485332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:10,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:10,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61498894] [2025-03-16 14:59:10,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:10,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:59:10,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:10,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:59:10,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:10,428 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 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 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-16 14:59:10,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:10,503 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 14:59:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:59:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2025-03-16 14:59:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:10,519 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 14:59:10,519 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 14:59:10,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:59:10,526 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:10,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:59:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 14:59:10,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 14:59:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 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-16 14:59:10,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 14:59:10,601 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 24 [2025-03-16 14:59:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:10,602 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 14:59:10,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 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-16 14:59:10,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 14:59:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 14:59:10,603 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:10,603 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] [2025-03-16 14:59:10,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:59:10,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:10,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash 945502567, now seen corresponding path program 1 times [2025-03-16 14:59:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:10,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213377172] [2025-03-16 14:59:10,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:10,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:10,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 14:59:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 14:59:10,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:10,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:10,754 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-16 14:59:10,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:10,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213377172] [2025-03-16 14:59:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213377172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:10,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:10,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206620573] [2025-03-16 14:59:10,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:10,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:10,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:10,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:10,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:10,760 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-16 14:59:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:13,864 INFO L93 Difference]: Finished difference Result 2905 states and 5325 transitions. [2025-03-16 14:59:13,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:13,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2025-03-16 14:59:13,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:13,871 INFO L225 Difference]: With dead ends: 2905 [2025-03-16 14:59:13,871 INFO L226 Difference]: Without dead ends: 1872 [2025-03-16 14:59:13,872 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-16 14:59:13,872 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 864 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2445 mSolverCounterSat, 798 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 798 IncrementalHoareTripleChecker+Valid, 2445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:13,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1091 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [798 Valid, 2445 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-16 14:59:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2025-03-16 14:59:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1858. [2025-03-16 14:59:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1857 states have (on average 1.5444264943457189) internal successors, (2868), 1857 states have internal predecessors, (2868), 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-16 14:59:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2868 transitions. [2025-03-16 14:59:13,909 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2868 transitions. Word has length 24 [2025-03-16 14:59:13,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:13,909 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2868 transitions. [2025-03-16 14:59:13,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-16 14:59:13,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2868 transitions. [2025-03-16 14:59:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-16 14:59:13,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:13,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:13,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:59:13,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:13,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash 549706290, now seen corresponding path program 1 times [2025-03-16 14:59:13,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:13,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689256542] [2025-03-16 14:59:13,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:13,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-16 14:59:13,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-16 14:59:13,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:14,149 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:14,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:14,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689256542] [2025-03-16 14:59:14,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689256542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:14,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:14,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:14,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639047292] [2025-03-16 14:59:14,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:14,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:14,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:14,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:14,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:14,151 INFO L87 Difference]: Start difference. First operand 1858 states and 2868 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-16 14:59:16,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:16,978 INFO L93 Difference]: Finished difference Result 5316 states and 8228 transitions. [2025-03-16 14:59:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:16,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2025-03-16 14:59:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:16,990 INFO L225 Difference]: With dead ends: 5316 [2025-03-16 14:59:16,990 INFO L226 Difference]: Without dead ends: 3459 [2025-03-16 14:59:16,993 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-16 14:59:16,995 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:16,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1191 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 14:59:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3459 states. [2025-03-16 14:59:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3459 to 3458. [2025-03-16 14:59:17,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 3457 states have (on average 1.380676887474689) internal successors, (4773), 3457 states have internal predecessors, (4773), 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-16 14:59:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4773 transitions. [2025-03-16 14:59:17,046 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4773 transitions. Word has length 96 [2025-03-16 14:59:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:17,047 INFO L471 AbstractCegarLoop]: Abstraction has 3458 states and 4773 transitions. [2025-03-16 14:59:17,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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-16 14:59:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4773 transitions. [2025-03-16 14:59:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 14:59:17,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:17,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:59:17,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:17,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:17,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1305839082, now seen corresponding path program 1 times [2025-03-16 14:59:17,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:17,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42027090] [2025-03-16 14:59:17,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:17,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:17,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 14:59:17,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 14:59:17,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:17,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:17,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:17,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42027090] [2025-03-16 14:59:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42027090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:17,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670263841] [2025-03-16 14:59:17,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:17,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:17,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:17,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:17,173 INFO L87 Difference]: Start difference. First operand 3458 states and 4773 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-16 14:59:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:19,697 INFO L93 Difference]: Finished difference Result 10094 states and 13938 transitions. [2025-03-16 14:59:19,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:19,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2025-03-16 14:59:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:19,713 INFO L225 Difference]: With dead ends: 10094 [2025-03-16 14:59:19,714 INFO L226 Difference]: Without dead ends: 6637 [2025-03-16 14:59:19,717 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-16 14:59:19,718 INFO L435 NwaCegarLoop]: 770 mSDtfsCounter, 932 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2551 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:19,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 902 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2551 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:59:19,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6637 states. [2025-03-16 14:59:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6637 to 6630. [2025-03-16 14:59:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6630 states, 6629 states have (on average 1.2722884296273949) internal successors, (8434), 6629 states have internal predecessors, (8434), 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-16 14:59:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6630 states to 6630 states and 8434 transitions. [2025-03-16 14:59:19,795 INFO L78 Accepts]: Start accepts. Automaton has 6630 states and 8434 transitions. Word has length 110 [2025-03-16 14:59:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 6630 states and 8434 transitions. [2025-03-16 14:59:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-16 14:59:19,796 INFO L276 IsEmpty]: Start isEmpty. Operand 6630 states and 8434 transitions. [2025-03-16 14:59:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-16 14:59:19,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:19,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:59:19,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1821400, now seen corresponding path program 1 times [2025-03-16 14:59:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125980804] [2025-03-16 14:59:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:19,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-16 14:59:19,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-16 14:59:19,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:19,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:19,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:19,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125980804] [2025-03-16 14:59:19,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125980804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:19,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:19,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:19,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308769388] [2025-03-16 14:59:19,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:19,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:19,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:19,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:19,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:19,917 INFO L87 Difference]: Start difference. First operand 6630 states and 8434 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-16 14:59:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:22,322 INFO L93 Difference]: Finished difference Result 16420 states and 21399 transitions. [2025-03-16 14:59:22,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:22,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 113 [2025-03-16 14:59:22,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:22,343 INFO L225 Difference]: With dead ends: 16420 [2025-03-16 14:59:22,344 INFO L226 Difference]: Without dead ends: 9791 [2025-03-16 14:59:22,348 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-16 14:59:22,349 INFO L435 NwaCegarLoop]: 1591 mSDtfsCounter, 972 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:22,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1688 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:59:22,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9791 states. [2025-03-16 14:59:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9791 to 9782. [2025-03-16 14:59:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9782 states, 9781 states have (on average 1.2759431550966158) internal successors, (12480), 9781 states have internal predecessors, (12480), 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-16 14:59:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9782 states to 9782 states and 12480 transitions. [2025-03-16 14:59:22,458 INFO L78 Accepts]: Start accepts. Automaton has 9782 states and 12480 transitions. Word has length 113 [2025-03-16 14:59:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:22,458 INFO L471 AbstractCegarLoop]: Abstraction has 9782 states and 12480 transitions. [2025-03-16 14:59:22,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-16 14:59:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 9782 states and 12480 transitions. [2025-03-16 14:59:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-16 14:59:22,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:22,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:22,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:59:22,461 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:22,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:22,461 INFO L85 PathProgramCache]: Analyzing trace with hash -862663436, now seen corresponding path program 1 times [2025-03-16 14:59:22,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:22,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898249476] [2025-03-16 14:59:22,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:22,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:22,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-16 14:59:22,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-16 14:59:22,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:22,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 14:59:22,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898249476] [2025-03-16 14:59:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898249476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:22,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311461949] [2025-03-16 14:59:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:22,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:22,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:22,589 INFO L87 Difference]: Start difference. First operand 9782 states and 12480 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-16 14:59:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:25,021 INFO L93 Difference]: Finished difference Result 29054 states and 37055 transitions. [2025-03-16 14:59:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:25,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 120 [2025-03-16 14:59:25,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:25,055 INFO L225 Difference]: With dead ends: 29054 [2025-03-16 14:59:25,055 INFO L226 Difference]: Without dead ends: 19273 [2025-03-16 14:59:25,065 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-16 14:59:25,066 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 906 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 3436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 535 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:25,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 676 Invalid, 3436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [535 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:59:25,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2025-03-16 14:59:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 19266. [2025-03-16 14:59:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19265 states have (on average 1.2415260835712432) internal successors, (23918), 19265 states have internal predecessors, (23918), 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-16 14:59:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 23918 transitions. [2025-03-16 14:59:25,347 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 23918 transitions. Word has length 120 [2025-03-16 14:59:25,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:25,348 INFO L471 AbstractCegarLoop]: Abstraction has 19266 states and 23918 transitions. [2025-03-16 14:59:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-16 14:59:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 23918 transitions. [2025-03-16 14:59:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-16 14:59:25,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:25,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:25,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:59:25,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:25,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:25,353 INFO L85 PathProgramCache]: Analyzing trace with hash 970855449, now seen corresponding path program 1 times [2025-03-16 14:59:25,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:25,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000323993] [2025-03-16 14:59:25,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:25,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:25,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-16 14:59:25,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-16 14:59:25,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:25,526 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:25,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:25,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000323993] [2025-03-16 14:59:25,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000323993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:25,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:25,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:25,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979945493] [2025-03-16 14:59:25,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:25,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:25,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:25,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:25,528 INFO L87 Difference]: Start difference. First operand 19266 states and 23918 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-16 14:59:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:27,605 INFO L93 Difference]: Finished difference Result 33800 states and 42680 transitions. [2025-03-16 14:59:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:27,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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 140 [2025-03-16 14:59:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:27,635 INFO L225 Difference]: With dead ends: 33800 [2025-03-16 14:59:27,635 INFO L226 Difference]: Without dead ends: 19267 [2025-03-16 14:59:27,648 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-16 14:59:27,649 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 676 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:27,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1206 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:59:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19267 states. [2025-03-16 14:59:27,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19267 to 19266. [2025-03-16 14:59:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19265 states have (on average 1.241266545548923) internal successors, (23913), 19265 states have internal predecessors, (23913), 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-16 14:59:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 23913 transitions. [2025-03-16 14:59:27,813 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 23913 transitions. Word has length 140 [2025-03-16 14:59:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:27,813 INFO L471 AbstractCegarLoop]: Abstraction has 19266 states and 23913 transitions. [2025-03-16 14:59:27,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 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-16 14:59:27,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 23913 transitions. [2025-03-16 14:59:27,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-16 14:59:27,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:27,817 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:27,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:59:27,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:27,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash 536901386, now seen corresponding path program 1 times [2025-03-16 14:59:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:27,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173606262] [2025-03-16 14:59:27,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:27,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-16 14:59:27,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-16 14:59:27,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:27,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 14:59:28,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:28,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173606262] [2025-03-16 14:59:28,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173606262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:28,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:59:28,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126916999] [2025-03-16 14:59:28,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:28,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:28,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:28,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:28,299 INFO L87 Difference]: Start difference. First operand 19266 states and 23913 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-16 14:59:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:31,190 INFO L93 Difference]: Finished difference Result 37744 states and 47028 transitions. [2025-03-16 14:59:31,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:31,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 229 [2025-03-16 14:59:31,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:31,214 INFO L225 Difference]: With dead ends: 37744 [2025-03-16 14:59:31,214 INFO L226 Difference]: Without dead ends: 19266 [2025-03-16 14:59:31,229 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-16 14:59:31,230 INFO L435 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:31,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 14:59:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19266 states. [2025-03-16 14:59:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19266 to 19266. [2025-03-16 14:59:31,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19265 states have (on average 1.2410070075266026) internal successors, (23908), 19265 states have internal predecessors, (23908), 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-16 14:59:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 23908 transitions. [2025-03-16 14:59:31,384 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 23908 transitions. Word has length 229 [2025-03-16 14:59:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:31,384 INFO L471 AbstractCegarLoop]: Abstraction has 19266 states and 23908 transitions. [2025-03-16 14:59:31,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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-16 14:59:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 23908 transitions. [2025-03-16 14:59:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-16 14:59:31,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:31,386 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:31,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:59:31,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:31,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:31,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1230570278, now seen corresponding path program 1 times [2025-03-16 14:59:31,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:31,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60004292] [2025-03-16 14:59:31,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-16 14:59:31,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-16 14:59:31,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:31,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:31,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60004292] [2025-03-16 14:59:31,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60004292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:31,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:31,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351499824] [2025-03-16 14:59:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:31,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:31,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:31,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:31,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:31,590 INFO L87 Difference]: Start difference. First operand 19266 states and 23908 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-16 14:59:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:34,139 INFO L93 Difference]: Finished difference Result 37768 states and 47065 transitions. [2025-03-16 14:59:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:34,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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 236 [2025-03-16 14:59:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:34,160 INFO L225 Difference]: With dead ends: 37768 [2025-03-16 14:59:34,160 INFO L226 Difference]: Without dead ends: 19290 [2025-03-16 14:59:34,171 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-16 14:59:34,172 INFO L435 NwaCegarLoop]: 1752 mSDtfsCounter, 782 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:34,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1891 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:34,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19290 states. [2025-03-16 14:59:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19290 to 19266. [2025-03-16 14:59:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19266 states, 19265 states have (on average 1.1511549441993252) internal successors, (22177), 19265 states have internal predecessors, (22177), 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-16 14:59:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19266 states to 19266 states and 22177 transitions. [2025-03-16 14:59:34,327 INFO L78 Accepts]: Start accepts. Automaton has 19266 states and 22177 transitions. Word has length 236 [2025-03-16 14:59:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 19266 states and 22177 transitions. [2025-03-16 14:59:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 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-16 14:59:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 19266 states and 22177 transitions. [2025-03-16 14:59:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-16 14:59:34,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:34,330 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:34,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:59:34,330 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:34,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash 869316136, now seen corresponding path program 1 times [2025-03-16 14:59:34,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:34,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965589591] [2025-03-16 14:59:34,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:34,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-16 14:59:34,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-16 14:59:34,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:34,436 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:34,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:34,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965589591] [2025-03-16 14:59:34,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965589591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:34,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:34,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:34,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422557037] [2025-03-16 14:59:34,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:34,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:34,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:34,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:34,438 INFO L87 Difference]: Start difference. First operand 19266 states and 22177 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-16 14:59:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:36,913 INFO L93 Difference]: Finished difference Result 53474 states and 61966 transitions. [2025-03-16 14:59:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:36,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 245 [2025-03-16 14:59:36,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:36,945 INFO L225 Difference]: With dead ends: 53474 [2025-03-16 14:59:36,945 INFO L226 Difference]: Without dead ends: 34209 [2025-03-16 14:59:36,960 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-16 14:59:36,961 INFO L435 NwaCegarLoop]: 1678 mSDtfsCounter, 929 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 811 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1813 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 811 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:36,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1813 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [811 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 14:59:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34209 states. [2025-03-16 14:59:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34209 to 33417. [2025-03-16 14:59:37,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33417 states, 33416 states have (on average 1.12251615992339) internal successors, (37510), 33416 states have internal predecessors, (37510), 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-16 14:59:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33417 states to 33417 states and 37510 transitions. [2025-03-16 14:59:37,275 INFO L78 Accepts]: Start accepts. Automaton has 33417 states and 37510 transitions. Word has length 245 [2025-03-16 14:59:37,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:37,275 INFO L471 AbstractCegarLoop]: Abstraction has 33417 states and 37510 transitions. [2025-03-16 14:59:37,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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-16 14:59:37,275 INFO L276 IsEmpty]: Start isEmpty. Operand 33417 states and 37510 transitions. [2025-03-16 14:59:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 14:59:37,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:37,278 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:59:37,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:59:37,278 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:37,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash 2082298701, now seen corresponding path program 1 times [2025-03-16 14:59:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:37,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518300033] [2025-03-16 14:59:37,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:37,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 14:59:37,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 14:59:37,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:37,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 45 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:59:38,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518300033] [2025-03-16 14:59:38,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518300033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:38,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541781916] [2025-03-16 14:59:38,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:38,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:38,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:38,041 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-16 14:59:38,042 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-16 14:59:38,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 14:59:38,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 14:59:38,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:38,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:38,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:38,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 14:59:38,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541781916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 14:59:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864007324] [2025-03-16 14:59:38,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:38,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:38,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:38,181 INFO L87 Difference]: Start difference. First operand 33417 states and 37510 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-16 14:59:40,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:40,530 INFO L93 Difference]: Finished difference Result 66044 states and 74226 transitions. [2025-03-16 14:59:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:40,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 265 [2025-03-16 14:59:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:40,564 INFO L225 Difference]: With dead ends: 66044 [2025-03-16 14:59:40,564 INFO L226 Difference]: Without dead ends: 33415 [2025-03-16 14:59:40,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:40,585 INFO L435 NwaCegarLoop]: 1352 mSDtfsCounter, 1179 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:40,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 1433 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:59:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33415 states. [2025-03-16 14:59:40,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33415 to 33414. [2025-03-16 14:59:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33414 states, 33413 states have (on average 1.0946338251578727) internal successors, (36575), 33413 states have internal predecessors, (36575), 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-16 14:59:40,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33414 states to 33414 states and 36575 transitions. [2025-03-16 14:59:40,842 INFO L78 Accepts]: Start accepts. Automaton has 33414 states and 36575 transitions. Word has length 265 [2025-03-16 14:59:40,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:40,843 INFO L471 AbstractCegarLoop]: Abstraction has 33414 states and 36575 transitions. [2025-03-16 14:59:40,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-16 14:59:40,843 INFO L276 IsEmpty]: Start isEmpty. Operand 33414 states and 36575 transitions. [2025-03-16 14:59:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 14:59:40,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:40,846 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:59:40,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 14:59:41,046 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-16 14:59:41,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:41,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1019498054, now seen corresponding path program 1 times [2025-03-16 14:59:41,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:41,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064717478] [2025-03-16 14:59:41,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:41,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 14:59:41,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 14:59:41,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:41,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 536 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-16 14:59:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064717478] [2025-03-16 14:59:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064717478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:41,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:41,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:41,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641550750] [2025-03-16 14:59:41,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:41,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:41,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:41,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:41,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:41,248 INFO L87 Difference]: Start difference. First operand 33414 states and 36575 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-16 14:59:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:44,560 INFO L93 Difference]: Finished difference Result 96851 states and 106210 transitions. [2025-03-16 14:59:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 353 [2025-03-16 14:59:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:44,619 INFO L225 Difference]: With dead ends: 96851 [2025-03-16 14:59:44,619 INFO L226 Difference]: Without dead ends: 63436 [2025-03-16 14:59:44,641 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-16 14:59:44,642 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 964 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 3741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:44,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 556 Invalid, 3741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-16 14:59:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63436 states. [2025-03-16 14:59:45,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63436 to 60195. [2025-03-16 14:59:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60195 states, 60194 states have (on average 1.0979665747416687) internal successors, (66091), 60194 states have internal predecessors, (66091), 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-16 14:59:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60195 states to 60195 states and 66091 transitions. [2025-03-16 14:59:45,100 INFO L78 Accepts]: Start accepts. Automaton has 60195 states and 66091 transitions. Word has length 353 [2025-03-16 14:59:45,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:45,100 INFO L471 AbstractCegarLoop]: Abstraction has 60195 states and 66091 transitions. [2025-03-16 14:59:45,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-16 14:59:45,100 INFO L276 IsEmpty]: Start isEmpty. Operand 60195 states and 66091 transitions. [2025-03-16 14:59:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2025-03-16 14:59:45,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:45,106 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:59:45,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:59:45,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:45,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 985355278, now seen corresponding path program 1 times [2025-03-16 14:59:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560447437] [2025-03-16 14:59:45,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:45,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-03-16 14:59:45,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-03-16 14:59:45,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:45,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 629 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2025-03-16 14:59:45,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:45,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560447437] [2025-03-16 14:59:45,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560447437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:45,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:45,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:45,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111507346] [2025-03-16 14:59:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:45,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:59:45,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:45,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:59:45,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:59:45,358 INFO L87 Difference]: Start difference. First operand 60195 states and 66091 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:59:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:50,057 INFO L93 Difference]: Finished difference Result 189072 states and 208095 transitions. [2025-03-16 14:59:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:59:50,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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 404 [2025-03-16 14:59:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:50,203 INFO L225 Difference]: With dead ends: 189072 [2025-03-16 14:59:50,203 INFO L226 Difference]: Without dead ends: 130454 [2025-03-16 14:59:50,260 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-16 14:59:50,260 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 1724 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 5952 mSolverCounterSat, 1086 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1724 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 7038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1086 IncrementalHoareTripleChecker+Valid, 5952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1724 Valid, 798 Invalid, 7038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1086 Valid, 5952 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-16 14:59:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130454 states. [2025-03-16 14:59:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130454 to 126386. [2025-03-16 14:59:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126386 states, 126385 states have (on average 1.0937848637100922) internal successors, (138238), 126385 states have internal predecessors, (138238), 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-16 14:59:51,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126386 states to 126386 states and 138238 transitions. [2025-03-16 14:59:51,626 INFO L78 Accepts]: Start accepts. Automaton has 126386 states and 138238 transitions. Word has length 404 [2025-03-16 14:59:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:51,626 INFO L471 AbstractCegarLoop]: Abstraction has 126386 states and 138238 transitions. [2025-03-16 14:59:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 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-16 14:59:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 126386 states and 138238 transitions. [2025-03-16 14:59:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-03-16 14:59:51,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:51,633 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 14:59:51,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:59:51,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:51,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:51,633 INFO L85 PathProgramCache]: Analyzing trace with hash 573374392, now seen corresponding path program 1 times [2025-03-16 14:59:51,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:51,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209067824] [2025-03-16 14:59:51,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:51,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:51,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 14:59:51,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 14:59:51,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:51,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:52,581 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 283 proven. 113 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 14:59:52,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209067824] [2025-03-16 14:59:52,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209067824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:59:52,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702007563] [2025-03-16 14:59:52,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:59:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:59:52,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:59:52,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:59:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-03-16 14:59:52,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-03-16 14:59:52,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:52,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:52,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:59:52,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:59:52,734 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-16 14:59:52,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:59:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702007563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:52,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:59:52,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 14:59:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16157283] [2025-03-16 14:59:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:52,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:52,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:52,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:52,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:52,737 INFO L87 Difference]: Start difference. First operand 126386 states and 138238 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-16 14:59:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:59:55,911 INFO L93 Difference]: Finished difference Result 280307 states and 308401 transitions. [2025-03-16 14:59:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:59:55,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 415 [2025-03-16 14:59:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:59:56,088 INFO L225 Difference]: With dead ends: 280307 [2025-03-16 14:59:56,088 INFO L226 Difference]: Without dead ends: 168098 [2025-03-16 14:59:56,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 14:59:56,122 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 948 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2692 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:59:56,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 716 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2692 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 14:59:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168098 states. [2025-03-16 14:59:57,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168098 to 105895. [2025-03-16 14:59:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105895 states, 105894 states have (on average 1.0955106049445673) internal successors, (116008), 105894 states have internal predecessors, (116008), 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-16 14:59:57,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105895 states to 105895 states and 116008 transitions. [2025-03-16 14:59:57,845 INFO L78 Accepts]: Start accepts. Automaton has 105895 states and 116008 transitions. Word has length 415 [2025-03-16 14:59:57,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:59:57,846 INFO L471 AbstractCegarLoop]: Abstraction has 105895 states and 116008 transitions. [2025-03-16 14:59:57,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-16 14:59:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand 105895 states and 116008 transitions. [2025-03-16 14:59:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 14:59:57,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:59:57,855 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:59:57,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:59:58,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-16 14:59:58,056 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:59:58,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:59:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash 146205240, now seen corresponding path program 1 times [2025-03-16 14:59:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:59:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950265848] [2025-03-16 14:59:58,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:59:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:59:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 14:59:58,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 14:59:58,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:59:58,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:59:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-16 14:59:58,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:59:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950265848] [2025-03-16 14:59:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950265848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:59:58,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:59:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:59:58,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813476626] [2025-03-16 14:59:58,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:59:58,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:59:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:59:58,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:59:58,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:59:58,334 INFO L87 Difference]: Start difference. First operand 105895 states and 116008 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-16 15:00:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:01,048 INFO L93 Difference]: Finished difference Result 218056 states and 239636 transitions. [2025-03-16 15:00:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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 481 [2025-03-16 15:00:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:01,184 INFO L225 Difference]: With dead ends: 218056 [2025-03-16 15:00:01,184 INFO L226 Difference]: Without dead ends: 112949 [2025-03-16 15:00:01,211 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-16 15:00:01,211 INFO L435 NwaCegarLoop]: 1425 mSDtfsCounter, 1012 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:01,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1507 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112949 states. [2025-03-16 15:00:02,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112949 to 111374. [2025-03-16 15:00:02,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111374 states, 111373 states have (on average 1.091682903396694) internal successors, (121584), 111373 states have internal predecessors, (121584), 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-16 15:00:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111374 states to 111374 states and 121584 transitions. [2025-03-16 15:00:02,691 INFO L78 Accepts]: Start accepts. Automaton has 111374 states and 121584 transitions. Word has length 481 [2025-03-16 15:00:02,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:02,691 INFO L471 AbstractCegarLoop]: Abstraction has 111374 states and 121584 transitions. [2025-03-16 15:00:02,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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-16 15:00:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 111374 states and 121584 transitions. [2025-03-16 15:00:02,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-16 15:00:02,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:02,704 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:00:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:00:02,704 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:02,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash 951086153, now seen corresponding path program 1 times [2025-03-16 15:00:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627941055] [2025-03-16 15:00:02,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:02,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-16 15:00:02,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-16 15:00:02,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:03,596 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 286 proven. 110 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-16 15:00:03,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627941055] [2025-03-16 15:00:03,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627941055] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:00:03,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644640025] [2025-03-16 15:00:03,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:00:03,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:00:03,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:00:03,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-16 15:00:03,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-16 15:00:03,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:03,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:00:03,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:00:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-16 15:00:04,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:00:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644640025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:00:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:00:04,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605186540] [2025-03-16 15:00:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:04,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:04,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:04,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:04,226 INFO L87 Difference]: Start difference. First operand 111374 states and 121584 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-16 15:00:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:07,140 INFO L93 Difference]: Finished difference Result 221950 states and 242366 transitions. [2025-03-16 15:00:07,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:07,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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 532 [2025-03-16 15:00:07,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:07,283 INFO L225 Difference]: With dead ends: 221950 [2025-03-16 15:00:07,284 INFO L226 Difference]: Without dead ends: 111364 [2025-03-16 15:00:07,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 531 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:00:07,355 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 853 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:07,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 758 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:00:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111364 states. [2025-03-16 15:00:08,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111364 to 106639. [2025-03-16 15:00:08,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106639 states, 106638 states have (on average 1.0679495114311972) internal successors, (113884), 106638 states have internal predecessors, (113884), 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-16 15:00:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106639 states to 106639 states and 113884 transitions. [2025-03-16 15:00:08,634 INFO L78 Accepts]: Start accepts. Automaton has 106639 states and 113884 transitions. Word has length 532 [2025-03-16 15:00:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:08,635 INFO L471 AbstractCegarLoop]: Abstraction has 106639 states and 113884 transitions. [2025-03-16 15:00:08,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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-16 15:00:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 106639 states and 113884 transitions. [2025-03-16 15:00:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1092 [2025-03-16 15:00:08,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:08,699 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:00:08,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:00:08,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:00:08,901 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:08,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash 159808916, now seen corresponding path program 1 times [2025-03-16 15:00:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128383895] [2025-03-16 15:00:08,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:08,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:08,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1091 statements into 1 equivalence classes. [2025-03-16 15:00:09,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1091 of 1091 statements. [2025-03-16 15:00:09,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:09,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 912 proven. 0 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2025-03-16 15:00:09,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:09,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128383895] [2025-03-16 15:00:09,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128383895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:09,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:09,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248561276] [2025-03-16 15:00:09,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:09,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:09,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:09,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:09,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:09,564 INFO L87 Difference]: Start difference. First operand 106639 states and 113884 transitions. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-16 15:00:12,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:12,642 INFO L93 Difference]: Finished difference Result 251879 states and 269648 transitions. [2025-03-16 15:00:12,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:12,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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 1091 [2025-03-16 15:00:12,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:12,815 INFO L225 Difference]: With dead ends: 251879 [2025-03-16 15:00:12,815 INFO L226 Difference]: Without dead ends: 146028 [2025-03-16 15:00:12,873 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-16 15:00:12,873 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 983 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2453 mSolverCounterSat, 939 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 3392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 939 IncrementalHoareTripleChecker+Valid, 2453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:12,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 685 Invalid, 3392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [939 Valid, 2453 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:00:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146028 states. [2025-03-16 15:00:14,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146028 to 145235. [2025-03-16 15:00:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145235 states, 145234 states have (on average 1.065466763980886) internal successors, (154742), 145234 states have internal predecessors, (154742), 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-16 15:00:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145235 states to 145235 states and 154742 transitions. [2025-03-16 15:00:14,559 INFO L78 Accepts]: Start accepts. Automaton has 145235 states and 154742 transitions. Word has length 1091 [2025-03-16 15:00:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:14,559 INFO L471 AbstractCegarLoop]: Abstraction has 145235 states and 154742 transitions. [2025-03-16 15:00:14,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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-16 15:00:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 145235 states and 154742 transitions. [2025-03-16 15:00:14,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1154 [2025-03-16 15:00:14,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:14,620 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:00:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:00:14,620 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:14,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1335620774, now seen corresponding path program 1 times [2025-03-16 15:00:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437277013] [2025-03-16 15:00:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:14,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1153 statements into 1 equivalence classes. [2025-03-16 15:00:14,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1153 of 1153 statements. [2025-03-16 15:00:14,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:14,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 690 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-03-16 15:00:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437277013] [2025-03-16 15:00:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437277013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044418414] [2025-03-16 15:00:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:15,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:00:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:00:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:00:15,427 INFO L87 Difference]: Start difference. First operand 145235 states and 154742 transitions. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-16 15:00:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:18,377 INFO L93 Difference]: Finished difference Result 329824 states and 352421 transitions. [2025-03-16 15:00:18,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:00:18,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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 1153 [2025-03-16 15:00:18,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:18,614 INFO L225 Difference]: With dead ends: 329824 [2025-03-16 15:00:18,614 INFO L226 Difference]: Without dead ends: 185377 [2025-03-16 15:00:18,696 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-16 15:00:18,696 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 776 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 2939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:18,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1885 Invalid, 2939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:00:18,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185377 states. [2025-03-16 15:00:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185377 to 177500. [2025-03-16 15:00:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177500 states, 177499 states have (on average 1.0583214553321427) internal successors, (187851), 177499 states have internal predecessors, (187851), 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-16 15:00:20,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177500 states to 177500 states and 187851 transitions. [2025-03-16 15:00:20,796 INFO L78 Accepts]: Start accepts. Automaton has 177500 states and 187851 transitions. Word has length 1153 [2025-03-16 15:00:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:00:20,797 INFO L471 AbstractCegarLoop]: Abstraction has 177500 states and 187851 transitions. [2025-03-16 15:00:20,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 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-16 15:00:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 177500 states and 187851 transitions. [2025-03-16 15:00:20,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2025-03-16 15:00:20,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:00:20,884 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:00:20,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:00:20,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:00:20,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:00:20,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1160019969, now seen corresponding path program 1 times [2025-03-16 15:00:20,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:00:20,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383701240] [2025-03-16 15:00:20,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:00:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:00:20,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1155 statements into 1 equivalence classes. [2025-03-16 15:00:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1155 of 1155 statements. [2025-03-16 15:00:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:00:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:00:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1401 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-03-16 15:00:22,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:00:22,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383701240] [2025-03-16 15:00:22,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383701240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:00:22,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:00:22,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:00:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756700413] [2025-03-16 15:00:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:00:22,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:00:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:00:22,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:00:22,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:00:22,232 INFO L87 Difference]: Start difference. First operand 177500 states and 187851 transitions. Second operand has 4 states, 4 states have (on average 213.75) internal successors, (855), 3 states have internal predecessors, (855), 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-16 15:00:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:00:27,150 INFO L93 Difference]: Finished difference Result 391325 states and 413611 transitions. [2025-03-16 15:00:27,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:00:27,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 213.75) internal successors, (855), 3 states have internal predecessors, (855), 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 1155 [2025-03-16 15:00:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:00:27,400 INFO L225 Difference]: With dead ends: 391325 [2025-03-16 15:00:27,400 INFO L226 Difference]: Without dead ends: 214613 [2025-03-16 15:00:27,519 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-16 15:00:27,519 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1648 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5718 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 6381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 5718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:00:27,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 859 Invalid, 6381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 5718 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 15:00:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214613 states.