./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:12:55,074 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:12:55,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:12:55,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:12:55,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:12:55,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:12:55,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:12:55,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:12:55,148 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:12:55,148 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:12:55,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:12:55,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:12:55,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:12:55,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:12:55,150 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:12:55,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:12:55,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:12:55,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:12:55,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:55,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:12:55,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:12:55,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:12:55,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:12:55,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:12:55,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:12:55,153 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04a66e3f5e0c01de9542e5e7b3340b25c89da9661ce4bdf3a3b49f3763c62dc2 [2025-03-03 20:12:55,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:12:55,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:12:55,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:12:55,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:12:55,396 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:12:55,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-03-03 20:12:56,585 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8482886f0/1c90b98a7fa24509af143496ea8eb87f/FLAGeda0fcc22 [2025-03-03 20:12:56,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:12:56,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-03-03 20:12:56,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8482886f0/1c90b98a7fa24509af143496ea8eb87f/FLAGeda0fcc22 [2025-03-03 20:12:57,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8482886f0/1c90b98a7fa24509af143496ea8eb87f [2025-03-03 20:12:57,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:12:57,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:12:57,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:57,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:12:57,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:12:57,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c621b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57, skipping insertion in model container [2025-03-03 20:12:57,181 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:12:57,331 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i[916,929] [2025-03-03 20:12:57,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:57,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:12:57,482 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-96.i[916,929] [2025-03-03 20:12:57,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:12:57,569 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:12:57,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57 WrapperNode [2025-03-03 20:12:57,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:12:57,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:57,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:12:57,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:12:57,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,660 INFO L138 Inliner]: procedures = 26, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 889 [2025-03-03 20:12:57,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:12:57,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:12:57,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:12:57,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:12:57,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,731 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:12:57,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,761 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:12:57,793 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:12:57,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:12:57,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:12:57,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (1/1) ... [2025-03-03 20:12:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:12:57,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:57,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:12:57,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:12:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:12:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:12:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:12:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:12:57,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:12:57,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:12:57,974 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:12:57,976 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:12:59,081 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 20:12:59,081 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:12:59,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:12:59,117 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:12:59,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:59 BoogieIcfgContainer [2025-03-03 20:12:59,117 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:12:59,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:12:59,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:12:59,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:12:59,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:12:57" (1/3) ... [2025-03-03 20:12:59,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faa31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:59, skipping insertion in model container [2025-03-03 20:12:59,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:12:57" (2/3) ... [2025-03-03 20:12:59,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5faa31e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:12:59, skipping insertion in model container [2025-03-03 20:12:59,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:12:59" (3/3) ... [2025-03-03 20:12:59,125 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i [2025-03-03 20:12:59,136 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:12:59,140 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-96.i that has 2 procedures, 374 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:12:59,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:12:59,210 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;@3d6b65da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:12:59,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:12:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 20:12:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-03 20:12:59,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:12:59,244 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:12:59,244 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:12:59,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:12:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash 897616484, now seen corresponding path program 1 times [2025-03-03 20:12:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:12:59,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339006102] [2025-03-03 20:12:59,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:12:59,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:12:59,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:12:59,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:12:59,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:12:59,855 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-03-03 20:12:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:12:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339006102] [2025-03-03 20:12:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339006102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:12:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559746528] [2025-03-03 20:12:59,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:12:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:12:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:12:59,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:12:59,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:13:00,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:13:00,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:13:00,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:00,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:00,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 1669 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:13:00,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:13:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 27848 trivial. 0 not checked. [2025-03-03 20:13:00,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:13:00,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559746528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:00,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:13:00,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:13:00,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850197799] [2025-03-03 20:13:00,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:00,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:13:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:00,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:13:00,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:13:00,296 INFO L87 Difference]: Start difference. First operand has 374 states, 252 states have (on average 1.5912698412698412) internal successors, (401), 253 states have internal predecessors, (401), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) 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, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-03-03 20:13:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:00,376 INFO L93 Difference]: Finished difference Result 738 states and 1384 transitions. [2025-03-03 20:13:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:13:00,378 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, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) Word has length 755 [2025-03-03 20:13:00,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:00,385 INFO L225 Difference]: With dead ends: 738 [2025-03-03 20:13:00,385 INFO L226 Difference]: Without dead ends: 367 [2025-03-03 20:13:00,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:13:00,397 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:00,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-03 20:13:00,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2025-03-03 20:13:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 246 states have (on average 1.5406504065040652) internal successors, (379), 246 states have internal predecessors, (379), 119 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 119 states have call predecessors, (119), 119 states have call successors, (119) [2025-03-03 20:13:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 617 transitions. [2025-03-03 20:13:00,489 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 617 transitions. Word has length 755 [2025-03-03 20:13:00,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:00,489 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 617 transitions. [2025-03-03 20:13:00,490 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, (119), 2 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 2 states have call successors, (119) [2025-03-03 20:13:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 617 transitions. [2025-03-03 20:13:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 756 [2025-03-03 20:13:00,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:00,506 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:00,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:13:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:13:00,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:00,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -502444065, now seen corresponding path program 1 times [2025-03-03 20:13:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:00,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424578411] [2025-03-03 20:13:00,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:00,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 755 statements into 1 equivalence classes. [2025-03-03 20:13:00,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 755 of 755 statements. [2025-03-03 20:13:00,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:00,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:01,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424578411] [2025-03-03 20:13:01,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424578411] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:01,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:13:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237949220] [2025-03-03 20:13:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:01,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:13:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:01,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:13:01,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:01,518 INFO L87 Difference]: Start difference. First operand 367 states and 617 transitions. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:01,956 INFO L93 Difference]: Finished difference Result 1375 states and 2319 transitions. [2025-03-03 20:13:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:13:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 755 [2025-03-03 20:13:01,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:01,967 INFO L225 Difference]: With dead ends: 1375 [2025-03-03 20:13:01,968 INFO L226 Difference]: Without dead ends: 1011 [2025-03-03 20:13:01,969 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-03-03 20:13:01,970 INFO L435 NwaCegarLoop]: 1251 mSDtfsCounter, 892 mSDsluCounter, 1677 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:01,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 2928 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:13:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-03-03 20:13:02,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1002. [2025-03-03 20:13:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 735 states have (on average 1.5850340136054422) internal successors, (1165), 738 states have internal predecessors, (1165), 262 states have call successors, (262), 4 states have call predecessors, (262), 4 states have return successors, (262), 259 states have call predecessors, (262), 262 states have call successors, (262) [2025-03-03 20:13:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1689 transitions. [2025-03-03 20:13:02,059 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1689 transitions. Word has length 755 [2025-03-03 20:13:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:02,063 INFO L471 AbstractCegarLoop]: Abstraction has 1002 states and 1689 transitions. [2025-03-03 20:13:02,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1689 transitions. [2025-03-03 20:13:02,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 757 [2025-03-03 20:13:02,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:02,090 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:02,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:13:02,090 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:02,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:02,091 INFO L85 PathProgramCache]: Analyzing trace with hash 37609985, now seen corresponding path program 1 times [2025-03-03 20:13:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892056346] [2025-03-03 20:13:02,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:02,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 756 statements into 1 equivalence classes. [2025-03-03 20:13:02,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 756 of 756 statements. [2025-03-03 20:13:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:02,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:02,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892056346] [2025-03-03 20:13:02,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892056346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225505208] [2025-03-03 20:13:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:02,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:02,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:02,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:02,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:02,411 INFO L87 Difference]: Start difference. First operand 1002 states and 1689 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:02,576 INFO L93 Difference]: Finished difference Result 2992 states and 5045 transitions. [2025-03-03 20:13:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:02,578 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 756 [2025-03-03 20:13:02,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:02,594 INFO L225 Difference]: With dead ends: 2992 [2025-03-03 20:13:02,595 INFO L226 Difference]: Without dead ends: 1993 [2025-03-03 20:13:02,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:02,601 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 603 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:02,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1164 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:02,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-03-03 20:13:02,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1990. [2025-03-03 20:13:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1990 states, 1457 states have (on average 1.5655456417295814) internal successors, (2281), 1463 states have internal predecessors, (2281), 524 states have call successors, (524), 8 states have call predecessors, (524), 8 states have return successors, (524), 518 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-03 20:13:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 3329 transitions. [2025-03-03 20:13:02,775 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 3329 transitions. Word has length 756 [2025-03-03 20:13:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:02,777 INFO L471 AbstractCegarLoop]: Abstraction has 1990 states and 3329 transitions. [2025-03-03 20:13:02,778 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 3329 transitions. [2025-03-03 20:13:02,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 20:13:02,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:02,786 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:02,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:13:02,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:02,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:02,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1615875351, now seen corresponding path program 1 times [2025-03-03 20:13:02,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:02,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615912102] [2025-03-03 20:13:02,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:02,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:02,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 20:13:02,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 20:13:02,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:02,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615912102] [2025-03-03 20:13:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615912102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:03,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495364771] [2025-03-03 20:13:03,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:03,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:03,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:03,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:03,079 INFO L87 Difference]: Start difference. First operand 1990 states and 3329 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:03,318 INFO L93 Difference]: Finished difference Result 5536 states and 9270 transitions. [2025-03-03 20:13:03,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:03,318 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-03-03 20:13:03,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:03,344 INFO L225 Difference]: With dead ends: 5536 [2025-03-03 20:13:03,344 INFO L226 Difference]: Without dead ends: 3549 [2025-03-03 20:13:03,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:03,352 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 313 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:03,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1164 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2025-03-03 20:13:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 3539. [2025-03-03 20:13:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3539 states, 2726 states have (on average 1.5763022743947175) internal successors, (4297), 2740 states have internal predecessors, (4297), 796 states have call successors, (796), 16 states have call predecessors, (796), 16 states have return successors, (796), 782 states have call predecessors, (796), 796 states have call successors, (796) [2025-03-03 20:13:03,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 5889 transitions. [2025-03-03 20:13:03,575 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 5889 transitions. Word has length 757 [2025-03-03 20:13:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 3539 states and 5889 transitions. [2025-03-03 20:13:03,576 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 5889 transitions. [2025-03-03 20:13:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 20:13:03,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:03,583 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:03,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:13:03,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -81017767, now seen corresponding path program 1 times [2025-03-03 20:13:03,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328821204] [2025-03-03 20:13:03,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:03,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 20:13:03,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 20:13:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:03,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:03,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328821204] [2025-03-03 20:13:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328821204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151079337] [2025-03-03 20:13:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:03,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:03,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:03,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:03,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:03,828 INFO L87 Difference]: Start difference. First operand 3539 states and 5889 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:04,046 INFO L93 Difference]: Finished difference Result 7525 states and 12524 transitions. [2025-03-03 20:13:04,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:04,047 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-03-03 20:13:04,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:04,073 INFO L225 Difference]: With dead ends: 7525 [2025-03-03 20:13:04,073 INFO L226 Difference]: Without dead ends: 3989 [2025-03-03 20:13:04,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:04,086 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 320 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:04,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1173 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2025-03-03 20:13:04,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3251. [2025-03-03 20:13:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2766 states have (on average 1.6272595806218366) internal successors, (4501), 2772 states have internal predecessors, (4501), 472 states have call successors, (472), 12 states have call predecessors, (472), 12 states have return successors, (472), 466 states have call predecessors, (472), 472 states have call successors, (472) [2025-03-03 20:13:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 5445 transitions. [2025-03-03 20:13:04,270 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 5445 transitions. Word has length 757 [2025-03-03 20:13:04,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:04,273 INFO L471 AbstractCegarLoop]: Abstraction has 3251 states and 5445 transitions. [2025-03-03 20:13:04,274 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 5445 transitions. [2025-03-03 20:13:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 20:13:04,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:04,306 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:04,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:13:04,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:04,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:04,307 INFO L85 PathProgramCache]: Analyzing trace with hash -489841992, now seen corresponding path program 1 times [2025-03-03 20:13:04,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:04,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846246359] [2025-03-03 20:13:04,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:04,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 20:13:04,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 20:13:04,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:04,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:04,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846246359] [2025-03-03 20:13:04,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846246359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:04,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:04,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271075574] [2025-03-03 20:13:04,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:04,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:04,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:04,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:04,550 INFO L87 Difference]: Start difference. First operand 3251 states and 5445 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:04,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:04,788 INFO L93 Difference]: Finished difference Result 9747 states and 16329 transitions. [2025-03-03 20:13:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:04,789 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-03-03 20:13:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:04,823 INFO L225 Difference]: With dead ends: 9747 [2025-03-03 20:13:04,823 INFO L226 Difference]: Without dead ends: 6499 [2025-03-03 20:13:04,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:04,835 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 590 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:04,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1200 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:04,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6499 states. [2025-03-03 20:13:05,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6499 to 6497. [2025-03-03 20:13:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6497 states, 5528 states have (on average 1.6190303907380608) internal successors, (8950), 5540 states have internal predecessors, (8950), 944 states have call successors, (944), 24 states have call predecessors, (944), 24 states have return successors, (944), 932 states have call predecessors, (944), 944 states have call successors, (944) [2025-03-03 20:13:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 10838 transitions. [2025-03-03 20:13:05,170 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 10838 transitions. Word has length 757 [2025-03-03 20:13:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 6497 states and 10838 transitions. [2025-03-03 20:13:05,172 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 10838 transitions. [2025-03-03 20:13:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 20:13:05,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:05,183 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:05,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:13:05,184 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:05,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:05,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1017709817, now seen corresponding path program 1 times [2025-03-03 20:13:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:05,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758073926] [2025-03-03 20:13:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:05,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 20:13:05,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 20:13:05,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:05,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:05,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:05,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758073926] [2025-03-03 20:13:05,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758073926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:05,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:05,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:05,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506637959] [2025-03-03 20:13:05,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:05,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:05,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:05,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:05,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:05,558 INFO L87 Difference]: Start difference. First operand 6497 states and 10838 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:05,754 INFO L93 Difference]: Finished difference Result 13027 states and 21745 transitions. [2025-03-03 20:13:05,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:05,758 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-03-03 20:13:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:05,823 INFO L225 Difference]: With dead ends: 13027 [2025-03-03 20:13:05,825 INFO L226 Difference]: Without dead ends: 6533 [2025-03-03 20:13:05,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:05,835 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:05,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1178 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6533 states. [2025-03-03 20:13:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6533 to 6533. [2025-03-03 20:13:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 5564 states have (on average 1.6150251617541338) internal successors, (8986), 5576 states have internal predecessors, (8986), 944 states have call successors, (944), 24 states have call predecessors, (944), 24 states have return successors, (944), 932 states have call predecessors, (944), 944 states have call successors, (944) [2025-03-03 20:13:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 10874 transitions. [2025-03-03 20:13:06,058 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 10874 transitions. Word has length 757 [2025-03-03 20:13:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 6533 states and 10874 transitions. [2025-03-03 20:13:06,060 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 10874 transitions. [2025-03-03 20:13:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 758 [2025-03-03 20:13:06,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:06,069 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:06,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:13:06,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:06,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -652803752, now seen corresponding path program 1 times [2025-03-03 20:13:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:06,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949751466] [2025-03-03 20:13:06,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:06,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 757 statements into 1 equivalence classes. [2025-03-03 20:13:06,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 757 of 757 statements. [2025-03-03 20:13:06,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:06,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:06,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949751466] [2025-03-03 20:13:06,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949751466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:06,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546222754] [2025-03-03 20:13:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:06,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:06,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:06,541 INFO L87 Difference]: Start difference. First operand 6533 states and 10874 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:06,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:06,992 INFO L93 Difference]: Finished difference Result 19557 states and 32580 transitions. [2025-03-03 20:13:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:06,993 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 757 [2025-03-03 20:13:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:07,040 INFO L225 Difference]: With dead ends: 19557 [2025-03-03 20:13:07,040 INFO L226 Difference]: Without dead ends: 13027 [2025-03-03 20:13:07,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:07,059 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 403 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:07,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1376 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13027 states. [2025-03-03 20:13:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13027 to 13025. [2025-03-03 20:13:07,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13025 states, 11088 states have (on average 1.613997113997114) internal successors, (17896), 11112 states have internal predecessors, (17896), 1888 states have call successors, (1888), 48 states have call predecessors, (1888), 48 states have return successors, (1888), 1864 states have call predecessors, (1888), 1888 states have call successors, (1888) [2025-03-03 20:13:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 21672 transitions. [2025-03-03 20:13:07,698 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 21672 transitions. Word has length 757 [2025-03-03 20:13:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:07,700 INFO L471 AbstractCegarLoop]: Abstraction has 13025 states and 21672 transitions. [2025-03-03 20:13:07,700 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 21672 transitions. [2025-03-03 20:13:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2025-03-03 20:13:07,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:07,715 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:13:07,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash 369360405, now seen corresponding path program 1 times [2025-03-03 20:13:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370796754] [2025-03-03 20:13:07,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:07,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 759 statements into 1 equivalence classes. [2025-03-03 20:13:07,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 759 of 759 statements. [2025-03-03 20:13:07,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:07,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:07,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370796754] [2025-03-03 20:13:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370796754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:07,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802803514] [2025-03-03 20:13:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:07,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:07,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:07,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:07,916 INFO L87 Difference]: Start difference. First operand 13025 states and 21672 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:08,344 INFO L93 Difference]: Finished difference Result 26387 states and 43864 transitions. [2025-03-03 20:13:08,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:08,344 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 759 [2025-03-03 20:13:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:08,387 INFO L225 Difference]: With dead ends: 26387 [2025-03-03 20:13:08,387 INFO L226 Difference]: Without dead ends: 13365 [2025-03-03 20:13:08,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:08,416 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 365 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:08,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 1373 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:08,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13365 states. [2025-03-03 20:13:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13365 to 12083. [2025-03-03 20:13:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12083 states, 10690 states have (on average 1.6215154349859682) internal successors, (17334), 10698 states have internal predecessors, (17334), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1336 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-03-03 20:13:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12083 states to 12083 states and 20022 transitions. [2025-03-03 20:13:08,911 INFO L78 Accepts]: Start accepts. Automaton has 12083 states and 20022 transitions. Word has length 759 [2025-03-03 20:13:08,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:08,912 INFO L471 AbstractCegarLoop]: Abstraction has 12083 states and 20022 transitions. [2025-03-03 20:13:08,912 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:08,912 INFO L276 IsEmpty]: Start isEmpty. Operand 12083 states and 20022 transitions. [2025-03-03 20:13:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-03 20:13:08,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:08,924 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:08,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:13:08,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:08,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1146149081, now seen corresponding path program 1 times [2025-03-03 20:13:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529556463] [2025-03-03 20:13:08,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:08,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-03 20:13:08,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-03 20:13:08,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:08,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529556463] [2025-03-03 20:13:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529556463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418184924] [2025-03-03 20:13:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:09,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:09,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:09,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:09,208 INFO L87 Difference]: Start difference. First operand 12083 states and 20022 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:09,504 INFO L93 Difference]: Finished difference Result 24163 states and 40041 transitions. [2025-03-03 20:13:09,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:09,505 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 760 [2025-03-03 20:13:09,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:09,544 INFO L225 Difference]: With dead ends: 24163 [2025-03-03 20:13:09,544 INFO L226 Difference]: Without dead ends: 12083 [2025-03-03 20:13:09,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:09,566 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:09,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1177 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2025-03-03 20:13:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 12047. [2025-03-03 20:13:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12047 states, 10654 states have (on average 1.6168575183029847) internal successors, (17226), 10662 states have internal predecessors, (17226), 1344 states have call successors, (1344), 48 states have call predecessors, (1344), 48 states have return successors, (1344), 1336 states have call predecessors, (1344), 1344 states have call successors, (1344) [2025-03-03 20:13:10,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12047 states to 12047 states and 19914 transitions. [2025-03-03 20:13:10,102 INFO L78 Accepts]: Start accepts. Automaton has 12047 states and 19914 transitions. Word has length 760 [2025-03-03 20:13:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:10,104 INFO L471 AbstractCegarLoop]: Abstraction has 12047 states and 19914 transitions. [2025-03-03 20:13:10,104 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:10,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12047 states and 19914 transitions. [2025-03-03 20:13:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-03-03 20:13:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:10,120 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:10,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:13:10,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:10,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:10,122 INFO L85 PathProgramCache]: Analyzing trace with hash -524364488, now seen corresponding path program 1 times [2025-03-03 20:13:10,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:10,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521143771] [2025-03-03 20:13:10,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:10,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:10,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-03-03 20:13:10,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-03-03 20:13:10,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:10,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:10,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:10,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521143771] [2025-03-03 20:13:10,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521143771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:10,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:10,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:10,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31396966] [2025-03-03 20:13:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:10,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:10,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:10,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:10,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:10,653 INFO L87 Difference]: Start difference. First operand 12047 states and 19914 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:11,177 INFO L93 Difference]: Finished difference Result 35479 states and 58600 transitions. [2025-03-03 20:13:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:11,178 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 760 [2025-03-03 20:13:11,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:11,243 INFO L225 Difference]: With dead ends: 35479 [2025-03-03 20:13:11,244 INFO L226 Difference]: Without dead ends: 23435 [2025-03-03 20:13:11,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:11,267 INFO L435 NwaCegarLoop]: 667 mSDtfsCounter, 363 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:11,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1249 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:13:11,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23435 states. [2025-03-03 20:13:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23435 to 23329. [2025-03-03 20:13:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23329 states, 20544 states have (on average 1.608644859813084) internal successors, (33048), 20560 states have internal predecessors, (33048), 2688 states have call successors, (2688), 96 states have call predecessors, (2688), 96 states have return successors, (2688), 2672 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-03-03 20:13:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 38424 transitions. [2025-03-03 20:13:12,145 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 38424 transitions. Word has length 760 [2025-03-03 20:13:12,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:12,147 INFO L471 AbstractCegarLoop]: Abstraction has 23329 states and 38424 transitions. [2025-03-03 20:13:12,147 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, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 38424 transitions. [2025-03-03 20:13:12,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-03-03 20:13:12,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:12,162 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:12,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:13:12,163 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:12,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:12,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1787481194, now seen corresponding path program 1 times [2025-03-03 20:13:12,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:12,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704836985] [2025-03-03 20:13:12,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:12,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:12,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-03-03 20:13:12,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-03-03 20:13:12,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:12,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:12,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:12,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704836985] [2025-03-03 20:13:12,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704836985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:12,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:12,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:13:12,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353686068] [2025-03-03 20:13:12,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:12,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:13:12,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:12,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:13:12,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:12,587 INFO L87 Difference]: Start difference. First operand 23329 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:13,014 INFO L93 Difference]: Finished difference Result 46655 states and 76845 transitions. [2025-03-03 20:13:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:13:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 762 [2025-03-03 20:13:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:13,098 INFO L225 Difference]: With dead ends: 46655 [2025-03-03 20:13:13,098 INFO L226 Difference]: Without dead ends: 23329 [2025-03-03 20:13:13,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:13:13,144 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 341 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:13,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 594 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:13:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23329 states. [2025-03-03 20:13:13,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23329 to 23329. [2025-03-03 20:13:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23329 states, 20544 states have (on average 1.6070872274143302) internal successors, (33016), 20560 states have internal predecessors, (33016), 2688 states have call successors, (2688), 96 states have call predecessors, (2688), 96 states have return successors, (2688), 2672 states have call predecessors, (2688), 2688 states have call successors, (2688) [2025-03-03 20:13:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23329 states to 23329 states and 38392 transitions. [2025-03-03 20:13:13,951 INFO L78 Accepts]: Start accepts. Automaton has 23329 states and 38392 transitions. Word has length 762 [2025-03-03 20:13:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 23329 states and 38392 transitions. [2025-03-03 20:13:13,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:13,953 INFO L276 IsEmpty]: Start isEmpty. Operand 23329 states and 38392 transitions. [2025-03-03 20:13:13,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-03 20:13:13,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:13,969 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:13,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:13:13,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:13,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:13,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1156998710, now seen corresponding path program 1 times [2025-03-03 20:13:13,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:13,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725269686] [2025-03-03 20:13:13,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:13,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:13,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-03 20:13:14,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-03 20:13:14,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:14,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:14,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:14,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725269686] [2025-03-03 20:13:14,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725269686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:14,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:14,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:13:14,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212644289] [2025-03-03 20:13:14,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:14,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:13:14,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:14,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:13:14,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:13:14,716 INFO L87 Difference]: Start difference. First operand 23329 states and 38392 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:16,294 INFO L93 Difference]: Finished difference Result 70133 states and 115474 transitions. [2025-03-03 20:13:16,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:13:16,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-03-03 20:13:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:16,450 INFO L225 Difference]: With dead ends: 70133 [2025-03-03 20:13:16,450 INFO L226 Difference]: Without dead ends: 46807 [2025-03-03 20:13:16,511 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-03-03 20:13:16,512 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 384 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1532 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:16,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1532 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:13:16,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46807 states. [2025-03-03 20:13:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46807 to 46653. [2025-03-03 20:13:18,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46653 states, 41084 states have (on average 1.603446597215461) internal successors, (65876), 41116 states have internal predecessors, (65876), 5376 states have call successors, (5376), 192 states have call predecessors, (5376), 192 states have return successors, (5376), 5344 states have call predecessors, (5376), 5376 states have call successors, (5376) [2025-03-03 20:13:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46653 states to 46653 states and 76628 transitions. [2025-03-03 20:13:18,261 INFO L78 Accepts]: Start accepts. Automaton has 46653 states and 76628 transitions. Word has length 764 [2025-03-03 20:13:18,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:18,262 INFO L471 AbstractCegarLoop]: Abstraction has 46653 states and 76628 transitions. [2025-03-03 20:13:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 46653 states and 76628 transitions. [2025-03-03 20:13:18,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-03 20:13:18,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:18,287 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:13:18,288 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:18,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:18,288 INFO L85 PathProgramCache]: Analyzing trace with hash -773620395, now seen corresponding path program 1 times [2025-03-03 20:13:18,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:18,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840358583] [2025-03-03 20:13:18,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:18,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-03 20:13:18,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-03 20:13:18,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:18,948 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840358583] [2025-03-03 20:13:18,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840358583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:18,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:18,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:13:18,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043674632] [2025-03-03 20:13:18,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:13:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:18,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:13:18,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:13:18,951 INFO L87 Difference]: Start difference. First operand 46653 states and 76628 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:24,836 INFO L93 Difference]: Finished difference Result 251975 states and 414105 transitions. [2025-03-03 20:13:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:13:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-03-03 20:13:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:25,328 INFO L225 Difference]: With dead ends: 251975 [2025-03-03 20:13:25,328 INFO L226 Difference]: Without dead ends: 205325 [2025-03-03 20:13:25,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:13:25,459 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 2285 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 2490 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:25,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 2490 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 20:13:25,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205325 states. [2025-03-03 20:13:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205325 to 204997. [2025-03-03 20:13:32,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204997 states, 185316 states have (on average 1.60696324116644) internal successors, (297796), 185572 states have internal predecessors, (297796), 18848 states have call successors, (18848), 832 states have call predecessors, (18848), 832 states have return successors, (18848), 18592 states have call predecessors, (18848), 18848 states have call successors, (18848) [2025-03-03 20:13:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204997 states to 204997 states and 335492 transitions. [2025-03-03 20:13:32,783 INFO L78 Accepts]: Start accepts. Automaton has 204997 states and 335492 transitions. Word has length 764 [2025-03-03 20:13:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:13:32,785 INFO L471 AbstractCegarLoop]: Abstraction has 204997 states and 335492 transitions. [2025-03-03 20:13:32,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 6 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 204997 states and 335492 transitions. [2025-03-03 20:13:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 765 [2025-03-03 20:13:32,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:13:32,883 INFO L218 NwaCegarLoop]: trace histogram [119, 119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:13:32,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:13:32,883 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:13:32,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:13:32,884 INFO L85 PathProgramCache]: Analyzing trace with hash -335610892, now seen corresponding path program 1 times [2025-03-03 20:13:32,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:13:32,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162379165] [2025-03-03 20:13:32,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:13:32,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:13:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 764 statements into 1 equivalence classes. [2025-03-03 20:13:33,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 764 of 764 statements. [2025-03-03 20:13:33,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:13:33,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:13:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 28084 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28084 trivial. 0 not checked. [2025-03-03 20:13:35,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:13:35,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162379165] [2025-03-03 20:13:35,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162379165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:13:35,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:13:35,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:13:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929524287] [2025-03-03 20:13:35,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:13:35,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:13:35,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:13:35,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:13:35,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:13:35,397 INFO L87 Difference]: Start difference. First operand 204997 states and 335492 transitions. Second operand has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) [2025-03-03 20:13:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:13:53,755 INFO L93 Difference]: Finished difference Result 714101 states and 1157884 transitions. [2025-03-03 20:13:53,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 20:13:53,756 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 19.11111111111111) internal successors, (172), 9 states have internal predecessors, (172), 1 states have call successors, (119), 1 states have call predecessors, (119), 1 states have return successors, (119), 1 states have call predecessors, (119), 1 states have call successors, (119) Word has length 764 [2025-03-03 20:13:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:13:55,760 INFO L225 Difference]: With dead ends: 714101 [2025-03-03 20:13:55,760 INFO L226 Difference]: Without dead ends: 509107 [2025-03-03 20:13:56,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-03-03 20:13:56,098 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2284 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 1450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 2702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1450 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:13:56,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 3185 Invalid, 2702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1450 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 20:13:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509107 states.