./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ead0eea170c5a9d81f9726cf37f718700e7559d903645dc78a3313310603417e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:24:05,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:24:05,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:24:05,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:24:05,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:24:05,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:24:05,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:24:05,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:24:05,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:24:05,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:24:05,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:24:05,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:24:05,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:24:05,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:24:05,140 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:24:05,140 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:05,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:24:05,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:24:05,141 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 -> ead0eea170c5a9d81f9726cf37f718700e7559d903645dc78a3313310603417e [2025-03-17 00:24:05,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:24:05,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:24:05,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:24:05,378 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:24:05,378 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:24:05,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i [2025-03-17 00:24:06,616 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43213fbbd/b2bc552cc91c4ec28789e823ab0ccd5a/FLAGc8f59801e [2025-03-17 00:24:06,914 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:24:06,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i [2025-03-17 00:24:06,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43213fbbd/b2bc552cc91c4ec28789e823ab0ccd5a/FLAGc8f59801e [2025-03-17 00:24:06,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43213fbbd/b2bc552cc91c4ec28789e823ab0ccd5a [2025-03-17 00:24:06,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:24:06,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:24:06,957 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:06,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:24:06,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:24:06,961 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:06" (1/1) ... [2025-03-17 00:24:06,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c242d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:06, skipping insertion in model container [2025-03-17 00:24:06,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:24:06" (1/1) ... [2025-03-17 00:24:06,997 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:24:07,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i[916,929] [2025-03-17 00:24:07,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:07,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:24:07,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-10.i[916,929] [2025-03-17 00:24:07,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:24:07,367 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:24:07,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07 WrapperNode [2025-03-17 00:24:07,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:24:07,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:07,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:24:07,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:24:07,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,472 INFO L138 Inliner]: procedures = 26, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 839 [2025-03-17 00:24:07,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:24:07,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:24:07,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:24:07,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:24:07,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,534 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:24:07,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:24:07,593 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:24:07,593 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:24:07,593 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:24:07,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (1/1) ... [2025-03-17 00:24:07,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:24:07,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:07,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:24:07,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:24:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:24:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:24:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:24:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:24:07,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:24:07,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:24:07,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:24:07,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:24:08,706 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc property_#t~bitwise80#1;havoc property_#t~ite82#1;havoc property_#t~bitwise81#1;havoc property_#t~short83#1; [2025-03-17 00:24:08,901 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-03-17 00:24:08,901 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:24:08,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:24:08,946 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:24:08,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:08 BoogieIcfgContainer [2025-03-17 00:24:08,946 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:24:08,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:24:08,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:24:08,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:24:08,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:24:06" (1/3) ... [2025-03-17 00:24:08,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba20a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:08, skipping insertion in model container [2025-03-17 00:24:08,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:24:07" (2/3) ... [2025-03-17 00:24:08,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba20a11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:24:08, skipping insertion in model container [2025-03-17 00:24:08,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:24:08" (3/3) ... [2025-03-17 00:24:08,954 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-10.i [2025-03-17 00:24:08,968 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:24:08,971 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-10.i that has 2 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:24:09,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:24:09,047 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;@328de95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:24:09,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:24:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 250 states have (on average 1.604) internal successors, (401), 251 states have internal predecessors, (401), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:24:09,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:09,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:09,090 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:09,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:09,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:09,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1937829476, now seen corresponding path program 1 times [2025-03-17 00:24:09,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:09,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293946716] [2025-03-17 00:24:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:09,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:09,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:09,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:09,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 194 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:24:09,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293946716] [2025-03-17 00:24:09,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293946716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:24:09,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970620629] [2025-03-17 00:24:09,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:09,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:24:09,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:24:09,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:24:09,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:24:09,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:10,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:10,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:10,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:10,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:24:10,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:24:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 18818 trivial. 0 not checked. [2025-03-17 00:24:10,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:24:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970620629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:24:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:24:10,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578611580] [2025-03-17 00:24:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:10,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:24:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:10,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:24:10,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:24:10,212 INFO L87 Difference]: Start difference. First operand has 351 states, 250 states have (on average 1.604) internal successors, (401), 251 states have internal predecessors, (401), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:24:10,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:10,302 INFO L93 Difference]: Finished difference Result 698 states and 1288 transitions. [2025-03-17 00:24:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:24:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) Word has length 642 [2025-03-17 00:24:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:10,319 INFO L225 Difference]: With dead ends: 698 [2025-03-17 00:24:10,320 INFO L226 Difference]: Without dead ends: 348 [2025-03-17 00:24:10,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:24:10,330 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:10,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:10,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-17 00:24:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-03-17 00:24:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 248 states have (on average 1.5806451612903225) internal successors, (392), 248 states have internal predecessors, (392), 98 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 98 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 00:24:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 588 transitions. [2025-03-17 00:24:10,414 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 588 transitions. Word has length 642 [2025-03-17 00:24:10,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:10,417 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 588 transitions. [2025-03-17 00:24:10,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (98), 2 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 2 states have call successors, (98) [2025-03-17 00:24:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 588 transitions. [2025-03-17 00:24:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:10,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:10,433 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:10,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:24:10,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:24:10,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:10,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1994500436, now seen corresponding path program 1 times [2025-03-17 00:24:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3954469] [2025-03-17 00:24:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:10,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:10,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:10,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:11,193 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3954469] [2025-03-17 00:24:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3954469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:11,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:11,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315471347] [2025-03-17 00:24:11,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:11,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:11,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:11,199 INFO L87 Difference]: Start difference. First operand 348 states and 588 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:11,308 INFO L93 Difference]: Finished difference Result 909 states and 1542 transitions. [2025-03-17 00:24:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:11,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-17 00:24:11,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:11,321 INFO L225 Difference]: With dead ends: 909 [2025-03-17 00:24:11,323 INFO L226 Difference]: Without dead ends: 562 [2025-03-17 00:24:11,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:11,325 INFO L435 NwaCegarLoop]: 651 mSDtfsCounter, 333 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:11,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1214 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:11,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2025-03-17 00:24:11,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 559. [2025-03-17 00:24:11,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 428 states have (on average 1.6238317757009346) internal successors, (695), 429 states have internal predecessors, (695), 128 states have call successors, (128), 2 states have call predecessors, (128), 2 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-17 00:24:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 951 transitions. [2025-03-17 00:24:11,392 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 951 transitions. Word has length 642 [2025-03-17 00:24:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:11,393 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 951 transitions. [2025-03-17 00:24:11,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 951 transitions. [2025-03-17 00:24:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:11,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:11,405 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:11,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:24:11,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:11,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1167276267, now seen corresponding path program 1 times [2025-03-17 00:24:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:11,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501396265] [2025-03-17 00:24:11,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:11,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:11,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:11,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:11,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:11,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:11,881 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:11,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:11,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501396265] [2025-03-17 00:24:11,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501396265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:11,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:11,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:11,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208794044] [2025-03-17 00:24:11,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:11,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:11,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:11,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:11,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:11,885 INFO L87 Difference]: Start difference. First operand 559 states and 951 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:12,001 INFO L93 Difference]: Finished difference Result 1463 states and 2464 transitions. [2025-03-17 00:24:12,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:12,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-17 00:24:12,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:12,014 INFO L225 Difference]: With dead ends: 1463 [2025-03-17 00:24:12,016 INFO L226 Difference]: Without dead ends: 905 [2025-03-17 00:24:12,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:12,021 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 349 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:12,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1328 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2025-03-17 00:24:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 902. [2025-03-17 00:24:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 660 states have (on average 1.5606060606060606) internal successors, (1030), 663 states have internal predecessors, (1030), 237 states have call successors, (237), 4 states have call predecessors, (237), 4 states have return successors, (237), 234 states have call predecessors, (237), 237 states have call successors, (237) [2025-03-17 00:24:12,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1504 transitions. [2025-03-17 00:24:12,128 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1504 transitions. Word has length 642 [2025-03-17 00:24:12,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:12,131 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1504 transitions. [2025-03-17 00:24:12,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1504 transitions. [2025-03-17 00:24:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:12,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:12,145 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:12,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:24:12,145 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:12,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash -519438542, now seen corresponding path program 1 times [2025-03-17 00:24:12,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:12,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368848828] [2025-03-17 00:24:12,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:12,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:12,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:12,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:12,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:12,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368848828] [2025-03-17 00:24:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368848828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307973944] [2025-03-17 00:24:12,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:12,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:12,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:12,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:12,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:12,458 INFO L87 Difference]: Start difference. First operand 902 states and 1504 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:12,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:12,583 INFO L93 Difference]: Finished difference Result 2541 states and 4235 transitions. [2025-03-17 00:24:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:12,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-17 00:24:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:12,593 INFO L225 Difference]: With dead ends: 2541 [2025-03-17 00:24:12,593 INFO L226 Difference]: Without dead ends: 1640 [2025-03-17 00:24:12,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:12,596 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 365 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:12,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1133 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-03-17 00:24:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1636. [2025-03-17 00:24:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1214 states have (on average 1.5626029654036244) internal successors, (1897), 1221 states have internal predecessors, (1897), 413 states have call successors, (413), 8 states have call predecessors, (413), 8 states have return successors, (413), 406 states have call predecessors, (413), 413 states have call successors, (413) [2025-03-17 00:24:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2723 transitions. [2025-03-17 00:24:12,743 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2723 transitions. Word has length 642 [2025-03-17 00:24:12,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:12,744 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2723 transitions. [2025-03-17 00:24:12,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2723 transitions. [2025-03-17 00:24:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:12,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:12,754 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:12,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:24:12,754 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:12,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:12,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1206042355, now seen corresponding path program 1 times [2025-03-17 00:24:12,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:12,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710198427] [2025-03-17 00:24:12,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:12,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:12,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:12,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:12,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:12,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:13,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:13,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710198427] [2025-03-17 00:24:13,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710198427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:13,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603727907] [2025-03-17 00:24:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:13,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:13,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:13,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:13,025 INFO L87 Difference]: Start difference. First operand 1636 states and 2723 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:13,246 INFO L93 Difference]: Finished difference Result 4840 states and 8049 transitions. [2025-03-17 00:24:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:13,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-17 00:24:13,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:13,282 INFO L225 Difference]: With dead ends: 4840 [2025-03-17 00:24:13,283 INFO L226 Difference]: Without dead ends: 3205 [2025-03-17 00:24:13,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:13,300 INFO L435 NwaCegarLoop]: 976 mSDtfsCounter, 547 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:13,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1538 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-17 00:24:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3203. [2025-03-17 00:24:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3203 states, 2360 states have (on average 1.5466101694915255) internal successors, (3650), 2374 states have internal predecessors, (3650), 826 states have call successors, (826), 16 states have call predecessors, (826), 16 states have return successors, (826), 812 states have call predecessors, (826), 826 states have call successors, (826) [2025-03-17 00:24:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3203 states to 3203 states and 5302 transitions. [2025-03-17 00:24:13,549 INFO L78 Accepts]: Start accepts. Automaton has 3203 states and 5302 transitions. Word has length 642 [2025-03-17 00:24:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:13,551 INFO L471 AbstractCegarLoop]: Abstraction has 3203 states and 5302 transitions. [2025-03-17 00:24:13,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3203 states and 5302 transitions. [2025-03-17 00:24:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-17 00:24:13,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:13,560 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:13,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:24:13,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:13,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash 90447029, now seen corresponding path program 1 times [2025-03-17 00:24:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668564053] [2025-03-17 00:24:13,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-17 00:24:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-17 00:24:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668564053] [2025-03-17 00:24:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668564053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:14,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:14,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:14,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981983132] [2025-03-17 00:24:14,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:14,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:14,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:14,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:14,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:14,129 INFO L87 Difference]: Start difference. First operand 3203 states and 5302 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:14,362 INFO L93 Difference]: Finished difference Result 6930 states and 11515 transitions. [2025-03-17 00:24:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:14,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 642 [2025-03-17 00:24:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:14,422 INFO L225 Difference]: With dead ends: 6930 [2025-03-17 00:24:14,422 INFO L226 Difference]: Without dead ends: 3728 [2025-03-17 00:24:14,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:14,430 INFO L435 NwaCegarLoop]: 1004 mSDtfsCounter, 572 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:14,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1440 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3728 states. [2025-03-17 00:24:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3728 to 3368. [2025-03-17 00:24:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3368 states, 2425 states have (on average 1.5187628865979381) internal successors, (3683), 2440 states have internal predecessors, (3683), 924 states have call successors, (924), 18 states have call predecessors, (924), 18 states have return successors, (924), 909 states have call predecessors, (924), 924 states have call successors, (924) [2025-03-17 00:24:14,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3368 states to 3368 states and 5531 transitions. [2025-03-17 00:24:14,692 INFO L78 Accepts]: Start accepts. Automaton has 3368 states and 5531 transitions. Word has length 642 [2025-03-17 00:24:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:14,693 INFO L471 AbstractCegarLoop]: Abstraction has 3368 states and 5531 transitions. [2025-03-17 00:24:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3368 states and 5531 transitions. [2025-03-17 00:24:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-17 00:24:14,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:14,699 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:14,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:24:14,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:14,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -521623075, now seen corresponding path program 1 times [2025-03-17 00:24:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651226173] [2025-03-17 00:24:14,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:14,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:14,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-17 00:24:14,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-17 00:24:14,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:14,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651226173] [2025-03-17 00:24:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651226173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:15,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620117873] [2025-03-17 00:24:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:15,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:15,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:15,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:15,162 INFO L87 Difference]: Start difference. First operand 3368 states and 5531 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:15,538 INFO L93 Difference]: Finished difference Result 8771 states and 14491 transitions. [2025-03-17 00:24:15,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:15,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-03-17 00:24:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:15,571 INFO L225 Difference]: With dead ends: 8771 [2025-03-17 00:24:15,572 INFO L226 Difference]: Without dead ends: 5569 [2025-03-17 00:24:15,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:15,586 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 354 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:15,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:24:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5569 states. [2025-03-17 00:24:16,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5569 to 5567. [2025-03-17 00:24:16,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5567 states, 4203 states have (on average 1.555793480847014) internal successors, (6539), 4224 states have internal predecessors, (6539), 1337 states have call successors, (1337), 26 states have call predecessors, (1337), 26 states have return successors, (1337), 1316 states have call predecessors, (1337), 1337 states have call successors, (1337) [2025-03-17 00:24:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5567 states to 5567 states and 9213 transitions. [2025-03-17 00:24:16,155 INFO L78 Accepts]: Start accepts. Automaton has 5567 states and 9213 transitions. Word has length 643 [2025-03-17 00:24:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:16,157 INFO L471 AbstractCegarLoop]: Abstraction has 5567 states and 9213 transitions. [2025-03-17 00:24:16,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 5567 states and 9213 transitions. [2025-03-17 00:24:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-17 00:24:16,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:16,173 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:16,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:24:16,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:16,175 INFO L85 PathProgramCache]: Analyzing trace with hash -732973988, now seen corresponding path program 1 times [2025-03-17 00:24:16,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:16,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147343859] [2025-03-17 00:24:16,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:16,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:16,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-17 00:24:16,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-17 00:24:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:16,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:16,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147343859] [2025-03-17 00:24:16,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147343859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:16,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:16,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:16,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632382808] [2025-03-17 00:24:16,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:16,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:16,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:16,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:16,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:16,897 INFO L87 Difference]: Start difference. First operand 5567 states and 9213 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:17,604 INFO L93 Difference]: Finished difference Result 11978 states and 19760 transitions. [2025-03-17 00:24:17,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:17,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 643 [2025-03-17 00:24:17,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:17,645 INFO L225 Difference]: With dead ends: 11978 [2025-03-17 00:24:17,645 INFO L226 Difference]: Without dead ends: 6905 [2025-03-17 00:24:17,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:17,661 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 596 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:17,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 1691 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6905 states. [2025-03-17 00:24:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6905 to 6391. [2025-03-17 00:24:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6391 states, 5027 states have (on average 1.5790730057688482) internal successors, (7938), 5048 states have internal predecessors, (7938), 1337 states have call successors, (1337), 26 states have call predecessors, (1337), 26 states have return successors, (1337), 1316 states have call predecessors, (1337), 1337 states have call successors, (1337) [2025-03-17 00:24:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6391 states to 6391 states and 10612 transitions. [2025-03-17 00:24:18,197 INFO L78 Accepts]: Start accepts. Automaton has 6391 states and 10612 transitions. Word has length 643 [2025-03-17 00:24:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:18,198 INFO L471 AbstractCegarLoop]: Abstraction has 6391 states and 10612 transitions. [2025-03-17 00:24:18,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6391 states and 10612 transitions. [2025-03-17 00:24:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-17 00:24:18,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:18,209 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:18,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:24:18,210 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash 186548952, now seen corresponding path program 1 times [2025-03-17 00:24:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187513337] [2025-03-17 00:24:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:18,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-17 00:24:18,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-17 00:24:18,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:18,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187513337] [2025-03-17 00:24:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187513337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:19,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:24:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092327197] [2025-03-17 00:24:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:24:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:19,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:24:19,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:24:19,122 INFO L87 Difference]: Start difference. First operand 6391 states and 10612 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:21,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:21,043 INFO L93 Difference]: Finished difference Result 34567 states and 57400 transitions. [2025-03-17 00:24:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:24:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 644 [2025-03-17 00:24:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:21,140 INFO L225 Difference]: With dead ends: 34567 [2025-03-17 00:24:21,140 INFO L226 Difference]: Without dead ends: 28442 [2025-03-17 00:24:21,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:24:21,172 INFO L435 NwaCegarLoop]: 662 mSDtfsCounter, 2389 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:21,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 2598 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:24:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28442 states. [2025-03-17 00:24:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28442 to 23268. [2025-03-17 00:24:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23268 states, 19047 states have (on average 1.6008820286659315) internal successors, (30492), 19140 states have internal predecessors, (30492), 4121 states have call successors, (4121), 99 states have call predecessors, (4121), 99 states have return successors, (4121), 4028 states have call predecessors, (4121), 4121 states have call successors, (4121) [2025-03-17 00:24:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23268 states to 23268 states and 38734 transitions. [2025-03-17 00:24:22,638 INFO L78 Accepts]: Start accepts. Automaton has 23268 states and 38734 transitions. Word has length 644 [2025-03-17 00:24:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:22,639 INFO L471 AbstractCegarLoop]: Abstraction has 23268 states and 38734 transitions. [2025-03-17 00:24:22,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 23268 states and 38734 transitions. [2025-03-17 00:24:22,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-17 00:24:22,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:22,656 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:22,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:24:22,656 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:22,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash -297126375, now seen corresponding path program 1 times [2025-03-17 00:24:22,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:22,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905268045] [2025-03-17 00:24:22,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:22,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:22,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-17 00:24:22,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-17 00:24:22,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:22,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:23,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:23,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905268045] [2025-03-17 00:24:23,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905268045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:23,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:23,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:24:23,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453335000] [2025-03-17 00:24:23,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:23,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:24:23,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:23,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:24:23,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:23,427 INFO L87 Difference]: Start difference. First operand 23268 states and 38734 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:24,936 INFO L93 Difference]: Finished difference Result 69441 states and 115631 transitions. [2025-03-17 00:24:24,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:24:24,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 644 [2025-03-17 00:24:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:25,145 INFO L225 Difference]: With dead ends: 69441 [2025-03-17 00:24:25,145 INFO L226 Difference]: Without dead ends: 46361 [2025-03-17 00:24:25,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:24:25,213 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 394 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:25,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1295 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:24:25,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2025-03-17 00:24:27,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 46353. [2025-03-17 00:24:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46353 states, 38013 states have (on average 1.5953226527766817) internal successors, (60643), 38199 states have internal predecessors, (60643), 8144 states have call successors, (8144), 195 states have call predecessors, (8144), 195 states have return successors, (8144), 7958 states have call predecessors, (8144), 8144 states have call successors, (8144) [2025-03-17 00:24:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46353 states to 46353 states and 76931 transitions. [2025-03-17 00:24:27,410 INFO L78 Accepts]: Start accepts. Automaton has 46353 states and 76931 transitions. Word has length 644 [2025-03-17 00:24:27,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:27,411 INFO L471 AbstractCegarLoop]: Abstraction has 46353 states and 76931 transitions. [2025-03-17 00:24:27,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 46353 states and 76931 transitions. [2025-03-17 00:24:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-17 00:24:27,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:27,442 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:24:27,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:27,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1032268560, now seen corresponding path program 1 times [2025-03-17 00:24:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856418334] [2025-03-17 00:24:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:27,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:27,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-17 00:24:27,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-17 00:24:27,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:27,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:28,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:28,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856418334] [2025-03-17 00:24:28,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856418334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:28,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:28,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:24:28,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471928482] [2025-03-17 00:24:28,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:28,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:24:28,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:28,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:24:28,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:28,187 INFO L87 Difference]: Start difference. First operand 46353 states and 76931 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:30,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:30,590 INFO L93 Difference]: Finished difference Result 91777 states and 152456 transitions. [2025-03-17 00:24:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:24:30,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 645 [2025-03-17 00:24:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:30,866 INFO L225 Difference]: With dead ends: 91777 [2025-03-17 00:24:30,867 INFO L226 Difference]: Without dead ends: 69141 [2025-03-17 00:24:30,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:24:30,921 INFO L435 NwaCegarLoop]: 1102 mSDtfsCounter, 972 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1997 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:30,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1997 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:24:30,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69141 states. [2025-03-17 00:24:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69141 to 46353. [2025-03-17 00:24:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46353 states, 38013 states have (on average 1.5953226527766817) internal successors, (60643), 38199 states have internal predecessors, (60643), 8144 states have call successors, (8144), 195 states have call predecessors, (8144), 195 states have return successors, (8144), 7958 states have call predecessors, (8144), 8144 states have call successors, (8144) [2025-03-17 00:24:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46353 states to 46353 states and 76931 transitions. [2025-03-17 00:24:32,879 INFO L78 Accepts]: Start accepts. Automaton has 46353 states and 76931 transitions. Word has length 645 [2025-03-17 00:24:32,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:32,880 INFO L471 AbstractCegarLoop]: Abstraction has 46353 states and 76931 transitions. [2025-03-17 00:24:32,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 46353 states and 76931 transitions. [2025-03-17 00:24:32,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-17 00:24:32,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:32,904 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:32,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:24:32,905 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash -65579728, now seen corresponding path program 1 times [2025-03-17 00:24:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002461675] [2025-03-17 00:24:32,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:32,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-17 00:24:33,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-17 00:24:33,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:33,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:34,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002461675] [2025-03-17 00:24:34,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002461675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:34,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:34,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:24:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964331364] [2025-03-17 00:24:34,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:34,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:24:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:34,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:24:34,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:24:34,573 INFO L87 Difference]: Start difference. First operand 46353 states and 76931 transitions. Second operand has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:24:39,951 INFO L93 Difference]: Finished difference Result 126661 states and 208618 transitions. [2025-03-17 00:24:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:24:39,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) Word has length 645 [2025-03-17 00:24:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:24:40,323 INFO L225 Difference]: With dead ends: 126661 [2025-03-17 00:24:40,323 INFO L226 Difference]: Without dead ends: 88389 [2025-03-17 00:24:40,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:24:40,482 INFO L435 NwaCegarLoop]: 864 mSDtfsCounter, 2202 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2202 SdHoareTripleChecker+Valid, 3564 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:24:40,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2202 Valid, 3564 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:24:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88389 states. [2025-03-17 00:24:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88389 to 77105. [2025-03-17 00:24:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77105 states, 63493 states have (on average 1.5874190855684878) internal successors, (100790), 63820 states have internal predecessors, (100790), 13175 states have call successors, (13175), 436 states have call predecessors, (13175), 436 states have return successors, (13175), 12848 states have call predecessors, (13175), 13175 states have call successors, (13175) [2025-03-17 00:24:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77105 states to 77105 states and 127140 transitions. [2025-03-17 00:24:43,600 INFO L78 Accepts]: Start accepts. Automaton has 77105 states and 127140 transitions. Word has length 645 [2025-03-17 00:24:43,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:24:43,601 INFO L471 AbstractCegarLoop]: Abstraction has 77105 states and 127140 transitions. [2025-03-17 00:24:43,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.571428571428573) internal successors, (158), 7 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98) [2025-03-17 00:24:43,601 INFO L276 IsEmpty]: Start isEmpty. Operand 77105 states and 127140 transitions. [2025-03-17 00:24:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-17 00:24:43,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:24:43,631 INFO L218 NwaCegarLoop]: trace histogram [98, 98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:24:43,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 00:24:43,631 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:24:43,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:24:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1396000271, now seen corresponding path program 1 times [2025-03-17 00:24:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:24:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588918517] [2025-03-17 00:24:43,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:24:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:24:43,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-17 00:24:43,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-17 00:24:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:24:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:24:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 19012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19012 trivial. 0 not checked. [2025-03-17 00:24:45,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:24:45,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588918517] [2025-03-17 00:24:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588918517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:24:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:24:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:24:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056411499] [2025-03-17 00:24:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:24:45,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:24:45,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:24:45,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:24:45,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:24:45,069 INFO L87 Difference]: Start difference. First operand 77105 states and 127140 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 1 states have call successors, (98), 1 states have call predecessors, (98), 1 states have return successors, (98), 1 states have call predecessors, (98), 1 states have call successors, (98)