./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-3.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-3.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 39f35a37b269351a16278221a7bbfcc0d2e5f28c28376776cbcd4a03ccd8aa74 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:56:40,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:56:40,940 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:40,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:56:40,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:56:40,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:56:40,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:56:40,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:56:40,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:56:40,964 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:56:40,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:56:40,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:56:40,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:56:40,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:56:40,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:40,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:56:40,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:56:40,966 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 -> 39f35a37b269351a16278221a7bbfcc0d2e5f28c28376776cbcd4a03ccd8aa74 [2025-02-05 21:56:41,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:56:41,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:56:41,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:56:41,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:56:41,199 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:56:41,202 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-3.i [2025-02-05 21:56:42,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f90e38d/39e65eb69fed4d5b890f65f0fe11bcaa/FLAGd94fe8a80 [2025-02-05 21:56:42,672 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:56:42,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-3.i [2025-02-05 21:56:42,685 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f90e38d/39e65eb69fed4d5b890f65f0fe11bcaa/FLAGd94fe8a80 [2025-02-05 21:56:42,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/98f90e38d/39e65eb69fed4d5b890f65f0fe11bcaa [2025-02-05 21:56:42,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:56:42,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:56:42,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:42,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:56:42,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:56:42,950 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:42" (1/1) ... [2025-02-05 21:56:42,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa26339 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:42, skipping insertion in model container [2025-02-05 21:56:42,951 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:56:42" (1/1) ... [2025-02-05 21:56:42,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:56:43,096 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-3.i[915,928] [2025-02-05 21:56:43,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:43,263 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:56:43,271 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-3.i[915,928] [2025-02-05 21:56:43,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:56:43,362 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:56:43,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43 WrapperNode [2025-02-05 21:56:43,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:56:43,363 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:43,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:56:43,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:56:43,368 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:43" (1/1) ... [2025-02-05 21:56:43,380 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:43" (1/1) ... [2025-02-05 21:56:43,435 INFO L138 Inliner]: procedures = 26, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 856 [2025-02-05 21:56:43,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:56:43,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:56:43,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:56:43,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:56:43,443 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:43" (1/1) ... [2025-02-05 21:56:43,443 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:43" (1/1) ... [2025-02-05 21:56:43,450 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:43" (1/1) ... [2025-02-05 21:56:43,483 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:43,483 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:43" (1/1) ... [2025-02-05 21:56:43,483 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:43" (1/1) ... [2025-02-05 21:56:43,509 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:43" (1/1) ... [2025-02-05 21:56:43,520 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:43" (1/1) ... [2025-02-05 21:56:43,528 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:43" (1/1) ... [2025-02-05 21:56:43,532 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:43" (1/1) ... [2025-02-05 21:56:43,543 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:56:43,544 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:56:43,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:56:43,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:56:43,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (1/1) ... [2025-02-05 21:56:43,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:56:43,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:43,592 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:43,604 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:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:56:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:56:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:56:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:56:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:56:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:56:43,730 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:56:43,732 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:56:44,495 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc property_#t~bitwise82#1;havoc property_#t~short83#1; [2025-02-05 21:56:44,690 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:56:44,691 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:56:44,724 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:56:44,727 INFO L337 CfgBuilder]: Removed 3 assume(true) statements. [2025-02-05 21:56:44,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:44 BoogieIcfgContainer [2025-02-05 21:56:44,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:56:44,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:56:44,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:56:44,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:56:44,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:56:42" (1/3) ... [2025-02-05 21:56:44,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3063ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:44, skipping insertion in model container [2025-02-05 21:56:44,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:56:43" (2/3) ... [2025-02-05 21:56:44,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3063ab50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:56:44, skipping insertion in model container [2025-02-05 21:56:44,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:56:44" (3/3) ... [2025-02-05 21:56:44,737 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-3.i [2025-02-05 21:56:44,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:56:44,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-3.i that has 2 procedures, 364 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:56:44,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:56:44,821 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;@5e33e901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:56:44,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:56:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 247 states have (on average 1.5789473684210527) internal successors, (390), 248 states have internal predecessors, (390), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 21:56:44,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-02-05 21:56:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:44,871 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,872 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:44,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:44,881 INFO L85 PathProgramCache]: Analyzing trace with hash 343934941, now seen corresponding path program 1 times [2025-02-05 21:56:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695055554] [2025-02-05 21:56:44,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:44,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:45,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-02-05 21:56:45,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-02-05 21:56:45,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:45,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-02-05 21:56:45,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695055554] [2025-02-05 21:56:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695055554] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:56:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451262400] [2025-02-05 21:56:45,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:45,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:56:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:56:45,460 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:45,462 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:45,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-02-05 21:56:45,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-02-05 21:56:45,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:45,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:45,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:56:45,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:56:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 25538 trivial. 0 not checked. [2025-02-05 21:56:45,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:56:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451262400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:56:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:56:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081352634] [2025-02-05 21:56:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:56:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:45,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:56:45,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:56:45,969 INFO L87 Difference]: Start difference. First operand has 364 states, 247 states have (on average 1.5789473684210527) internal successors, (390), 248 states have internal predecessors, (390), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 21:56:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:46,086 INFO L93 Difference]: Finished difference Result 722 states and 1345 transitions. [2025-02-05 21:56:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:56:46,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) Word has length 730 [2025-02-05 21:56:46,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:46,104 INFO L225 Difference]: With dead ends: 722 [2025-02-05 21:56:46,104 INFO L226 Difference]: Without dead ends: 361 [2025-02-05 21:56:46,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 731 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:46,114 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:46,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-02-05 21:56:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-02-05 21:56:46,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 245 states have (on average 1.563265306122449) internal successors, (383), 245 states have internal predecessors, (383), 114 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-05 21:56:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 611 transitions. [2025-02-05 21:56:46,204 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 611 transitions. Word has length 730 [2025-02-05 21:56:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:46,205 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 611 transitions. [2025-02-05 21:56:46,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 2 states have call successors, (114), 2 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 21:56:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 611 transitions. [2025-02-05 21:56:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-02-05 21:56:46,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:46,223 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,233 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:46,427 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:46,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1261393115, now seen corresponding path program 1 times [2025-02-05 21:56:46,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:46,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739119551] [2025-02-05 21:56:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-02-05 21:56:46,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-02-05 21:56:46,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:46,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:47,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:47,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739119551] [2025-02-05 21:56:47,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739119551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:47,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:47,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:47,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916672154] [2025-02-05 21:56:47,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:47,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:47,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:47,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:47,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:47,238 INFO L87 Difference]: Start difference. First operand 361 states and 611 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:47,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:47,369 INFO L93 Difference]: Finished difference Result 967 states and 1639 transitions. [2025-02-05 21:56:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:47,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 730 [2025-02-05 21:56:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:47,379 INFO L225 Difference]: With dead ends: 967 [2025-02-05 21:56:47,379 INFO L226 Difference]: Without dead ends: 609 [2025-02-05 21:56:47,380 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:47,384 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 409 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:47,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1443 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:47,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2025-02-05 21:56:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 606. [2025-02-05 21:56:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 416 states have (on average 1.5673076923076923) internal successors, (652), 417 states have internal predecessors, (652), 187 states have call successors, (187), 2 states have call predecessors, (187), 2 states have return successors, (187), 186 states have call predecessors, (187), 187 states have call successors, (187) [2025-02-05 21:56:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 1026 transitions. [2025-02-05 21:56:47,481 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 1026 transitions. Word has length 730 [2025-02-05 21:56:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:47,482 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 1026 transitions. [2025-02-05 21:56:47,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 1026 transitions. [2025-02-05 21:56:47,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-02-05 21:56:47,494 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:47,495 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:56:47,495 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1169334356, now seen corresponding path program 1 times [2025-02-05 21:56:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127505544] [2025-02-05 21:56:47,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:47,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-02-05 21:56:47,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-02-05 21:56:47,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:47,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:47,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127505544] [2025-02-05 21:56:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127505544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:47,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:47,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:47,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716031435] [2025-02-05 21:56:47,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:47,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:47,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:47,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:47,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:47,924 INFO L87 Difference]: Start difference. First operand 606 states and 1026 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:48,019 INFO L93 Difference]: Finished difference Result 1595 states and 2709 transitions. [2025-02-05 21:56:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:48,020 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 731 [2025-02-05 21:56:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:48,028 INFO L225 Difference]: With dead ends: 1595 [2025-02-05 21:56:48,028 INFO L226 Difference]: Without dead ends: 992 [2025-02-05 21:56:48,029 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:48,030 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 323 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:48,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1158 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:48,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2025-02-05 21:56:48,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 988. [2025-02-05 21:56:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 728 states have (on average 1.6057692307692308) internal successors, (1169), 731 states have internal predecessors, (1169), 255 states have call successors, (255), 4 states have call predecessors, (255), 4 states have return successors, (255), 252 states have call predecessors, (255), 255 states have call successors, (255) [2025-02-05 21:56:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1679 transitions. [2025-02-05 21:56:48,100 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1679 transitions. Word has length 731 [2025-02-05 21:56:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:48,102 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1679 transitions. [2025-02-05 21:56:48,103 INFO L472 AbstractCegarLoop]: INTERPOLANT 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, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1679 transitions. [2025-02-05 21:56:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:56:48,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:48,108 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:56:48,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:48,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:48,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1540100281, now seen corresponding path program 1 times [2025-02-05 21:56:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:48,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624681959] [2025-02-05 21:56:48,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:48,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:48,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:56:48,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:56:48,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:48,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:48,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624681959] [2025-02-05 21:56:48,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624681959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:48,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:48,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:48,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262261339] [2025-02-05 21:56:48,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:48,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:48,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:48,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:48,368 INFO L87 Difference]: Start difference. First operand 988 states and 1679 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:48,479 INFO L93 Difference]: Finished difference Result 2958 states and 5031 transitions. [2025-02-05 21:56:48,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:48,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-02-05 21:56:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:48,493 INFO L225 Difference]: With dead ends: 2958 [2025-02-05 21:56:48,494 INFO L226 Difference]: Without dead ends: 1973 [2025-02-05 21:56:48,497 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:48,499 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 597 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:48,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1195 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2025-02-05 21:56:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1971. [2025-02-05 21:56:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1971 states, 1452 states have (on average 1.5991735537190082) internal successors, (2322), 1458 states have internal predecessors, (2322), 510 states have call successors, (510), 8 states have call predecessors, (510), 8 states have return successors, (510), 504 states have call predecessors, (510), 510 states have call successors, (510) [2025-02-05 21:56:48,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 3342 transitions. [2025-02-05 21:56:48,645 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 3342 transitions. Word has length 732 [2025-02-05 21:56:48,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:48,646 INFO L471 AbstractCegarLoop]: Abstraction has 1971 states and 3342 transitions. [2025-02-05 21:56:48,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:48,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 3342 transitions. [2025-02-05 21:56:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:56:48,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:48,654 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:56:48,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:48,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:48,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1561802983, now seen corresponding path program 1 times [2025-02-05 21:56:48,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:48,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304071849] [2025-02-05 21:56:48,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:48,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:48,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:56:48,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:56:48,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:48,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:48,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:48,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304071849] [2025-02-05 21:56:48,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304071849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:48,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:48,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420571344] [2025-02-05 21:56:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:48,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:48,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:48,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:48,918 INFO L87 Difference]: Start difference. First operand 1971 states and 3342 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:49,060 INFO L93 Difference]: Finished difference Result 3951 states and 6690 transitions. [2025-02-05 21:56:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-02-05 21:56:49,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:49,074 INFO L225 Difference]: With dead ends: 3951 [2025-02-05 21:56:49,074 INFO L226 Difference]: Without dead ends: 1983 [2025-02-05 21:56:49,078 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:49,079 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 384 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:49,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1199 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states. [2025-02-05 21:56:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1487. [2025-02-05 21:56:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1487 states, 1184 states have (on average 1.6435810810810811) internal successors, (1946), 1186 states have internal predecessors, (1946), 296 states have call successors, (296), 6 states have call predecessors, (296), 6 states have return successors, (296), 294 states have call predecessors, (296), 296 states have call successors, (296) [2025-02-05 21:56:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2538 transitions. [2025-02-05 21:56:49,173 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2538 transitions. Word has length 732 [2025-02-05 21:56:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:49,200 INFO L471 AbstractCegarLoop]: Abstraction has 1487 states and 2538 transitions. [2025-02-05 21:56:49,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2538 transitions. [2025-02-05 21:56:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:56:49,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:49,207 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:56:49,208 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:49,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:49,211 INFO L85 PathProgramCache]: Analyzing trace with hash 140663161, now seen corresponding path program 1 times [2025-02-05 21:56:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781756033] [2025-02-05 21:56:49,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:49,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:49,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:56:49,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:56:49,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:49,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781756033] [2025-02-05 21:56:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781756033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:49,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:49,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:49,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643183939] [2025-02-05 21:56:49,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:49,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:49,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:49,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:49,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:49,410 INFO L87 Difference]: Start difference. First operand 1487 states and 2538 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:49,611 INFO L93 Difference]: Finished difference Result 3805 states and 6444 transitions. [2025-02-05 21:56:49,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:49,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-02-05 21:56:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:49,640 INFO L225 Difference]: With dead ends: 3805 [2025-02-05 21:56:49,640 INFO L226 Difference]: Without dead ends: 2321 [2025-02-05 21:56:49,649 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:49,649 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 346 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:49,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1178 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:49,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-02-05 21:56:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2317. [2025-02-05 21:56:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1758 states have (on average 1.5915813424345848) internal successors, (2798), 1764 states have internal predecessors, (2798), 546 states have call successors, (546), 12 states have call predecessors, (546), 12 states have return successors, (546), 540 states have call predecessors, (546), 546 states have call successors, (546) [2025-02-05 21:56:49,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3890 transitions. [2025-02-05 21:56:49,900 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3890 transitions. Word has length 732 [2025-02-05 21:56:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3890 transitions. [2025-02-05 21:56:49,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3890 transitions. [2025-02-05 21:56:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2025-02-05 21:56:49,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:49,911 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:56:49,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 424456345, now seen corresponding path program 1 times [2025-02-05 21:56:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168465393] [2025-02-05 21:56:49,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:49,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:49,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 732 statements into 1 equivalence classes. [2025-02-05 21:56:50,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 732 of 732 statements. [2025-02-05 21:56:50,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:50,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:50,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168465393] [2025-02-05 21:56:50,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168465393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:50,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:50,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:50,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016571222] [2025-02-05 21:56:50,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:50,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:50,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:50,275 INFO L87 Difference]: Start difference. First operand 2317 states and 3890 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:50,409 INFO L93 Difference]: Finished difference Result 4633 states and 7781 transitions. [2025-02-05 21:56:50,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:50,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 732 [2025-02-05 21:56:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:50,420 INFO L225 Difference]: With dead ends: 4633 [2025-02-05 21:56:50,420 INFO L226 Difference]: Without dead ends: 2319 [2025-02-05 21:56:50,423 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:50,424 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:50,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1186 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2025-02-05 21:56:50,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2319. [2025-02-05 21:56:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1760 states have (on average 1.5909090909090908) internal successors, (2800), 1766 states have internal predecessors, (2800), 546 states have call successors, (546), 12 states have call predecessors, (546), 12 states have return successors, (546), 540 states have call predecessors, (546), 546 states have call successors, (546) [2025-02-05 21:56:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3892 transitions. [2025-02-05 21:56:50,536 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3892 transitions. Word has length 732 [2025-02-05 21:56:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 2319 states and 3892 transitions. [2025-02-05 21:56:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3892 transitions. [2025-02-05 21:56:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2025-02-05 21:56:50,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:50,543 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:56:50,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:50,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:50,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2108899061, now seen corresponding path program 1 times [2025-02-05 21:56:50,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:50,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595686173] [2025-02-05 21:56:50,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:50,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:50,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-02-05 21:56:50,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-02-05 21:56:50,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:50,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:51,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595686173] [2025-02-05 21:56:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595686173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:51,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:51,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925186954] [2025-02-05 21:56:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:51,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:51,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:51,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:51,073 INFO L87 Difference]: Start difference. First operand 2319 states and 3892 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:51,286 INFO L93 Difference]: Finished difference Result 6951 states and 11670 transitions. [2025-02-05 21:56:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 734 [2025-02-05 21:56:51,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:51,310 INFO L225 Difference]: With dead ends: 6951 [2025-02-05 21:56:51,310 INFO L226 Difference]: Without dead ends: 4635 [2025-02-05 21:56:51,316 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:51,316 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 337 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:51,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1189 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:51,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2025-02-05 21:56:51,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4633. [2025-02-05 21:56:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4633 states, 3516 states have (on average 1.5824800910125143) internal successors, (5564), 3528 states have internal predecessors, (5564), 1092 states have call successors, (1092), 24 states have call predecessors, (1092), 24 states have return successors, (1092), 1080 states have call predecessors, (1092), 1092 states have call successors, (1092) [2025-02-05 21:56:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 7748 transitions. [2025-02-05 21:56:51,626 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 7748 transitions. Word has length 734 [2025-02-05 21:56:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:51,627 INFO L471 AbstractCegarLoop]: Abstraction has 4633 states and 7748 transitions. [2025-02-05 21:56:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 7748 transitions. [2025-02-05 21:56:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-02-05 21:56:51,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:51,633 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:56:51,634 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:51,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash -464396032, now seen corresponding path program 1 times [2025-02-05 21:56:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:51,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461003015] [2025-02-05 21:56:51,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:51,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-02-05 21:56:51,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-02-05 21:56:51,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:51,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:51,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:51,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:51,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461003015] [2025-02-05 21:56:51,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461003015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:51,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:51,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622015274] [2025-02-05 21:56:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:51,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:51,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:51,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:51,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:51,831 INFO L87 Difference]: Start difference. First operand 4633 states and 7748 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:52,115 INFO L93 Difference]: Finished difference Result 9761 states and 16246 transitions. [2025-02-05 21:56:52,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:52,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 735 [2025-02-05 21:56:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:52,153 INFO L225 Difference]: With dead ends: 9761 [2025-02-05 21:56:52,153 INFO L226 Difference]: Without dead ends: 5131 [2025-02-05 21:56:52,166 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:52,170 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 43 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:52,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1206 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:56:52,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2025-02-05 21:56:52,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 4777. [2025-02-05 21:56:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4777 states, 3660 states have (on average 1.5770491803278688) internal successors, (5772), 3672 states have internal predecessors, (5772), 1092 states have call successors, (1092), 24 states have call predecessors, (1092), 24 states have return successors, (1092), 1080 states have call predecessors, (1092), 1092 states have call successors, (1092) [2025-02-05 21:56:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4777 states to 4777 states and 7956 transitions. [2025-02-05 21:56:52,575 INFO L78 Accepts]: Start accepts. Automaton has 4777 states and 7956 transitions. Word has length 735 [2025-02-05 21:56:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:52,575 INFO L471 AbstractCegarLoop]: Abstraction has 4777 states and 7956 transitions. [2025-02-05 21:56:52,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4777 states and 7956 transitions. [2025-02-05 21:56:52,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 736 [2025-02-05 21:56:52,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:52,583 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:56:52,583 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:52,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -610160639, now seen corresponding path program 1 times [2025-02-05 21:56:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:52,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676026071] [2025-02-05 21:56:52,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:52,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:52,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 735 statements into 1 equivalence classes. [2025-02-05 21:56:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 735 of 735 statements. [2025-02-05 21:56:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:52,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:52,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676026071] [2025-02-05 21:56:52,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676026071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:52,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:52,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:56:52,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679415130] [2025-02-05 21:56:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:52,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:56:52,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:52,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:56:52,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:56:52,939 INFO L87 Difference]: Start difference. First operand 4777 states and 7956 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:53,325 INFO L93 Difference]: Finished difference Result 14261 states and 23782 transitions. [2025-02-05 21:56:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:56:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 735 [2025-02-05 21:56:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:53,397 INFO L225 Difference]: With dead ends: 14261 [2025-02-05 21:56:53,398 INFO L226 Difference]: Without dead ends: 9487 [2025-02-05 21:56:53,431 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:53,431 INFO L435 NwaCegarLoop]: 1167 mSDtfsCounter, 595 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:53,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1743 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:56:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2025-02-05 21:56:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 9485. [2025-02-05 21:56:53,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9485 states, 7252 states have (on average 1.5736348593491452) internal successors, (11412), 7276 states have internal predecessors, (11412), 2184 states have call successors, (2184), 48 states have call predecessors, (2184), 48 states have return successors, (2184), 2160 states have call predecessors, (2184), 2184 states have call successors, (2184) [2025-02-05 21:56:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9485 states to 9485 states and 15780 transitions. [2025-02-05 21:56:53,977 INFO L78 Accepts]: Start accepts. Automaton has 9485 states and 15780 transitions. Word has length 735 [2025-02-05 21:56:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 9485 states and 15780 transitions. [2025-02-05 21:56:53,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9485 states and 15780 transitions. [2025-02-05 21:56:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-05 21:56:53,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:53,984 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:56:53,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:53,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1803803121, now seen corresponding path program 1 times [2025-02-05 21:56:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:53,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957218324] [2025-02-05 21:56:53,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:54,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-05 21:56:54,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-05 21:56:54,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:54,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957218324] [2025-02-05 21:56:54,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957218324] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:54,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:56:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003508623] [2025-02-05 21:56:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:56:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:54,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:56:54,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:56:54,483 INFO L87 Difference]: Start difference. First operand 9485 states and 15780 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:55,182 INFO L93 Difference]: Finished difference Result 25769 states and 42958 transitions. [2025-02-05 21:56:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:56:55,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 736 [2025-02-05 21:56:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:55,232 INFO L225 Difference]: With dead ends: 25769 [2025-02-05 21:56:55,232 INFO L226 Difference]: Without dead ends: 16287 [2025-02-05 21:56:55,262 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:55,263 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 347 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 2235 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:55,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 2235 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:56:55,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2025-02-05 21:56:56,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 16245. [2025-02-05 21:56:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16245 states, 13500 states have (on average 1.6151111111111112) internal successors, (21804), 13556 states have internal predecessors, (21804), 2664 states have call successors, (2664), 80 states have call predecessors, (2664), 80 states have return successors, (2664), 2608 states have call predecessors, (2664), 2664 states have call successors, (2664) [2025-02-05 21:56:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 27132 transitions. [2025-02-05 21:56:56,257 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 27132 transitions. Word has length 736 [2025-02-05 21:56:56,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:56:56,258 INFO L471 AbstractCegarLoop]: Abstraction has 16245 states and 27132 transitions. [2025-02-05 21:56:56,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:56:56,258 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 27132 transitions. [2025-02-05 21:56:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-05 21:56:56,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:56:56,271 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:56:56,271 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:56:56,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:56:56,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1537962542, now seen corresponding path program 1 times [2025-02-05 21:56:56,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:56:56,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600622698] [2025-02-05 21:56:56,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:56:56,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:56:56,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-05 21:56:56,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-05 21:56:56,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:56:56,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:56:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:56:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:56:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600622698] [2025-02-05 21:56:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600622698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:56:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:56:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:56:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323216805] [2025-02-05 21:56:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:56:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:56:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:56:57,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:56:57,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:56:57,130 INFO L87 Difference]: Start difference. First operand 16245 states and 27132 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 21:56:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:56:58,917 INFO L93 Difference]: Finished difference Result 48859 states and 81647 transitions. [2025-02-05 21:56:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:56:58,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) Word has length 736 [2025-02-05 21:56:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:56:59,028 INFO L225 Difference]: With dead ends: 48859 [2025-02-05 21:56:59,028 INFO L226 Difference]: Without dead ends: 40737 [2025-02-05 21:56:59,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:56:59,062 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 1574 mSDsluCounter, 2213 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:56:59,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 2794 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:56:59,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40737 states. [2025-02-05 21:57:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40737 to 40605. [2025-02-05 21:57:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40605 states, 33744 states have (on average 1.617117117117117) internal successors, (54568), 33884 states have internal predecessors, (54568), 6660 states have call successors, (6660), 200 states have call predecessors, (6660), 200 states have return successors, (6660), 6520 states have call predecessors, (6660), 6660 states have call successors, (6660) [2025-02-05 21:57:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40605 states to 40605 states and 67888 transitions. [2025-02-05 21:57:00,705 INFO L78 Accepts]: Start accepts. Automaton has 40605 states and 67888 transitions. Word has length 736 [2025-02-05 21:57:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:00,706 INFO L471 AbstractCegarLoop]: Abstraction has 40605 states and 67888 transitions. [2025-02-05 21:57:00,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 2 states have call predecessors, (114), 2 states have call successors, (114) [2025-02-05 21:57:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 40605 states and 67888 transitions. [2025-02-05 21:57:00,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-05 21:57:00,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:00,719 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:00,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:57:00,720 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:00,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:00,720 INFO L85 PathProgramCache]: Analyzing trace with hash 790227598, now seen corresponding path program 1 times [2025-02-05 21:57:00,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:00,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279696413] [2025-02-05 21:57:00,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:00,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-05 21:57:00,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-05 21:57:00,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:00,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:57:01,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:01,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279696413] [2025-02-05 21:57:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279696413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:01,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92182256] [2025-02-05 21:57:01,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:01,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:01,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:01,933 INFO L87 Difference]: Start difference. First operand 40605 states and 67888 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:57:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:03,577 INFO L93 Difference]: Finished difference Result 121889 states and 203818 transitions. [2025-02-05 21:57:03,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 736 [2025-02-05 21:57:03,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:03,829 INFO L225 Difference]: With dead ends: 121889 [2025-02-05 21:57:03,829 INFO L226 Difference]: Without dead ends: 81287 [2025-02-05 21:57:03,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:57:03,918 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 409 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:03,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1734 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:57:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81287 states. [2025-02-05 21:57:07,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81287 to 81285. [2025-02-05 21:57:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81285 states, 67564 states have (on average 1.6140548220946065) internal successors, (109052), 67844 states have internal predecessors, (109052), 13320 states have call successors, (13320), 400 states have call predecessors, (13320), 400 states have return successors, (13320), 13040 states have call predecessors, (13320), 13320 states have call successors, (13320) [2025-02-05 21:57:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81285 states to 81285 states and 135692 transitions. [2025-02-05 21:57:08,180 INFO L78 Accepts]: Start accepts. Automaton has 81285 states and 135692 transitions. Word has length 736 [2025-02-05 21:57:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:57:08,181 INFO L471 AbstractCegarLoop]: Abstraction has 81285 states and 135692 transitions. [2025-02-05 21:57:08,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:57:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 81285 states and 135692 transitions. [2025-02-05 21:57:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 737 [2025-02-05 21:57:08,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:57:08,198 INFO L218 NwaCegarLoop]: trace histogram [114, 114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:57:08,198 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:57:08,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:57:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash 370710767, now seen corresponding path program 1 times [2025-02-05 21:57:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:57:08,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153723787] [2025-02-05 21:57:08,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:57:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:57:08,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 736 statements into 1 equivalence classes. [2025-02-05 21:57:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 736 of 736 statements. [2025-02-05 21:57:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:57:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:57:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 25764 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25764 trivial. 0 not checked. [2025-02-05 21:57:09,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:57:09,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153723787] [2025-02-05 21:57:09,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153723787] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:57:09,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:57:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:57:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596740592] [2025-02-05 21:57:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:57:09,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:57:09,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:57:09,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:57:09,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:57:09,117 INFO L87 Difference]: Start difference. First operand 81285 states and 135692 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) [2025-02-05 21:57:14,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:57:14,216 INFO L93 Difference]: Finished difference Result 273091 states and 455575 transitions. [2025-02-05 21:57:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:57:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 4 states have internal predecessors, (169), 1 states have call successors, (114), 1 states have call predecessors, (114), 1 states have return successors, (114), 1 states have call predecessors, (114), 1 states have call successors, (114) Word has length 736 [2025-02-05 21:57:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:57:15,112 INFO L225 Difference]: With dead ends: 273091 [2025-02-05 21:57:15,113 INFO L226 Difference]: Without dead ends: 191809 [2025-02-05 21:57:15,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:57:15,245 INFO L435 NwaCegarLoop]: 920 mSDtfsCounter, 1127 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:57:15,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 1855 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:57:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191809 states.