./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.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_operatoramount_amount250_file-5.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 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:11:54,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:11:55,003 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:11:55,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:11:55,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:11:55,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:11:55,038 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:11:55,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:11:55,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:11:55,039 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:11:55,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:11:55,040 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:11:55,040 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:11:55,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:11:55,041 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:11:55,041 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:11:55,041 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:11:55,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:11:55,042 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:55,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:11:55,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:11:55,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:11:55,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:11:55,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:11:55,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:11:55,044 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:11:55,044 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 -> 4639c6b0fb22706997cf521ef330c95d8a0fb320eefb7d80395f3064e0e7914f [2025-03-04 00:11:55,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:11:55,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:11:55,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:11:55,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:11:55,346 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:11:55,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-03-04 00:11:56,563 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b783cd1fc/fcc821ed69d047eca28e18622f85fb3f/FLAG9aa967d3e [2025-03-04 00:11:56,832 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:11:56,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-03-04 00:11:56,842 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b783cd1fc/fcc821ed69d047eca28e18622f85fb3f/FLAG9aa967d3e [2025-03-04 00:11:56,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b783cd1fc/fcc821ed69d047eca28e18622f85fb3f [2025-03-04 00:11:56,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:11:56,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:11:56,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:56,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:11:56,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:11:56,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:56" (1/1) ... [2025-03-04 00:11:56,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9f35cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:56, skipping insertion in model container [2025-03-04 00:11:56,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:11:56" (1/1) ... [2025-03-04 00:11:56,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:11:56,991 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_operatoramount_amount250_file-5.i[915,928] [2025-03-04 00:11:57,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:57,108 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:11:57,116 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_operatoramount_amount250_file-5.i[915,928] [2025-03-04 00:11:57,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:11:57,191 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:11:57,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57 WrapperNode [2025-03-04 00:11:57,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:11:57,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:57,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:11:57,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:11:57,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,259 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-03-04 00:11:57,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:11:57,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:11:57,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:11:57,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:11:57,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,301 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-04 00:11:57,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,319 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:11:57,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:11:57,354 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:11:57,354 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:11:57,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (1/1) ... [2025-03-04 00:11:57,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:11:57,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:57,380 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-04 00:11:57,385 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-04 00:11:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:11:57,401 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:11:57,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:11:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:11:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:11:57,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:11:57,487 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:11:57,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:11:58,129 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc property_#t~ite33#1;havoc property_#t~bitwise32#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~bitwise36#1;havoc property_#t~short37#1;havoc property_#t~ite39#1;havoc property_#t~bitwise38#1;havoc property_#t~short40#1; [2025-03-04 00:11:58,209 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2025-03-04 00:11:58,210 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:11:58,234 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:11:58,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:11:58,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:58 BoogieIcfgContainer [2025-03-04 00:11:58,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:11:58,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:11:58,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:11:58,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:11:58,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:11:56" (1/3) ... [2025-03-04 00:11:58,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfc79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:58, skipping insertion in model container [2025-03-04 00:11:58,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:11:57" (2/3) ... [2025-03-04 00:11:58,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53cfc79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:11:58, skipping insertion in model container [2025-03-04 00:11:58,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:11:58" (3/3) ... [2025-03-04 00:11:58,242 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-5.i [2025-03-04 00:11:58,252 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:11:58,254 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-5.i that has 2 procedures, 168 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:11:58,295 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:11:58,304 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;@4b5156a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:11:58,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:11:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 00:11:58,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 00:11:58,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:58,323 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:58,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1016587399, now seen corresponding path program 1 times [2025-03-04 00:11:58,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:58,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502923923] [2025-03-04 00:11:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:58,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:58,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 00:11:58,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 00:11:58,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:58,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-04 00:11:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:11:58,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502923923] [2025-03-04 00:11:58,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502923923] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:11:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649033300] [2025-03-04 00:11:58,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:11:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:11:58,703 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-04 00:11:58,704 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-04 00:11:58,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 00:11:58,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 00:11:58,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:58,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:11:58,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:11:58,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:11:58,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2025-03-04 00:11:58,953 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:11:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649033300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:11:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:11:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:11:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675966957] [2025-03-04 00:11:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:11:58,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:11:58,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:11:58,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:11:58,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:11:58,977 INFO L87 Difference]: Start difference. First operand has 168 states, 130 states have (on average 1.5384615384615385) internal successors, (200), 131 states have internal predecessors, (200), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:11:59,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:11:59,016 INFO L93 Difference]: Finished difference Result 330 states and 570 transitions. [2025-03-04 00:11:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:11:59,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 249 [2025-03-04 00:11:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:11:59,025 INFO L225 Difference]: With dead ends: 330 [2025-03-04 00:11:59,025 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 00:11:59,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 250 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-04 00:11:59,029 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:11:59,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 255 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:11:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 00:11:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-04 00:11:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.5078125) internal successors, (193), 128 states have internal predecessors, (193), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 00:11:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 263 transitions. [2025-03-04 00:11:59,071 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 263 transitions. Word has length 249 [2025-03-04 00:11:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:11:59,074 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 263 transitions. [2025-03-04 00:11:59,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (35), 2 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:11:59,074 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 263 transitions. [2025-03-04 00:11:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 00:11:59,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:11:59,079 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:11:59,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:11:59,279 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-04 00:11:59,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:11:59,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:11:59,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2075730215, now seen corresponding path program 1 times [2025-03-04 00:11:59,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:11:59,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751382669] [2025-03-04 00:11:59,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:11:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:11:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 00:11:59,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 00:11:59,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:11:59,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:00,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:00,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751382669] [2025-03-04 00:12:00,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751382669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:00,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:00,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:12:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991792690] [2025-03-04 00:12:00,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:12:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:00,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:12:00,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:12:00,015 INFO L87 Difference]: Start difference. First operand 165 states and 263 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:00,387 INFO L93 Difference]: Finished difference Result 548 states and 885 transitions. [2025-03-04 00:12:00,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:12:00,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-03-04 00:12:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:00,391 INFO L225 Difference]: With dead ends: 548 [2025-03-04 00:12:00,391 INFO L226 Difference]: Without dead ends: 386 [2025-03-04 00:12:00,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:00,393 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 292 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:00,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1071 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-04 00:12:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 243. [2025-03-04 00:12:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 170 states have (on average 1.4352941176470588) internal successors, (244), 170 states have internal predecessors, (244), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 00:12:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 384 transitions. [2025-03-04 00:12:00,434 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 384 transitions. Word has length 249 [2025-03-04 00:12:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:00,435 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 384 transitions. [2025-03-04 00:12:00,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:00,436 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 384 transitions. [2025-03-04 00:12:00,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-04 00:12:00,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:00,441 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:00,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:12:00,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:00,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash 876136828, now seen corresponding path program 1 times [2025-03-04 00:12:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:00,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461045808] [2025-03-04 00:12:00,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:00,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:00,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-04 00:12:00,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-04 00:12:00,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:00,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:01,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461045808] [2025-03-04 00:12:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461045808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:12:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168041977] [2025-03-04 00:12:01,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:01,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:01,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:01,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:01,026 INFO L87 Difference]: Start difference. First operand 243 states and 384 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:01,639 INFO L93 Difference]: Finished difference Result 568 states and 907 transitions. [2025-03-04 00:12:01,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:12:01,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 249 [2025-03-04 00:12:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:01,643 INFO L225 Difference]: With dead ends: 568 [2025-03-04 00:12:01,643 INFO L226 Difference]: Without dead ends: 406 [2025-03-04 00:12:01,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-04 00:12:01,644 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 543 mSDsluCounter, 1193 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:01,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1477 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:12:01,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2025-03-04 00:12:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 343. [2025-03-04 00:12:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 270 states have (on average 1.5148148148148148) internal successors, (409), 270 states have internal predecessors, (409), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 00:12:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 549 transitions. [2025-03-04 00:12:01,667 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 549 transitions. Word has length 249 [2025-03-04 00:12:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:01,667 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 549 transitions. [2025-03-04 00:12:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 549 transitions. [2025-03-04 00:12:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 00:12:01,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:01,670 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:01,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:12:01,671 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:01,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:01,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1537596229, now seen corresponding path program 1 times [2025-03-04 00:12:01,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356679566] [2025-03-04 00:12:01,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:01,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:01,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 00:12:01,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 00:12:01,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:01,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:02,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356679566] [2025-03-04 00:12:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356679566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:12:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49998630] [2025-03-04 00:12:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:12:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:02,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:12:02,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:12:02,278 INFO L87 Difference]: Start difference. First operand 343 states and 549 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:03,561 INFO L93 Difference]: Finished difference Result 744 states and 1193 transitions. [2025-03-04 00:12:03,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:12:03,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 250 [2025-03-04 00:12:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:03,565 INFO L225 Difference]: With dead ends: 744 [2025-03-04 00:12:03,565 INFO L226 Difference]: Without dead ends: 582 [2025-03-04 00:12:03,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:12:03,566 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 653 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:03,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 2007 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:12:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-04 00:12:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 430. [2025-03-04 00:12:03,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.5602240896358543) internal successors, (557), 357 states have internal predecessors, (557), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-04 00:12:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 697 transitions. [2025-03-04 00:12:03,607 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 697 transitions. Word has length 250 [2025-03-04 00:12:03,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:03,608 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 697 transitions. [2025-03-04 00:12:03,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:03,609 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 697 transitions. [2025-03-04 00:12:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-04 00:12:03,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:03,612 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:12:03,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:03,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:03,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1031890170, now seen corresponding path program 1 times [2025-03-04 00:12:03,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:03,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801253305] [2025-03-04 00:12:03,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:03,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:03,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-04 00:12:03,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-04 00:12:03,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:03,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:04,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801253305] [2025-03-04 00:12:04,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801253305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:04,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:04,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:12:04,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979362183] [2025-03-04 00:12:04,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:12:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:04,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:12:04,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:12:04,109 INFO L87 Difference]: Start difference. First operand 430 states and 697 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:04,370 INFO L93 Difference]: Finished difference Result 1143 states and 1859 transitions. [2025-03-04 00:12:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:12:04,372 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 250 [2025-03-04 00:12:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:04,378 INFO L225 Difference]: With dead ends: 1143 [2025-03-04 00:12:04,379 INFO L226 Difference]: Without dead ends: 792 [2025-03-04 00:12:04,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-04 00:12:04,380 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 344 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:04,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 838 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:12:04,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-04 00:12:04,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 690. [2025-03-04 00:12:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 581 states have (on average 1.5559380378657488) internal successors, (904), 581 states have internal predecessors, (904), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 00:12:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1114 transitions. [2025-03-04 00:12:04,445 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1114 transitions. Word has length 250 [2025-03-04 00:12:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:04,447 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1114 transitions. [2025-03-04 00:12:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1114 transitions. [2025-03-04 00:12:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 00:12:04,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:04,449 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:04,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:12:04,450 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:04,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:04,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1753601001, now seen corresponding path program 1 times [2025-03-04 00:12:04,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:04,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226934209] [2025-03-04 00:12:04,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:04,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:04,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 00:12:04,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 00:12:04,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:04,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:04,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:04,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:04,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226934209] [2025-03-04 00:12:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226934209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:12:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853191929] [2025-03-04 00:12:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:04,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:12:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:04,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:12:04,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:12:04,940 INFO L87 Difference]: Start difference. First operand 690 states and 1114 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:05,612 INFO L93 Difference]: Finished difference Result 1480 states and 2372 transitions. [2025-03-04 00:12:05,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:12:05,612 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 251 [2025-03-04 00:12:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:05,620 INFO L225 Difference]: With dead ends: 1480 [2025-03-04 00:12:05,621 INFO L226 Difference]: Without dead ends: 1073 [2025-03-04 00:12:05,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:12:05,623 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 962 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:05,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1271 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:12:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-03-04 00:12:05,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 756. [2025-03-04 00:12:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 647 states have (on average 1.562596599690881) internal successors, (1011), 647 states have internal predecessors, (1011), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 00:12:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1221 transitions. [2025-03-04 00:12:05,671 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1221 transitions. Word has length 251 [2025-03-04 00:12:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:05,671 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1221 transitions. [2025-03-04 00:12:05,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1221 transitions. [2025-03-04 00:12:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 00:12:05,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:05,674 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:05,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:12:05,674 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:05,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash -915081140, now seen corresponding path program 1 times [2025-03-04 00:12:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524095502] [2025-03-04 00:12:05,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:05,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 00:12:05,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 00:12:05,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:05,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:05,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:05,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524095502] [2025-03-04 00:12:05,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524095502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:05,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:05,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:05,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470193326] [2025-03-04 00:12:05,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:05,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:05,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:05,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:05,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:05,779 INFO L87 Difference]: Start difference. First operand 756 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:05,876 INFO L93 Difference]: Finished difference Result 1583 states and 2536 transitions. [2025-03-04 00:12:05,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:05,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-03-04 00:12:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:05,883 INFO L225 Difference]: With dead ends: 1583 [2025-03-04 00:12:05,884 INFO L226 Difference]: Without dead ends: 1176 [2025-03-04 00:12:05,885 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-04 00:12:05,886 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 204 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:05,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 537 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2025-03-04 00:12:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 889. [2025-03-04 00:12:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 780 states have (on average 1.5602564102564103) internal successors, (1217), 780 states have internal predecessors, (1217), 105 states have call successors, (105), 3 states have call predecessors, (105), 3 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 00:12:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1427 transitions. [2025-03-04 00:12:05,932 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1427 transitions. Word has length 251 [2025-03-04 00:12:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:05,932 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1427 transitions. [2025-03-04 00:12:05,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1427 transitions. [2025-03-04 00:12:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 00:12:05,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:05,935 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:05,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:12:05,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:05,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 2026576459, now seen corresponding path program 1 times [2025-03-04 00:12:05,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:05,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113469178] [2025-03-04 00:12:05,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:05,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:05,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 00:12:06,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 00:12:06,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:06,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113469178] [2025-03-04 00:12:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113469178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:12:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497868015] [2025-03-04 00:12:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:06,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:12:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:12:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:12:06,278 INFO L87 Difference]: Start difference. First operand 889 states and 1427 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:06,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:06,475 INFO L93 Difference]: Finished difference Result 2421 states and 3895 transitions. [2025-03-04 00:12:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:12:06,476 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 251 [2025-03-04 00:12:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:06,484 INFO L225 Difference]: With dead ends: 2421 [2025-03-04 00:12:06,484 INFO L226 Difference]: Without dead ends: 1974 [2025-03-04 00:12:06,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-04 00:12:06,486 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 391 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:06,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 656 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:12:06,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-04 00:12:06,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1550. [2025-03-04 00:12:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 1403 states have (on average 1.5901639344262295) internal successors, (2231), 1405 states have internal predecessors, (2231), 141 states have call successors, (141), 5 states have call predecessors, (141), 5 states have return successors, (141), 139 states have call predecessors, (141), 141 states have call successors, (141) [2025-03-04 00:12:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 2513 transitions. [2025-03-04 00:12:06,587 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 2513 transitions. Word has length 251 [2025-03-04 00:12:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:06,588 INFO L471 AbstractCegarLoop]: Abstraction has 1550 states and 2513 transitions. [2025-03-04 00:12:06,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 2513 transitions. [2025-03-04 00:12:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:06,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:06,594 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:12:06,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1734677758, now seen corresponding path program 1 times [2025-03-04 00:12:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506384] [2025-03-04 00:12:06,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:06,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:06,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:06,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:06,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:06,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506384] [2025-03-04 00:12:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:06,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:06,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:06,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762382884] [2025-03-04 00:12:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:06,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:06,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:06,778 INFO L87 Difference]: Start difference. First operand 1550 states and 2513 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:06,865 INFO L93 Difference]: Finished difference Result 2595 states and 4143 transitions. [2025-03-04 00:12:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:06,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-04 00:12:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:06,875 INFO L225 Difference]: With dead ends: 2595 [2025-03-04 00:12:06,876 INFO L226 Difference]: Without dead ends: 1879 [2025-03-04 00:12:06,878 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-04 00:12:06,879 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 72 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:06,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 483 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:06,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-03-04 00:12:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1873. [2025-03-04 00:12:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1701 states have (on average 1.569077013521458) internal successors, (2669), 1707 states have internal predecessors, (2669), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 155 states have call predecessors, (161), 161 states have call successors, (161) [2025-03-04 00:12:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2991 transitions. [2025-03-04 00:12:06,953 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2991 transitions. Word has length 252 [2025-03-04 00:12:06,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:06,954 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2991 transitions. [2025-03-04 00:12:06,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:06,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2991 transitions. [2025-03-04 00:12:06,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:06,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:06,958 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:06,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:12:06,958 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:06,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:06,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1730142241, now seen corresponding path program 1 times [2025-03-04 00:12:06,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:06,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947846115] [2025-03-04 00:12:06,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:06,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:06,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:07,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:07,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:07,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:07,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:07,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:07,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947846115] [2025-03-04 00:12:07,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947846115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:07,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:07,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:12:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62627282] [2025-03-04 00:12:07,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:07,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:07,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:07,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:07,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:07,724 INFO L87 Difference]: Start difference. First operand 1873 states and 2991 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:08,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:08,953 INFO L93 Difference]: Finished difference Result 9818 states and 15332 transitions. [2025-03-04 00:12:08,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 00:12:08,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-04 00:12:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:08,991 INFO L225 Difference]: With dead ends: 9818 [2025-03-04 00:12:08,992 INFO L226 Difference]: Without dead ends: 8665 [2025-03-04 00:12:08,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:12:08,999 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 1378 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:09,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1412 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:12:09,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8665 states. [2025-03-04 00:12:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8665 to 5306. [2025-03-04 00:12:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5306 states, 5025 states have (on average 1.5691542288557214) internal successors, (7885), 5039 states have internal predecessors, (7885), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (261), 247 states have call predecessors, (261), 261 states have call successors, (261) [2025-03-04 00:12:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5306 states to 5306 states and 8407 transitions. [2025-03-04 00:12:09,221 INFO L78 Accepts]: Start accepts. Automaton has 5306 states and 8407 transitions. Word has length 252 [2025-03-04 00:12:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:09,222 INFO L471 AbstractCegarLoop]: Abstraction has 5306 states and 8407 transitions. [2025-03-04 00:12:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5306 states and 8407 transitions. [2025-03-04 00:12:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:09,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:09,232 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:09,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:12:09,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:09,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:09,233 INFO L85 PathProgramCache]: Analyzing trace with hash 83907513, now seen corresponding path program 1 times [2025-03-04 00:12:09,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:09,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123118144] [2025-03-04 00:12:09,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:09,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:09,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:09,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:09,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:09,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:09,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123118144] [2025-03-04 00:12:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123118144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:09,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:12:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103452725] [2025-03-04 00:12:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:09,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:12:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:12:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:12:09,622 INFO L87 Difference]: Start difference. First operand 5306 states and 8407 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:10,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:10,195 INFO L93 Difference]: Finished difference Result 9016 states and 14151 transitions. [2025-03-04 00:12:10,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:12:10,196 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 252 [2025-03-04 00:12:10,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:10,223 INFO L225 Difference]: With dead ends: 9016 [2025-03-04 00:12:10,224 INFO L226 Difference]: Without dead ends: 5873 [2025-03-04 00:12:10,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:12:10,232 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 292 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:10,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 1442 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:12:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5873 states. [2025-03-04 00:12:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5873 to 5354. [2025-03-04 00:12:10,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5354 states, 5073 states have (on average 1.5681056574019319) internal successors, (7955), 5087 states have internal predecessors, (7955), 261 states have call successors, (261), 19 states have call predecessors, (261), 19 states have return successors, (261), 247 states have call predecessors, (261), 261 states have call successors, (261) [2025-03-04 00:12:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 8477 transitions. [2025-03-04 00:12:10,392 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 8477 transitions. Word has length 252 [2025-03-04 00:12:10,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:10,392 INFO L471 AbstractCegarLoop]: Abstraction has 5354 states and 8477 transitions. [2025-03-04 00:12:10,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 8477 transitions. [2025-03-04 00:12:10,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:10,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:10,399 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:10,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 00:12:10,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -552384513, now seen corresponding path program 1 times [2025-03-04 00:12:10,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:10,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240205197] [2025-03-04 00:12:10,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:10,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:10,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:10,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:10,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:10,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:10,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:10,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240205197] [2025-03-04 00:12:10,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240205197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14087941] [2025-03-04 00:12:10,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:10,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:10,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:11,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:11,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:12:11,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:11,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:11,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:11,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:11,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:12:11,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1134 proven. 36 refuted. 0 times theorem prover too weak. 1210 trivial. 0 not checked. [2025-03-04 00:12:11,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 66 proven. 36 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14087941] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:11,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:11,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2025-03-04 00:12:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620375372] [2025-03-04 00:12:11,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 00:12:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:11,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 00:12:11,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:12:11,718 INFO L87 Difference]: Start difference. First operand 5354 states and 8477 transitions. Second operand has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-04 00:12:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:13,214 INFO L93 Difference]: Finished difference Result 10130 states and 15872 transitions. [2025-03-04 00:12:13,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:12:13,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 252 [2025-03-04 00:12:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:13,239 INFO L225 Difference]: With dead ends: 10130 [2025-03-04 00:12:13,240 INFO L226 Difference]: Without dead ends: 7105 [2025-03-04 00:12:13,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 502 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=313, Invalid=947, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 00:12:13,247 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 1926 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 1500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:13,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 1870 Invalid, 1500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:12:13,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7105 states. [2025-03-04 00:12:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7105 to 6753. [2025-03-04 00:12:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6331 states have (on average 1.5458853261728005) internal successors, (9787), 6353 states have internal predecessors, (9787), 387 states have call successors, (387), 34 states have call predecessors, (387), 34 states have return successors, (387), 365 states have call predecessors, (387), 387 states have call successors, (387) [2025-03-04 00:12:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 10561 transitions. [2025-03-04 00:12:13,434 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 10561 transitions. Word has length 252 [2025-03-04 00:12:13,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:13,434 INFO L471 AbstractCegarLoop]: Abstraction has 6753 states and 10561 transitions. [2025-03-04 00:12:13,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-04 00:12:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 10561 transitions. [2025-03-04 00:12:13,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:13,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:13,442 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:13,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 00:12:13,643 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:13,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:13,644 INFO L85 PathProgramCache]: Analyzing trace with hash -520369768, now seen corresponding path program 1 times [2025-03-04 00:12:13,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:13,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187222795] [2025-03-04 00:12:13,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:13,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:13,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:13,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:14,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187222795] [2025-03-04 00:12:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187222795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:14,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:12:14,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755908317] [2025-03-04 00:12:14,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:14,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:12:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:14,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:12:14,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:12:14,143 INFO L87 Difference]: Start difference. First operand 6753 states and 10561 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:14,684 INFO L93 Difference]: Finished difference Result 17788 states and 27472 transitions. [2025-03-04 00:12:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:12:14,685 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 252 [2025-03-04 00:12:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:14,713 INFO L225 Difference]: With dead ends: 17788 [2025-03-04 00:12:14,714 INFO L226 Difference]: Without dead ends: 12849 [2025-03-04 00:12:14,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:12:14,723 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 651 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:14,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1210 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:12:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12849 states. [2025-03-04 00:12:14,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12849 to 11917. [2025-03-04 00:12:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11917 states, 11232 states have (on average 1.5319622507122508) internal successors, (17207), 11274 states have internal predecessors, (17207), 629 states have call successors, (629), 55 states have call predecessors, (629), 55 states have return successors, (629), 587 states have call predecessors, (629), 629 states have call successors, (629) [2025-03-04 00:12:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11917 states to 11917 states and 18465 transitions. [2025-03-04 00:12:15,006 INFO L78 Accepts]: Start accepts. Automaton has 11917 states and 18465 transitions. Word has length 252 [2025-03-04 00:12:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:15,007 INFO L471 AbstractCegarLoop]: Abstraction has 11917 states and 18465 transitions. [2025-03-04 00:12:15,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:15,011 INFO L276 IsEmpty]: Start isEmpty. Operand 11917 states and 18465 transitions. [2025-03-04 00:12:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-04 00:12:15,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:15,029 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:15,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:12:15,029 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:15,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:15,029 INFO L85 PathProgramCache]: Analyzing trace with hash -493026792, now seen corresponding path program 1 times [2025-03-04 00:12:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368827339] [2025-03-04 00:12:15,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:15,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:15,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:15,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:15,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:15,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:15,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368827339] [2025-03-04 00:12:15,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368827339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:15,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32990862] [2025-03-04 00:12:15,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:15,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:15,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:15,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:15,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 00:12:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-04 00:12:15,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-04 00:12:15,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:15,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:15,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:12:15,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1212 proven. 45 refuted. 0 times theorem prover too weak. 1123 trivial. 0 not checked. [2025-03-04 00:12:15,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 57 proven. 45 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32990862] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:16,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-04 00:12:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665095750] [2025-03-04 00:12:16,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:12:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:12:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:12:16,116 INFO L87 Difference]: Start difference. First operand 11917 states and 18465 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-04 00:12:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:17,220 INFO L93 Difference]: Finished difference Result 26486 states and 40653 transitions. [2025-03-04 00:12:17,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 00:12:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) Word has length 252 [2025-03-04 00:12:17,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:17,257 INFO L225 Difference]: With dead ends: 26486 [2025-03-04 00:12:17,258 INFO L226 Difference]: Without dead ends: 14658 [2025-03-04 00:12:17,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2025-03-04 00:12:17,270 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1450 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1468 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:17,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1468 Valid, 1412 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 00:12:17,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14658 states. [2025-03-04 00:12:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14658 to 9634. [2025-03-04 00:12:17,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 8804 states have (on average 1.502498864152658) internal successors, (13228), 8848 states have internal predecessors, (13228), 739 states have call successors, (739), 90 states have call predecessors, (739), 90 states have return successors, (739), 695 states have call predecessors, (739), 739 states have call successors, (739) [2025-03-04 00:12:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 14706 transitions. [2025-03-04 00:12:17,753 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 14706 transitions. Word has length 252 [2025-03-04 00:12:17,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:17,754 INFO L471 AbstractCegarLoop]: Abstraction has 9634 states and 14706 transitions. [2025-03-04 00:12:17,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (85), 2 states have call predecessors, (85), 4 states have return successors, (86), 4 states have call predecessors, (86), 4 states have call successors, (86) [2025-03-04 00:12:17,754 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 14706 transitions. [2025-03-04 00:12:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 00:12:17,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:17,763 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:17,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:17,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:17,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:17,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:17,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1631168934, now seen corresponding path program 1 times [2025-03-04 00:12:17,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:17,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297163735] [2025-03-04 00:12:17,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:17,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:17,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:17,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:17,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:18,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:18,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297163735] [2025-03-04 00:12:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297163735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:18,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:12:18,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572287827] [2025-03-04 00:12:18,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:12:18,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:18,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:12:18,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:12:18,040 INFO L87 Difference]: Start difference. First operand 9634 states and 14706 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:18,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:18,332 INFO L93 Difference]: Finished difference Result 17178 states and 26016 transitions. [2025-03-04 00:12:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:12:18,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-03-04 00:12:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:18,362 INFO L225 Difference]: With dead ends: 17178 [2025-03-04 00:12:18,363 INFO L226 Difference]: Without dead ends: 11044 [2025-03-04 00:12:18,372 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-04 00:12:18,373 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 219 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:18,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 496 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:12:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11044 states. [2025-03-04 00:12:18,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11044 to 10832. [2025-03-04 00:12:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10832 states, 9654 states have (on average 1.4746219183758027) internal successors, (14236), 9714 states have internal predecessors, (14236), 1043 states have call successors, (1043), 134 states have call predecessors, (1043), 134 states have return successors, (1043), 983 states have call predecessors, (1043), 1043 states have call successors, (1043) [2025-03-04 00:12:18,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10832 states to 10832 states and 16322 transitions. [2025-03-04 00:12:18,699 INFO L78 Accepts]: Start accepts. Automaton has 10832 states and 16322 transitions. Word has length 254 [2025-03-04 00:12:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:18,699 INFO L471 AbstractCegarLoop]: Abstraction has 10832 states and 16322 transitions. [2025-03-04 00:12:18,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:18,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10832 states and 16322 transitions. [2025-03-04 00:12:18,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 00:12:18,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:18,708 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:18,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 00:12:18,708 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:18,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 866847003, now seen corresponding path program 1 times [2025-03-04 00:12:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519435039] [2025-03-04 00:12:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:18,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:18,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:18,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:18,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:18,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519435039] [2025-03-04 00:12:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519435039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:19,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:12:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684569083] [2025-03-04 00:12:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:19,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:12:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:19,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:12:19,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:12:19,130 INFO L87 Difference]: Start difference. First operand 10832 states and 16322 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:20,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:20,189 INFO L93 Difference]: Finished difference Result 26243 states and 38911 transitions. [2025-03-04 00:12:20,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:12:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 254 [2025-03-04 00:12:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:20,241 INFO L225 Difference]: With dead ends: 26243 [2025-03-04 00:12:20,241 INFO L226 Difference]: Without dead ends: 18681 [2025-03-04 00:12:20,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:12:20,260 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 750 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:20,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 819 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:12:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18681 states. [2025-03-04 00:12:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18681 to 11267. [2025-03-04 00:12:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11267 states, 9963 states have (on average 1.4598012646793135) internal successors, (14544), 10031 states have internal predecessors, (14544), 1151 states have call successors, (1151), 152 states have call predecessors, (1151), 152 states have return successors, (1151), 1083 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-04 00:12:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11267 states to 11267 states and 16846 transitions. [2025-03-04 00:12:20,963 INFO L78 Accepts]: Start accepts. Automaton has 11267 states and 16846 transitions. Word has length 254 [2025-03-04 00:12:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:20,964 INFO L471 AbstractCegarLoop]: Abstraction has 11267 states and 16846 transitions. [2025-03-04 00:12:20,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2025-03-04 00:12:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 11267 states and 16846 transitions. [2025-03-04 00:12:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 00:12:20,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:20,972 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:20,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 00:12:20,972 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:20,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:20,972 INFO L85 PathProgramCache]: Analyzing trace with hash 73555195, now seen corresponding path program 1 times [2025-03-04 00:12:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764471063] [2025-03-04 00:12:20,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:20,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 42 proven. 60 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:21,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:21,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764471063] [2025-03-04 00:12:21,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764471063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:21,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170423267] [2025-03-04 00:12:21,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:21,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:21,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:21,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:21,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:12:21,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:21,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:21,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:21,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:21,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 00:12:21,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-04 00:12:22,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:24,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-04 00:12:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170423267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:24,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:24,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2025-03-04 00:12:24,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538359346] [2025-03-04 00:12:24,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:24,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 00:12:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:24,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 00:12:24,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=947, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 00:12:24,178 INFO L87 Difference]: Start difference. First operand 11267 states and 16846 transitions. Second operand has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) [2025-03-04 00:12:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:27,621 INFO L93 Difference]: Finished difference Result 35666 states and 52776 transitions. [2025-03-04 00:12:27,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-04 00:12:27,621 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) Word has length 254 [2025-03-04 00:12:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:27,672 INFO L225 Difference]: With dead ends: 35666 [2025-03-04 00:12:27,672 INFO L226 Difference]: Without dead ends: 26418 [2025-03-04 00:12:27,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=823, Invalid=3083, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 00:12:27,690 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2186 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 2876 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:27,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 2876 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-04 00:12:27,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26418 states. [2025-03-04 00:12:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26418 to 15435. [2025-03-04 00:12:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15435 states, 14128 states have (on average 1.4734569648924123) internal successors, (20817), 14196 states have internal predecessors, (20817), 1151 states have call successors, (1151), 155 states have call predecessors, (1151), 155 states have return successors, (1151), 1083 states have call predecessors, (1151), 1151 states have call successors, (1151) [2025-03-04 00:12:28,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15435 states to 15435 states and 23119 transitions. [2025-03-04 00:12:28,477 INFO L78 Accepts]: Start accepts. Automaton has 15435 states and 23119 transitions. Word has length 254 [2025-03-04 00:12:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:28,478 INFO L471 AbstractCegarLoop]: Abstraction has 15435 states and 23119 transitions. [2025-03-04 00:12:28,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 6.393939393939394) internal successors, (211), 32 states have internal predecessors, (211), 8 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 8 states have call predecessors, (105), 8 states have call successors, (105) [2025-03-04 00:12:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15435 states and 23119 transitions. [2025-03-04 00:12:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 00:12:28,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:28,493 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:28,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:28,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 00:12:28,694 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:28,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1801231292, now seen corresponding path program 1 times [2025-03-04 00:12:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322390471] [2025-03-04 00:12:28,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:28,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:28,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 2182 trivial. 0 not checked. [2025-03-04 00:12:29,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:29,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322390471] [2025-03-04 00:12:29,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322390471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:29,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273233556] [2025-03-04 00:12:29,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:29,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:29,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:29,481 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:29,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:12:29,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 00:12:29,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 00:12:29,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:29,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:29,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 00:12:29,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:30,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1204 proven. 114 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-04 00:12:30,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2025-03-04 00:12:31,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273233556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:31,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:31,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 25 [2025-03-04 00:12:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138651820] [2025-03-04 00:12:31,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:31,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 00:12:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:31,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 00:12:31,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:12:31,255 INFO L87 Difference]: Start difference. First operand 15435 states and 23119 transitions. Second operand has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-04 00:12:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:45,204 INFO L93 Difference]: Finished difference Result 136429 states and 201783 transitions. [2025-03-04 00:12:45,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-04 00:12:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 254 [2025-03-04 00:12:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:45,477 INFO L225 Difference]: With dead ends: 136429 [2025-03-04 00:12:45,477 INFO L226 Difference]: Without dead ends: 126427 [2025-03-04 00:12:45,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 517 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7130 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4017, Invalid=13275, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 00:12:45,514 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 5087 mSDsluCounter, 3725 mSDsCounter, 0 mSdLazyCounter, 3599 mSolverCounterSat, 1488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5116 SdHoareTripleChecker+Valid, 4195 SdHoareTripleChecker+Invalid, 5087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1488 IncrementalHoareTripleChecker+Valid, 3599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:45,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5116 Valid, 4195 Invalid, 5087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1488 Valid, 3599 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-04 00:12:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126427 states. [2025-03-04 00:12:48,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126427 to 78071. [2025-03-04 00:12:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78071 states, 74126 states have (on average 1.5122089415319862) internal successors, (112094), 74408 states have internal predecessors, (112094), 3419 states have call successors, (3419), 525 states have call predecessors, (3419), 525 states have return successors, (3419), 3137 states have call predecessors, (3419), 3419 states have call successors, (3419) [2025-03-04 00:12:48,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78071 states to 78071 states and 118932 transitions. [2025-03-04 00:12:48,687 INFO L78 Accepts]: Start accepts. Automaton has 78071 states and 118932 transitions. Word has length 254 [2025-03-04 00:12:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 78071 states and 118932 transitions. [2025-03-04 00:12:48,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 7.5) internal successors, (180), 23 states have internal predecessors, (180), 6 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-04 00:12:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 78071 states and 118932 transitions. [2025-03-04 00:12:48,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 00:12:48,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:48,726 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:48,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:12:48,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 00:12:48,930 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:48,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2085227382, now seen corresponding path program 1 times [2025-03-04 00:12:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:48,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977084349] [2025-03-04 00:12:48,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:48,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:12:48,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:12:48,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:48,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:49,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:12:49,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:49,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977084349] [2025-03-04 00:12:49,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977084349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:12:49,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:12:49,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:12:49,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421158809] [2025-03-04 00:12:49,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:12:49,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 00:12:49,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:49,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 00:12:49,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:12:49,417 INFO L87 Difference]: Start difference. First operand 78071 states and 118932 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:12:54,379 INFO L93 Difference]: Finished difference Result 167197 states and 251473 transitions. [2025-03-04 00:12:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:12:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 255 [2025-03-04 00:12:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:12:54,556 INFO L225 Difference]: With dead ends: 167197 [2025-03-04 00:12:54,556 INFO L226 Difference]: Without dead ends: 113083 [2025-03-04 00:12:54,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2025-03-04 00:12:54,627 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1094 mSDsluCounter, 1751 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:12:54,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 2074 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:12:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113083 states. [2025-03-04 00:12:57,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113083 to 79179. [2025-03-04 00:12:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79179 states, 75234 states have (on average 1.5117367147832097) internal successors, (113734), 75516 states have internal predecessors, (113734), 3419 states have call successors, (3419), 525 states have call predecessors, (3419), 525 states have return successors, (3419), 3137 states have call predecessors, (3419), 3419 states have call successors, (3419) [2025-03-04 00:12:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79179 states to 79179 states and 120572 transitions. [2025-03-04 00:12:57,612 INFO L78 Accepts]: Start accepts. Automaton has 79179 states and 120572 transitions. Word has length 255 [2025-03-04 00:12:57,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:12:57,612 INFO L471 AbstractCegarLoop]: Abstraction has 79179 states and 120572 transitions. [2025-03-04 00:12:57,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:12:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 79179 states and 120572 transitions. [2025-03-04 00:12:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-04 00:12:57,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:12:57,649 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:12:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 00:12:57,649 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:12:57,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:12:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash 334953427, now seen corresponding path program 1 times [2025-03-04 00:12:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:12:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656182942] [2025-03-04 00:12:57,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:12:57,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:12:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:12:57,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:57,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:12:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656182942] [2025-03-04 00:12:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656182942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:12:57,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275576384] [2025-03-04 00:12:57,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:12:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:12:57,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:12:57,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:12:57,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:12:58,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-04 00:12:58,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-04 00:12:58,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:12:58,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:12:58,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 619 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 00:12:58,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:12:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1152 proven. 63 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2025-03-04 00:12:58,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:12:58,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 39 proven. 63 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2025-03-04 00:12:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275576384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:12:58,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:12:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2025-03-04 00:12:58,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047495310] [2025-03-04 00:12:58,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:12:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:12:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:12:58,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:12:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:12:58,818 INFO L87 Difference]: Start difference. First operand 79179 states and 120572 transitions. Second operand has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-04 00:13:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:13:06,769 INFO L93 Difference]: Finished difference Result 235852 states and 359476 transitions. [2025-03-04 00:13:06,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 00:13:06,769 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) Word has length 255 [2025-03-04 00:13:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:13:07,050 INFO L225 Difference]: With dead ends: 235852 [2025-03-04 00:13:07,050 INFO L226 Difference]: Without dead ends: 169835 [2025-03-04 00:13:07,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 532 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=744, Unknown=0, NotChecked=0, Total=992 [2025-03-04 00:13:07,110 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 726 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 1675 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:13:07,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 3375 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1675 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:13:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169835 states. [2025-03-04 00:13:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169835 to 118523. [2025-03-04 00:13:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118523 states, 111334 states have (on average 1.5052903874827097) internal successors, (167590), 111844 states have internal predecessors, (167590), 6164 states have call successors, (6164), 1024 states have call predecessors, (6164), 1024 states have return successors, (6164), 5654 states have call predecessors, (6164), 6164 states have call successors, (6164) [2025-03-04 00:13:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118523 states to 118523 states and 179918 transitions. [2025-03-04 00:13:12,654 INFO L78 Accepts]: Start accepts. Automaton has 118523 states and 179918 transitions. Word has length 255 [2025-03-04 00:13:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:13:12,654 INFO L471 AbstractCegarLoop]: Abstraction has 118523 states and 179918 transitions. [2025-03-04 00:13:12,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 8.263157894736842) internal successors, (157), 19 states have internal predecessors, (157), 6 states have call successors, (105), 3 states have call predecessors, (105), 6 states have return successors, (105), 6 states have call predecessors, (105), 6 states have call successors, (105) [2025-03-04 00:13:12,654 INFO L276 IsEmpty]: Start isEmpty. Operand 118523 states and 179918 transitions. [2025-03-04 00:13:12,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-04 00:13:12,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:13:12,691 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:13:12,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:13:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:13:12,891 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:13:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:13:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash 488981856, now seen corresponding path program 1 times [2025-03-04 00:13:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:13:12,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102691001] [2025-03-04 00:13:12,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:13:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:13:12,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-04 00:13:12,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-04 00:13:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:13:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:13:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2025-03-04 00:13:13,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:13:13,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102691001] [2025-03-04 00:13:13,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102691001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:13:13,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:13:13,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:13:13,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350902800] [2025-03-04 00:13:13,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:13:13,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:13:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:13:13,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:13:13,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:13:13,204 INFO L87 Difference]: Start difference. First operand 118523 states and 179918 transitions. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35)