./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91568889e64309585cc4780728e0f3ac2bb8be964788cb7e1aee4dd059fc722f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:03,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:03,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:56:03,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:03,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:03,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:03,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:03,634 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:03,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:03,634 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:03,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:03,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:03,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:03,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:03,635 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:03,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:03,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:03,635 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:03,637 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:03,638 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:03,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:03,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:03,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 91568889e64309585cc4780728e0f3ac2bb8be964788cb7e1aee4dd059fc722f [2025-02-05 21:56:03,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:56:03,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:56:03,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:56:03,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:56:03,969 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:56:03,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-02-05 21:56:05,243 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46af47ed/f17d9ab3637e45f5b667c8870977d01b/FLAG86b2e1324 [2025-02-05 21:56:05,565 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:56:05,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-02-05 21:56:05,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46af47ed/f17d9ab3637e45f5b667c8870977d01b/FLAG86b2e1324 [2025-02-05 21:56:05,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46af47ed/f17d9ab3637e45f5b667c8870977d01b [2025-02-05 21:56:05,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:05,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:05,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:05,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:05,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:05,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:05" (1/1) ... [2025-02-05 21:56:05,603 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014fb05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:05, skipping insertion in model container [2025-02-05 21:56:05,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:05" (1/1) ... [2025-02-05 21:56:05,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:05,780 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i[916,929] [2025-02-05 21:56:06,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:06,028 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:06,039 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-24.i[916,929] [2025-02-05 21:56:06,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:06,163 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:06,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06 WrapperNode [2025-02-05 21:56:06,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:06,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:06,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:06,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:06,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,273 INFO L138 Inliner]: procedures = 26, calls = 120, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 906 [2025-02-05 21:56:06,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:06,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:06,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:06,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:06,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,347 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 21:56:06,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,386 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,393 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:06,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:06,426 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:06,427 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:06,428 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (1/1) ... [2025-02-05 21:56:06,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:06,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:06,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 21:56:06,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 21:56:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:06,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:06,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:06,661 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:07,845 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L694: havoc property_#t~ite88#1;havoc property_#t~bitwise87#1;havoc property_#t~short89#1; [2025-02-05 21:56:08,111 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:08,112 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:08,167 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:08,168 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-05 21:56:08,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:08 BoogieIcfgContainer [2025-02-05 21:56:08,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:08,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:08,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:08,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:08,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:05" (1/3) ... [2025-02-05 21:56:08,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf0232b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:08, skipping insertion in model container [2025-02-05 21:56:08,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:06" (2/3) ... [2025-02-05 21:56:08,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf0232b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:08, skipping insertion in model container [2025-02-05 21:56:08,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:08" (3/3) ... [2025-02-05 21:56:08,180 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-24.i [2025-02-05 21:56:08,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:08,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-24.i that has 2 procedures, 375 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:08,278 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:08,291 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;@58ac279a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:08,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 375 states, 265 states have (on average 1.588679245283019) internal successors, (421), 266 states have internal predecessors, (421), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-05 21:56:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-02-05 21:56:08,341 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:08,342 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:08,343 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:08,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1704086706, now seen corresponding path program 1 times [2025-02-05 21:56:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120980940] [2025-02-05 21:56:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:08,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-02-05 21:56:08,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-02-05 21:56:08,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:08,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-02-05 21:56:09,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:09,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120980940] [2025-02-05 21:56:09,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120980940] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:09,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890410392] [2025-02-05 21:56:09,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:09,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:09,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:09,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:56:09,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 21:56:09,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-02-05 21:56:09,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-02-05 21:56:09,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:09,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:09,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 22472 trivial. 0 not checked. [2025-02-05 21:56:09,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890410392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:09,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:09,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684048105] [2025-02-05 21:56:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:09,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:09,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:09,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:09,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:09,756 INFO L87 Difference]: Start difference. First operand has 375 states, 265 states have (on average 1.588679245283019) internal successors, (421), 266 states have internal predecessors, (421), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-02-05 21:56:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:09,865 INFO L93 Difference]: Finished difference Result 744 states and 1372 transitions. [2025-02-05 21:56:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:09,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) Word has length 690 [2025-02-05 21:56:09,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:09,880 INFO L225 Difference]: With dead ends: 744 [2025-02-05 21:56:09,881 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 21:56:09,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 691 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-02-05 21:56:09,893 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:09,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 21:56:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-05 21:56:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 263 states have (on average 1.5779467680608366) internal successors, (415), 263 states have internal predecessors, (415), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-05 21:56:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 629 transitions. [2025-02-05 21:56:10,002 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 629 transitions. Word has length 690 [2025-02-05 21:56:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:10,003 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 629 transitions. [2025-02-05 21:56:10,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (107), 2 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 2 states have call successors, (107) [2025-02-05 21:56:10,004 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 629 transitions. [2025-02-05 21:56:10,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2025-02-05 21:56:10,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:10,026 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:10,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:56:10,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 21:56:10,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:10,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 2046662705, now seen corresponding path program 1 times [2025-02-05 21:56:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535238817] [2025-02-05 21:56:10,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:10,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 690 statements into 1 equivalence classes. [2025-02-05 21:56:10,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 690 of 690 statements. [2025-02-05 21:56:10,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:11,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:11,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535238817] [2025-02-05 21:56:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535238817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:11,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129120075] [2025-02-05 21:56:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:11,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:11,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:11,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:11,200 INFO L87 Difference]: Start difference. First operand 372 states and 629 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:11,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:11,297 INFO L93 Difference]: Finished difference Result 741 states and 1255 transitions. [2025-02-05 21:56:11,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:11,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 690 [2025-02-05 21:56:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:11,306 INFO L225 Difference]: With dead ends: 741 [2025-02-05 21:56:11,306 INFO L226 Difference]: Without dead ends: 372 [2025-02-05 21:56:11,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:11,310 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 0 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:11,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1204 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-05 21:56:11,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-02-05 21:56:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 263 states have (on average 1.5741444866920151) internal successors, (414), 263 states have internal predecessors, (414), 107 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-02-05 21:56:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 628 transitions. [2025-02-05 21:56:11,357 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 628 transitions. Word has length 690 [2025-02-05 21:56:11,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:11,359 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 628 transitions. [2025-02-05 21:56:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 628 transitions. [2025-02-05 21:56:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:56:11,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:11,373 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:11,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:11,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1546353457, now seen corresponding path program 1 times [2025-02-05 21:56:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054458376] [2025-02-05 21:56:11,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:11,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:56:11,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:56:11,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:11,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:11,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:11,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054458376] [2025-02-05 21:56:11,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054458376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:11,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:11,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005896308] [2025-02-05 21:56:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:11,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:11,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:11,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:11,760 INFO L87 Difference]: Start difference. First operand 372 states and 628 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:11,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:11,922 INFO L93 Difference]: Finished difference Result 973 states and 1652 transitions. [2025-02-05 21:56:11,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:11,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-02-05 21:56:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:11,934 INFO L225 Difference]: With dead ends: 973 [2025-02-05 21:56:11,935 INFO L226 Difference]: Without dead ends: 604 [2025-02-05 21:56:11,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:11,937 INFO L435 NwaCegarLoop]: 783 mSDtfsCounter, 390 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:11,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 1362 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-02-05 21:56:12,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2025-02-05 21:56:12,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 463 states have (on average 1.6220302375809936) internal successors, (751), 464 states have internal predecessors, (751), 135 states have call successors, (135), 2 states have call predecessors, (135), 2 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2025-02-05 21:56:12,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1021 transitions. [2025-02-05 21:56:12,012 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1021 transitions. Word has length 692 [2025-02-05 21:56:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:12,013 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 1021 transitions. [2025-02-05 21:56:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1021 transitions. [2025-02-05 21:56:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:56:12,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:12,020 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:12,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:12,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash -378157202, now seen corresponding path program 1 times [2025-02-05 21:56:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929980703] [2025-02-05 21:56:12,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:12,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:12,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:56:12,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:56:12,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:12,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:12,347 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:12,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:12,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929980703] [2025-02-05 21:56:12,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929980703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:12,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:12,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:12,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455938628] [2025-02-05 21:56:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:12,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:12,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:12,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:12,352 INFO L87 Difference]: Start difference. First operand 601 states and 1021 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:12,532 INFO L93 Difference]: Finished difference Result 1628 states and 2773 transitions. [2025-02-05 21:56:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-02-05 21:56:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:12,546 INFO L225 Difference]: With dead ends: 1628 [2025-02-05 21:56:12,547 INFO L226 Difference]: Without dead ends: 1030 [2025-02-05 21:56:12,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:12,552 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 359 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:12,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1427 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:12,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-05 21:56:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1026. [2025-02-05 21:56:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 838 states have (on average 1.6312649164677804) internal successors, (1367), 841 states have internal predecessors, (1367), 183 states have call successors, (183), 4 states have call predecessors, (183), 4 states have return successors, (183), 180 states have call predecessors, (183), 183 states have call successors, (183) [2025-02-05 21:56:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1733 transitions. [2025-02-05 21:56:12,641 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1733 transitions. Word has length 692 [2025-02-05 21:56:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:12,644 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1733 transitions. [2025-02-05 21:56:12,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1733 transitions. [2025-02-05 21:56:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2025-02-05 21:56:12,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:12,654 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:12,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:12,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:12,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:12,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1248443570, now seen corresponding path program 1 times [2025-02-05 21:56:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:12,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822727500] [2025-02-05 21:56:12,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:12,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 692 statements into 1 equivalence classes. [2025-02-05 21:56:12,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 692 of 692 statements. [2025-02-05 21:56:12,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:12,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822727500] [2025-02-05 21:56:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822727500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355568335] [2025-02-05 21:56:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:12,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:12,995 INFO L87 Difference]: Start difference. First operand 1026 states and 1733 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:13,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:13,154 INFO L93 Difference]: Finished difference Result 2835 states and 4788 transitions. [2025-02-05 21:56:13,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:13,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 692 [2025-02-05 21:56:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:13,167 INFO L225 Difference]: With dead ends: 2835 [2025-02-05 21:56:13,167 INFO L226 Difference]: Without dead ends: 1812 [2025-02-05 21:56:13,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:13,172 INFO L435 NwaCegarLoop]: 671 mSDtfsCounter, 318 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:13,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1252 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2025-02-05 21:56:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1808. [2025-02-05 21:56:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1516 states have (on average 1.628627968337731) internal successors, (2469), 1523 states have internal predecessors, (2469), 283 states have call successors, (283), 8 states have call predecessors, (283), 8 states have return successors, (283), 276 states have call predecessors, (283), 283 states have call successors, (283) [2025-02-05 21:56:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 3035 transitions. [2025-02-05 21:56:13,282 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 3035 transitions. Word has length 692 [2025-02-05 21:56:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 3035 transitions. [2025-02-05 21:56:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 3035 transitions. [2025-02-05 21:56:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:56:13,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:13,294 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:13,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:13,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:13,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 769302339, now seen corresponding path program 1 times [2025-02-05 21:56:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:13,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289057557] [2025-02-05 21:56:13,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:13,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:56:13,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:56:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:13,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289057557] [2025-02-05 21:56:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289057557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:13,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71055708] [2025-02-05 21:56:13,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:13,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:13,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:13,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:13,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:13,663 INFO L87 Difference]: Start difference. First operand 1808 states and 3035 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:13,849 INFO L93 Difference]: Finished difference Result 3620 states and 6072 transitions. [2025-02-05 21:56:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:13,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-02-05 21:56:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:13,864 INFO L225 Difference]: With dead ends: 3620 [2025-02-05 21:56:13,864 INFO L226 Difference]: Without dead ends: 1815 [2025-02-05 21:56:13,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:13,871 INFO L435 NwaCegarLoop]: 718 mSDtfsCounter, 330 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:13,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1307 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2025-02-05 21:56:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1451. [2025-02-05 21:56:13,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1264 states have (on average 1.6447784810126582) internal successors, (2079), 1267 states have internal predecessors, (2079), 181 states have call successors, (181), 5 states have call predecessors, (181), 5 states have return successors, (181), 178 states have call predecessors, (181), 181 states have call successors, (181) [2025-02-05 21:56:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 2441 transitions. [2025-02-05 21:56:13,948 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 2441 transitions. Word has length 693 [2025-02-05 21:56:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:13,950 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 2441 transitions. [2025-02-05 21:56:13,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 2441 transitions. [2025-02-05 21:56:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:56:13,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:13,957 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:13,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:13,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:13,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2014066820, now seen corresponding path program 1 times [2025-02-05 21:56:13,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735255268] [2025-02-05 21:56:13,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:14,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:56:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:56:14,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:14,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:14,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:14,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735255268] [2025-02-05 21:56:14,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735255268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:14,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:14,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607529494] [2025-02-05 21:56:14,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:14,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:14,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:14,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:14,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:14,268 INFO L87 Difference]: Start difference. First operand 1451 states and 2441 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:14,413 INFO L93 Difference]: Finished difference Result 3008 states and 5064 transitions. [2025-02-05 21:56:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:14,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-02-05 21:56:14,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:14,425 INFO L225 Difference]: With dead ends: 3008 [2025-02-05 21:56:14,425 INFO L226 Difference]: Without dead ends: 1560 [2025-02-05 21:56:14,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:14,430 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 322 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:14,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1235 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:14,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-02-05 21:56:14,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1392. [2025-02-05 21:56:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1253 states have (on average 1.6464485235434956) internal successors, (2063), 1254 states have internal predecessors, (2063), 133 states have call successors, (133), 5 states have call predecessors, (133), 5 states have return successors, (133), 132 states have call predecessors, (133), 133 states have call successors, (133) [2025-02-05 21:56:14,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 2329 transitions. [2025-02-05 21:56:14,496 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 2329 transitions. Word has length 693 [2025-02-05 21:56:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:14,497 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 2329 transitions. [2025-02-05 21:56:14,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 2329 transitions. [2025-02-05 21:56:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-02-05 21:56:14,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:14,505 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:14,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:14,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:14,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:14,507 INFO L85 PathProgramCache]: Analyzing trace with hash 920496003, now seen corresponding path program 1 times [2025-02-05 21:56:14,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:14,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192366723] [2025-02-05 21:56:14,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:14,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:14,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-02-05 21:56:14,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-02-05 21:56:14,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:14,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:15,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:15,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192366723] [2025-02-05 21:56:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192366723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:15,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108116984] [2025-02-05 21:56:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:15,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:15,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:15,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:15,276 INFO L87 Difference]: Start difference. First operand 1392 states and 2329 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:15,915 INFO L93 Difference]: Finished difference Result 4228 states and 7072 transitions. [2025-02-05 21:56:15,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:15,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 693 [2025-02-05 21:56:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:15,934 INFO L225 Difference]: With dead ends: 4228 [2025-02-05 21:56:15,934 INFO L226 Difference]: Without dead ends: 2839 [2025-02-05 21:56:15,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:15,940 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 678 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:15,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 1818 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2025-02-05 21:56:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2779. [2025-02-05 21:56:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2779 states, 2502 states have (on average 1.6466826538768984) internal successors, (4120), 2504 states have internal predecessors, (4120), 266 states have call successors, (266), 10 states have call predecessors, (266), 10 states have return successors, (266), 264 states have call predecessors, (266), 266 states have call successors, (266) [2025-02-05 21:56:16,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2779 states to 2779 states and 4652 transitions. [2025-02-05 21:56:16,093 INFO L78 Accepts]: Start accepts. Automaton has 2779 states and 4652 transitions. Word has length 693 [2025-02-05 21:56:16,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:16,094 INFO L471 AbstractCegarLoop]: Abstraction has 2779 states and 4652 transitions. [2025-02-05 21:56:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2779 states and 4652 transitions. [2025-02-05 21:56:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:56:16,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:16,101 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:16,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:16,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:16,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:16,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2070668024, now seen corresponding path program 1 times [2025-02-05 21:56:16,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:16,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946754691] [2025-02-05 21:56:16,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:16,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:16,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:56:16,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:56:16,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:16,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:16,848 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:16,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:16,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946754691] [2025-02-05 21:56:16,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946754691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:16,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:16,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:16,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457364891] [2025-02-05 21:56:16,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:16,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:16,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:16,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:16,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:16,850 INFO L87 Difference]: Start difference. First operand 2779 states and 4652 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:17,101 INFO L93 Difference]: Finished difference Result 8331 states and 13950 transitions. [2025-02-05 21:56:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:17,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-02-05 21:56:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:17,137 INFO L225 Difference]: With dead ends: 8331 [2025-02-05 21:56:17,137 INFO L226 Difference]: Without dead ends: 5555 [2025-02-05 21:56:17,147 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-02-05 21:56:17,150 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 398 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:17,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1202 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:17,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2025-02-05 21:56:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5545. [2025-02-05 21:56:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5545 states, 4992 states have (on average 1.6434294871794872) internal successors, (8204), 4996 states have internal predecessors, (8204), 532 states have call successors, (532), 20 states have call predecessors, (532), 20 states have return successors, (532), 528 states have call predecessors, (532), 532 states have call successors, (532) [2025-02-05 21:56:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 9268 transitions. [2025-02-05 21:56:17,437 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 9268 transitions. Word has length 694 [2025-02-05 21:56:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:17,439 INFO L471 AbstractCegarLoop]: Abstraction has 5545 states and 9268 transitions. [2025-02-05 21:56:17,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 9268 transitions. [2025-02-05 21:56:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:56:17,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:17,455 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:17,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:17,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:17,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 303512570, now seen corresponding path program 1 times [2025-02-05 21:56:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219408003] [2025-02-05 21:56:17,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:17,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:56:17,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:56:17,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:17,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:19,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:19,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219408003] [2025-02-05 21:56:19,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219408003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:19,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:19,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:19,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002463102] [2025-02-05 21:56:19,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:19,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:19,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:19,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:19,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:19,433 INFO L87 Difference]: Start difference. First operand 5545 states and 9268 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:23,527 INFO L93 Difference]: Finished difference Result 28363 states and 47213 transitions. [2025-02-05 21:56:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:56:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-02-05 21:56:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:23,644 INFO L225 Difference]: With dead ends: 28363 [2025-02-05 21:56:23,644 INFO L226 Difference]: Without dead ends: 22821 [2025-02-05 21:56:23,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:56:23,667 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 1755 mSDsluCounter, 2826 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:23,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 3514 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 21:56:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22821 states. [2025-02-05 21:56:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22821 to 12065. [2025-02-05 21:56:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12065 states, 11196 states have (on average 1.6516613076098607) internal successors, (18492), 11208 states have internal predecessors, (18492), 828 states have call successors, (828), 40 states have call predecessors, (828), 40 states have return successors, (828), 816 states have call predecessors, (828), 828 states have call successors, (828) [2025-02-05 21:56:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12065 states to 12065 states and 20148 transitions. [2025-02-05 21:56:24,438 INFO L78 Accepts]: Start accepts. Automaton has 12065 states and 20148 transitions. Word has length 694 [2025-02-05 21:56:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 12065 states and 20148 transitions. [2025-02-05 21:56:24,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:24,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12065 states and 20148 transitions. [2025-02-05 21:56:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:56:24,452 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:24,453 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:24,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:56:24,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:24,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:24,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1680644453, now seen corresponding path program 1 times [2025-02-05 21:56:24,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:24,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756554873] [2025-02-05 21:56:24,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:24,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:24,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:56:24,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:56:24,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:24,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:26,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756554873] [2025-02-05 21:56:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756554873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:26,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:26,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186203713] [2025-02-05 21:56:26,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:26,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:26,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:26,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:26,819 INFO L87 Difference]: Start difference. First operand 12065 states and 20148 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:33,161 INFO L93 Difference]: Finished difference Result 38181 states and 63526 transitions. [2025-02-05 21:56:33,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:56:33,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-02-05 21:56:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:33,249 INFO L225 Difference]: With dead ends: 38181 [2025-02-05 21:56:33,250 INFO L226 Difference]: Without dead ends: 26119 [2025-02-05 21:56:33,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:56:33,287 INFO L435 NwaCegarLoop]: 972 mSDtfsCounter, 1996 mSDsluCounter, 3495 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1996 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 1878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:33,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1996 Valid, 4467 Invalid, 1878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 21:56:33,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26119 states. [2025-02-05 21:56:34,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26119 to 12161. [2025-02-05 21:56:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12161 states, 11292 states have (on average 1.6517888770811193) internal successors, (18652), 11304 states have internal predecessors, (18652), 828 states have call successors, (828), 40 states have call predecessors, (828), 40 states have return successors, (828), 816 states have call predecessors, (828), 828 states have call successors, (828) [2025-02-05 21:56:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12161 states to 12161 states and 20308 transitions. [2025-02-05 21:56:34,179 INFO L78 Accepts]: Start accepts. Automaton has 12161 states and 20308 transitions. Word has length 694 [2025-02-05 21:56:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 12161 states and 20308 transitions. [2025-02-05 21:56:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:34,182 INFO L276 IsEmpty]: Start isEmpty. Operand 12161 states and 20308 transitions. [2025-02-05 21:56:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-02-05 21:56:34,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:34,193 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:34,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:56:34,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:34,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash -652008709, now seen corresponding path program 1 times [2025-02-05 21:56:34,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:34,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492660760] [2025-02-05 21:56:34,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:34,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-02-05 21:56:34,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-02-05 21:56:34,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:34,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492660760] [2025-02-05 21:56:34,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492660760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:34,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:34,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074127415] [2025-02-05 21:56:34,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:34,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:34,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:34,914 INFO L87 Difference]: Start difference. First operand 12161 states and 20308 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:36,364 INFO L93 Difference]: Finished difference Result 47755 states and 79851 transitions. [2025-02-05 21:56:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 694 [2025-02-05 21:56:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:36,487 INFO L225 Difference]: With dead ends: 47755 [2025-02-05 21:56:36,487 INFO L226 Difference]: Without dead ends: 35597 [2025-02-05 21:56:36,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:36,527 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 828 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:36,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 2110 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:56:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35597 states. [2025-02-05 21:56:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35597 to 35577. [2025-02-05 21:56:38,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35577 states, 33504 states have (on average 1.6544890162368673) internal successors, (55432), 33544 states have internal predecessors, (55432), 1976 states have call successors, (1976), 96 states have call predecessors, (1976), 96 states have return successors, (1976), 1936 states have call predecessors, (1976), 1976 states have call successors, (1976) [2025-02-05 21:56:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35577 states to 35577 states and 59384 transitions. [2025-02-05 21:56:38,276 INFO L78 Accepts]: Start accepts. Automaton has 35577 states and 59384 transitions. Word has length 694 [2025-02-05 21:56:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:38,277 INFO L471 AbstractCegarLoop]: Abstraction has 35577 states and 59384 transitions. [2025-02-05 21:56:38,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand 35577 states and 59384 transitions. [2025-02-05 21:56:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-02-05 21:56:38,304 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:38,304 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:38,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:56:38,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1006700252, now seen corresponding path program 1 times [2025-02-05 21:56:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135078295] [2025-02-05 21:56:38,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:38,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-02-05 21:56:38,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-02-05 21:56:38,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:38,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:39,479 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:39,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135078295] [2025-02-05 21:56:39,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135078295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:39,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:39,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:56:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457763483] [2025-02-05 21:56:39,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:56:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:39,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:56:39,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:39,486 INFO L87 Difference]: Start difference. First operand 35577 states and 59384 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:43,091 INFO L93 Difference]: Finished difference Result 118861 states and 198321 transitions. [2025-02-05 21:56:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:56:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 695 [2025-02-05 21:56:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:43,329 INFO L225 Difference]: With dead ends: 118861 [2025-02-05 21:56:43,329 INFO L226 Difference]: Without dead ends: 83287 [2025-02-05 21:56:43,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:56:43,412 INFO L435 NwaCegarLoop]: 678 mSDtfsCounter, 979 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 2081 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:43,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 2081 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:56:43,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83287 states. [2025-02-05 21:56:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83287 to 72527. [2025-02-05 21:56:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72527 states, 69418 states have (on average 1.6629404477224927) internal successors, (115438), 69478 states have internal predecessors, (115438), 2964 states have call successors, (2964), 144 states have call predecessors, (2964), 144 states have return successors, (2964), 2904 states have call predecessors, (2964), 2964 states have call successors, (2964) [2025-02-05 21:56:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72527 states to 72527 states and 121366 transitions. [2025-02-05 21:56:46,155 INFO L78 Accepts]: Start accepts. Automaton has 72527 states and 121366 transitions. Word has length 695 [2025-02-05 21:56:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:46,159 INFO L471 AbstractCegarLoop]: Abstraction has 72527 states and 121366 transitions. [2025-02-05 21:56:46,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 72527 states and 121366 transitions. [2025-02-05 21:56:46,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-02-05 21:56:46,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:46,195 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:46,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:56:46,196 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:46,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:46,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1537539377, now seen corresponding path program 1 times [2025-02-05 21:56:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099842407] [2025-02-05 21:56:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:46,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-02-05 21:56:46,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-02-05 21:56:46,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:46,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:47,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099842407] [2025-02-05 21:56:47,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099842407] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:47,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:47,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112884725] [2025-02-05 21:56:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:47,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:47,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:47,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:47,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:47,210 INFO L87 Difference]: Start difference. First operand 72527 states and 121366 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:51,649 INFO L93 Difference]: Finished difference Result 252809 states and 422845 transitions. [2025-02-05 21:56:51,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 696 [2025-02-05 21:56:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:52,300 INFO L225 Difference]: With dead ends: 252809 [2025-02-05 21:56:52,301 INFO L226 Difference]: Without dead ends: 180285 [2025-02-05 21:56:52,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:52,382 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 1068 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:52,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 1403 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:56:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180285 states. [2025-02-05 21:56:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180285 to 163673. [2025-02-05 21:56:57,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163673 states, 158956 states have (on average 1.6644102770578022) internal successors, (264568), 159088 states have internal predecessors, (264568), 4500 states have call successors, (4500), 216 states have call predecessors, (4500), 216 states have return successors, (4500), 4368 states have call predecessors, (4500), 4500 states have call successors, (4500) [2025-02-05 21:56:58,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163673 states to 163673 states and 273568 transitions. [2025-02-05 21:56:58,150 INFO L78 Accepts]: Start accepts. Automaton has 163673 states and 273568 transitions. Word has length 696 [2025-02-05 21:56:58,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:58,151 INFO L471 AbstractCegarLoop]: Abstraction has 163673 states and 273568 transitions. [2025-02-05 21:56:58,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:56:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 163673 states and 273568 transitions. [2025-02-05 21:56:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 697 [2025-02-05 21:56:58,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:58,212 INFO L218 NwaCegarLoop]: trace histogram [107, 107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:56:58,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:56:58,213 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1320515597, now seen corresponding path program 1 times [2025-02-05 21:56:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:58,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491553276] [2025-02-05 21:56:58,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:58,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:58,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 696 statements into 1 equivalence classes. [2025-02-05 21:56:58,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 696 of 696 statements. [2025-02-05 21:56:58,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:58,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 22684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22684 trivial. 0 not checked. [2025-02-05 21:56:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491553276] [2025-02-05 21:56:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491553276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372980972] [2025-02-05 21:56:58,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:58,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:58,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:58,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:58,849 INFO L87 Difference]: Start difference. First operand 163673 states and 273568 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) [2025-02-05 21:57:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:04,630 INFO L93 Difference]: Finished difference Result 491013 states and 820698 transitions. [2025-02-05 21:57:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:57:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (107), 1 states have call predecessors, (107), 1 states have return successors, (107), 1 states have call predecessors, (107), 1 states have call successors, (107) Word has length 696 [2025-02-05 21:57:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:05,925 INFO L225 Difference]: With dead ends: 491013 [2025-02-05 21:57:05,926 INFO L226 Difference]: Without dead ends: 327343 [2025-02-05 21:57:06,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:57:06,047 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 427 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:06,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 1195 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327343 states.