./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 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-8fc3dc6-m [2025-03-17 04:30:02,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:30:02,441 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:30:02,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:30:02,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:30:02,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:30:02,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:30:02,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:30:02,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:30:02,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:30:02,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:30:02,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:30:02,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:30:02,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:30:02,476 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:30:02,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:30:02,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:30:02,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:30:02,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:30:02,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:30:02,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:30:02,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:30:02,479 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-17 04:30:02,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:30:02,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:30:02,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:30:02,713 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:30:02,713 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:30:02,714 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-17 04:30:03,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e78538/93c13a0cf385467d905b7e29b324dfe3/FLAG0a1c91057 [2025-03-17 04:30:04,153 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:30:04,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-5.i [2025-03-17 04:30:04,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e78538/93c13a0cf385467d905b7e29b324dfe3/FLAG0a1c91057 [2025-03-17 04:30:04,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff7e78538/93c13a0cf385467d905b7e29b324dfe3 [2025-03-17 04:30:04,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:30:04,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:30:04,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:30:04,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:30:04,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:30:04,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2252ebdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04, skipping insertion in model container [2025-03-17 04:30:04,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:30:04,537 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-17 04:30:04,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:30:04,695 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:30:04,702 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-17 04:30:04,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:30:04,778 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:30:04,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04 WrapperNode [2025-03-17 04:30:04,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:30:04,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:30:04,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:30:04,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:30:04,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,848 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2025-03-17 04:30:04,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:30:04,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:30:04,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:30:04,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:30:04,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,872 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,912 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:30:04,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,948 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:30:04,981 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:30:04,982 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:30:04,982 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:30:04,983 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (1/1) ... [2025-03-17 04:30:04,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:30:04,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:05,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:30:05,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:30:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:30:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:30:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:30:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:30:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:30:05,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:30:05,114 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:30:05,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:30:05,729 INFO L1322 $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-17 04:30:05,810 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-03-17 04:30:05,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:30:05,839 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:30:05,840 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:30:05,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:30:05 BoogieIcfgContainer [2025-03-17 04:30:05,841 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:30:05,842 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:30:05,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:30:05,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:30:05,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:30:04" (1/3) ... [2025-03-17 04:30:05,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36912be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:30:05, skipping insertion in model container [2025-03-17 04:30:05,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:30:04" (2/3) ... [2025-03-17 04:30:05,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36912be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:30:05, skipping insertion in model container [2025-03-17 04:30:05,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:30:05" (3/3) ... [2025-03-17 04:30:05,849 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-5.i [2025-03-17 04:30:05,862 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:30:05,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-5.i that has 2 procedures, 164 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:30:05,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:30:05,929 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;@548226dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:30:05,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:30:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 127 states have internal predecessors, (196), 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-17 04:30:05,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-17 04:30:05,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:05,951 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] [2025-03-17 04:30:05,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:05,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1101866462, now seen corresponding path program 1 times [2025-03-17 04:30:05,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:05,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509120464] [2025-03-17 04:30:05,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:05,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:06,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 04:30:06,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 04:30:06,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:06,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:06,308 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-17 04:30:06,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:06,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509120464] [2025-03-17 04:30:06,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509120464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:06,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902185227] [2025-03-17 04:30:06,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:06,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:06,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:06,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:30:06,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:30:06,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 04:30:06,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 04:30:06,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:06,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:06,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:30:06,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:06,580 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-17 04:30:06,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:30:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902185227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:30:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:30:06,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891288662] [2025-03-17 04:30:06,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:06,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:30:06,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:06,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:30:06,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:30:06,603 INFO L87 Difference]: Start difference. First operand has 164 states, 126 states have (on average 1.5555555555555556) internal successors, (196), 127 states have internal predecessors, (196), 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 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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-17 04:30:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:06,645 INFO L93 Difference]: Finished difference Result 325 states and 565 transitions. [2025-03-17 04:30:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:30:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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 246 [2025-03-17 04:30:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:06,652 INFO L225 Difference]: With dead ends: 325 [2025-03-17 04:30:06,652 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 04:30:06,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:30:06,657 INFO L435 NwaCegarLoop]: 252 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, 252 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-17 04:30:06,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:30:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 04:30:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-03-17 04:30:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 125 states have (on average 1.52) internal successors, (190), 125 states have internal predecessors, (190), 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-17 04:30:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 260 transitions. [2025-03-17 04:30:06,696 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 260 transitions. Word has length 246 [2025-03-17 04:30:06,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:06,696 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 260 transitions. [2025-03-17 04:30:06,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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-17 04:30:06,697 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 260 transitions. [2025-03-17 04:30:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-17 04:30:06,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:06,700 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] [2025-03-17 04:30:06,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:30:06,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:30:06,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:06,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:06,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2021470959, now seen corresponding path program 1 times [2025-03-17 04:30:06,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:06,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194466422] [2025-03-17 04:30:06,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:06,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:06,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 04:30:07,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 04:30:07,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:07,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:07,579 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-17 04:30:07,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:07,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194466422] [2025-03-17 04:30:07,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194466422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:07,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:07,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:30:07,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681606730] [2025-03-17 04:30:07,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:07,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:30:07,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:07,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:30:07,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:07,583 INFO L87 Difference]: Start difference. First operand 162 states and 260 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-17 04:30:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:07,953 INFO L93 Difference]: Finished difference Result 543 states and 880 transitions. [2025-03-17 04:30:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:30:07,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 246 [2025-03-17 04:30:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:07,958 INFO L225 Difference]: With dead ends: 543 [2025-03-17 04:30:07,961 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 04:30:07,962 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-17 04:30:07,964 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 289 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 1063 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-17 04:30:07,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 1063 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:30:07,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 04:30:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 239. [2025-03-17 04:30:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 166 states have (on average 1.4457831325301205) internal successors, (240), 166 states have internal predecessors, (240), 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-17 04:30:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 380 transitions. [2025-03-17 04:30:07,999 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 380 transitions. Word has length 246 [2025-03-17 04:30:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:08,000 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 380 transitions. [2025-03-17 04:30:08,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-17 04:30:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 380 transitions. [2025-03-17 04:30:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-17 04:30:08,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:08,005 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] [2025-03-17 04:30:08,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:30:08,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:08,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 930396084, now seen corresponding path program 1 times [2025-03-17 04:30:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:08,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792776567] [2025-03-17 04:30:08,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:08,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 04:30:08,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 04:30:08,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:08,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:08,712 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-17 04:30:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792776567] [2025-03-17 04:30:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792776567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:30:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755355598] [2025-03-17 04:30:08,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:30:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:08,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:30:08,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:30:08,717 INFO L87 Difference]: Start difference. First operand 239 states and 380 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-17 04:30:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:09,511 INFO L93 Difference]: Finished difference Result 563 states and 902 transitions. [2025-03-17 04:30:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:30:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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 246 [2025-03-17 04:30:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:09,514 INFO L225 Difference]: With dead ends: 563 [2025-03-17 04:30:09,517 INFO L226 Difference]: Without dead ends: 402 [2025-03-17 04:30:09,518 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-17 04:30:09,518 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 540 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:09,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 1566 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:30:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-17 04:30:09,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 339. [2025-03-17 04:30:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.5225563909774436) internal successors, (405), 266 states have internal predecessors, (405), 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-17 04:30:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 545 transitions. [2025-03-17 04:30:09,552 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 545 transitions. Word has length 246 [2025-03-17 04:30:09,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:09,553 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 545 transitions. [2025-03-17 04:30:09,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 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-17 04:30:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 545 transitions. [2025-03-17 04:30:09,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-17 04:30:09,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:09,555 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] [2025-03-17 04:30:09,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:30:09,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:09,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:09,556 INFO L85 PathProgramCache]: Analyzing trace with hash 464519901, now seen corresponding path program 1 times [2025-03-17 04:30:09,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:09,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440862048] [2025-03-17 04:30:09,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:09,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:09,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-17 04:30:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-17 04:30:09,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:09,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:10,006 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-17 04:30:10,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:10,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440862048] [2025-03-17 04:30:10,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440862048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:10,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:10,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:30:10,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023986344] [2025-03-17 04:30:10,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:10,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:30:10,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:10,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:30:10,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:30:10,008 INFO L87 Difference]: Start difference. First operand 339 states and 545 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-17 04:30:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:10,331 INFO L93 Difference]: Finished difference Result 962 states and 1555 transitions. [2025-03-17 04:30:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:30:10,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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 247 [2025-03-17 04:30:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:10,338 INFO L225 Difference]: With dead ends: 962 [2025-03-17 04:30:10,339 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 04:30:10,340 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-17 04:30:10,341 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 341 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 829 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.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:10,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 829 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:30:10,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 04:30:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 598. [2025-03-17 04:30:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 489 states have (on average 1.5357873210633948) internal successors, (751), 489 states have internal predecessors, (751), 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-17 04:30:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 961 transitions. [2025-03-17 04:30:10,385 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 961 transitions. Word has length 247 [2025-03-17 04:30:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:10,386 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 961 transitions. [2025-03-17 04:30:10,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-17 04:30:10,386 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 961 transitions. [2025-03-17 04:30:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 04:30:10,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:10,389 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] [2025-03-17 04:30:10,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:30:10,389 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:10,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1819010222, now seen corresponding path program 1 times [2025-03-17 04:30:10,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:10,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813715265] [2025-03-17 04:30:10,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:10,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 04:30:10,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 04:30:10,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:10,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:10,970 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-17 04:30:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813715265] [2025-03-17 04:30:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813715265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:10,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:10,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:30:10,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158902355] [2025-03-17 04:30:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:10,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:30:10,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:10,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:30:10,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:30:10,973 INFO L87 Difference]: Start difference. First operand 598 states and 961 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-17 04:30:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:11,621 INFO L93 Difference]: Finished difference Result 1395 states and 2236 transitions. [2025-03-17 04:30:11,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:30:11,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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 248 [2025-03-17 04:30:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:11,629 INFO L225 Difference]: With dead ends: 1395 [2025-03-17 04:30:11,629 INFO L226 Difference]: Without dead ends: 1014 [2025-03-17 04:30:11,630 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-17 04:30:11,632 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 957 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:11,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1254 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:30:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-03-17 04:30:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 724. [2025-03-17 04:30:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 615 states have (on average 1.559349593495935) internal successors, (959), 615 states have internal predecessors, (959), 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-17 04:30:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1169 transitions. [2025-03-17 04:30:11,690 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1169 transitions. Word has length 248 [2025-03-17 04:30:11,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:11,691 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 1169 transitions. [2025-03-17 04:30:11,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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-17 04:30:11,691 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1169 transitions. [2025-03-17 04:30:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-17 04:30:11,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:11,693 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] [2025-03-17 04:30:11,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:30:11,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:11,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:11,694 INFO L85 PathProgramCache]: Analyzing trace with hash -741339708, now seen corresponding path program 1 times [2025-03-17 04:30:11,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:11,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531521762] [2025-03-17 04:30:11,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:11,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:11,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 04:30:11,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 04:30:11,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:11,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:12,151 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-17 04:30:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531521762] [2025-03-17 04:30:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531521762] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:12,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:12,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:30:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760404852] [2025-03-17 04:30:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:12,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:30:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:12,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:30:12,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:30:12,154 INFO L87 Difference]: Start difference. First operand 724 states and 1169 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 04:30:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:12,434 INFO L93 Difference]: Finished difference Result 2164 states and 3488 transitions. [2025-03-17 04:30:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:30:12,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 248 [2025-03-17 04:30:12,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:12,442 INFO L225 Difference]: With dead ends: 2164 [2025-03-17 04:30:12,442 INFO L226 Difference]: Without dead ends: 1759 [2025-03-17 04:30:12,443 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-17 04:30:12,443 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 498 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:12,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 613 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:30:12,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2025-03-17 04:30:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1470. [2025-03-17 04:30:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1323 states have (on average 1.5857898715041572) internal successors, (2098), 1325 states have internal predecessors, (2098), 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-17 04:30:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 2380 transitions. [2025-03-17 04:30:12,507 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 2380 transitions. Word has length 248 [2025-03-17 04:30:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 2380 transitions. [2025-03-17 04:30:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 04:30:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 2380 transitions. [2025-03-17 04:30:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-17 04:30:12,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:12,511 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-17 04:30:12,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:30:12,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:12,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1411228578, now seen corresponding path program 1 times [2025-03-17 04:30:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:12,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920468427] [2025-03-17 04:30:12,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:12,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 04:30:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 04:30:12,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:12,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:13,078 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-17 04:30:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920468427] [2025-03-17 04:30:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920468427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355764190] [2025-03-17 04:30:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:13,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:13,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:13,080 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-17 04:30:13,082 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-17 04:30:13,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-17 04:30:13,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-17 04:30:13,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:13,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:13,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:30:13,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:13,437 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-17 04:30:13,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:30:13,683 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-17 04:30:13,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355764190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:30:13,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:30:13,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-17 04:30:13,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462928098] [2025-03-17 04:30:13,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:30:13,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:30:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:13,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:30:13,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:30:13,686 INFO L87 Difference]: Start difference. First operand 1470 states and 2380 transitions. Second operand has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 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-17 04:30:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:14,465 INFO L93 Difference]: Finished difference Result 2946 states and 4728 transitions. [2025-03-17 04:30:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 04:30:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 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 249 [2025-03-17 04:30:14,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:14,473 INFO L225 Difference]: With dead ends: 2946 [2025-03-17 04:30:14,473 INFO L226 Difference]: Without dead ends: 1546 [2025-03-17 04:30:14,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 495 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-17 04:30:14,476 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 1139 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:14,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 1397 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:30:14,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2025-03-17 04:30:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1297. [2025-03-17 04:30:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1108 states have (on average 1.532490974729242) internal successors, (1698), 1108 states have internal predecessors, (1698), 175 states have call successors, (175), 13 states have call predecessors, (175), 13 states have return successors, (175), 175 states have call predecessors, (175), 175 states have call successors, (175) [2025-03-17 04:30:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 2048 transitions. [2025-03-17 04:30:14,549 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 2048 transitions. Word has length 249 [2025-03-17 04:30:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:14,550 INFO L471 AbstractCegarLoop]: Abstraction has 1297 states and 2048 transitions. [2025-03-17 04:30:14,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.727272727272727) internal successors, (129), 11 states have internal predecessors, (129), 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-17 04:30:14,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 2048 transitions. [2025-03-17 04:30:14,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:14,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:14,553 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-17 04:30:14,561 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-17 04:30:14,758 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,SelfDestructingSolverStorable6 [2025-03-17 04:30:14,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:14,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -993168226, now seen corresponding path program 1 times [2025-03-17 04:30:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:14,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076070442] [2025-03-17 04:30:14,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:14,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:14,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:14,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:14,919 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-17 04:30:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076070442] [2025-03-17 04:30:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076070442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:14,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:14,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:30:14,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100771542] [2025-03-17 04:30:14,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:14,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:30:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:14,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:30:14,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:14,921 INFO L87 Difference]: Start difference. First operand 1297 states and 2048 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-17 04:30:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:15,003 INFO L93 Difference]: Finished difference Result 2437 states and 3817 transitions. [2025-03-17 04:30:15,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:30:15,004 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-17 04:30:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:15,011 INFO L225 Difference]: With dead ends: 2437 [2025-03-17 04:30:15,011 INFO L226 Difference]: Without dead ends: 1563 [2025-03-17 04:30:15,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:15,014 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 62 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:15,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 460 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:30:15,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2025-03-17 04:30:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1557. [2025-03-17 04:30:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1343 states have (on average 1.5197319434102754) internal successors, (2041), 1347 states have internal predecessors, (2041), 195 states have call successors, (195), 18 states have call predecessors, (195), 18 states have return successors, (195), 191 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-17 04:30:15,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2431 transitions. [2025-03-17 04:30:15,071 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2431 transitions. Word has length 251 [2025-03-17 04:30:15,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:15,071 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2431 transitions. [2025-03-17 04:30:15,072 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-17 04:30:15,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2431 transitions. [2025-03-17 04:30:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:15,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:15,074 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-17 04:30:15,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:30:15,074 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:15,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash -163020929, now seen corresponding path program 1 times [2025-03-17 04:30:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:15,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076291230] [2025-03-17 04:30:15,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:15,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:15,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:15,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:15,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:16,063 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-17 04:30:16,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076291230] [2025-03-17 04:30:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076291230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:30:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789535442] [2025-03-17 04:30:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:30:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:16,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:30:16,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:30:16,066 INFO L87 Difference]: Start difference. First operand 1557 states and 2431 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:17,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:17,223 INFO L93 Difference]: Finished difference Result 6799 states and 10382 transitions. [2025-03-17 04:30:17,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:30:17,224 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:17,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:17,247 INFO L225 Difference]: With dead ends: 6799 [2025-03-17 04:30:17,247 INFO L226 Difference]: Without dead ends: 5589 [2025-03-17 04:30:17,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:30:17,251 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 923 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:17,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1628 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:30:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5589 states. [2025-03-17 04:30:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5589 to 4503. [2025-03-17 04:30:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 3910 states have (on average 1.4864450127877238) internal successors, (5812), 3938 states have internal predecessors, (5812), 539 states have call successors, (539), 53 states have call predecessors, (539), 53 states have return successors, (539), 511 states have call predecessors, (539), 539 states have call successors, (539) [2025-03-17 04:30:17,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 6890 transitions. [2025-03-17 04:30:17,459 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 6890 transitions. Word has length 251 [2025-03-17 04:30:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:17,461 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 6890 transitions. [2025-03-17 04:30:17,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 6890 transitions. [2025-03-17 04:30:17,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:17,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:17,465 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-17 04:30:17,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:30:17,466 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:17,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1300598270, now seen corresponding path program 1 times [2025-03-17 04:30:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:17,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104413600] [2025-03-17 04:30:17,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:17,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:17,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:17,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:17,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:18,176 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-17 04:30:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104413600] [2025-03-17 04:30:18,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104413600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:18,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175685330] [2025-03-17 04:30:18,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:18,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:18,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:18,179 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-17 04:30:18,181 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-17 04:30:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:18,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:18,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:18,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:18,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 04:30:18,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:18,581 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-17 04:30:18,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:30:18,872 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-17 04:30:18,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175685330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:30:18,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:30:18,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2025-03-17 04:30:18,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865409727] [2025-03-17 04:30:18,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:30:18,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 04:30:18,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:18,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 04:30:18,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-17 04:30:18,875 INFO L87 Difference]: Start difference. First operand 4503 states and 6890 transitions. Second operand has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 18 states have internal predecessors, (149), 5 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) [2025-03-17 04:30:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:21,262 INFO L93 Difference]: Finished difference Result 15002 states and 22395 transitions. [2025-03-17 04:30:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-17 04:30:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 18 states have internal predecessors, (149), 5 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) Word has length 251 [2025-03-17 04:30:21,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:21,312 INFO L225 Difference]: With dead ends: 15002 [2025-03-17 04:30:21,312 INFO L226 Difference]: Without dead ends: 11056 [2025-03-17 04:30:21,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 497 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=556, Invalid=2200, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 04:30:21,324 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 3220 mSDsluCounter, 1883 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3264 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:21,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3264 Valid, 2079 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:30:21,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11056 states. [2025-03-17 04:30:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11056 to 6934. [2025-03-17 04:30:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6934 states, 6106 states have (on average 1.481329839502129) internal successors, (9045), 6150 states have internal predecessors, (9045), 739 states have call successors, (739), 88 states have call predecessors, (739), 88 states have return successors, (739), 695 states have call predecessors, (739), 739 states have call successors, (739) [2025-03-17 04:30:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 10523 transitions. [2025-03-17 04:30:21,654 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 10523 transitions. Word has length 251 [2025-03-17 04:30:21,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:21,654 INFO L471 AbstractCegarLoop]: Abstraction has 6934 states and 10523 transitions. [2025-03-17 04:30:21,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.277777777777779) internal successors, (149), 18 states have internal predecessors, (149), 5 states have call successors, (82), 2 states have call predecessors, (82), 4 states have return successors, (83), 5 states have call predecessors, (83), 5 states have call successors, (83) [2025-03-17 04:30:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 10523 transitions. [2025-03-17 04:30:21,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:21,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:21,661 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-17 04:30:21,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 04:30:21,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:21,862 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:21,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:21,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2011757311, now seen corresponding path program 1 times [2025-03-17 04:30:21,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:21,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496449825] [2025-03-17 04:30:21,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:21,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:21,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:21,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:21,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:22,316 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-17 04:30:22,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:22,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496449825] [2025-03-17 04:30:22,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496449825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:22,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:22,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:30:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032201921] [2025-03-17 04:30:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:22,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:30:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:22,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:30:22,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:30:22,318 INFO L87 Difference]: Start difference. First operand 6934 states and 10523 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-17 04:30:23,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:23,043 INFO L93 Difference]: Finished difference Result 20036 states and 29885 transitions. [2025-03-17 04:30:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:30:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-17 04:30:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:23,081 INFO L225 Difference]: With dead ends: 20036 [2025-03-17 04:30:23,082 INFO L226 Difference]: Without dead ends: 14080 [2025-03-17 04:30:23,097 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-17 04:30:23,099 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 601 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:23,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 1070 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:30:23,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14080 states. [2025-03-17 04:30:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14080 to 9598. [2025-03-17 04:30:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9598 states, 8668 states have (on average 1.493885556068297) internal successors, (12949), 8720 states have internal predecessors, (12949), 831 states have call successors, (831), 98 states have call predecessors, (831), 98 states have return successors, (831), 779 states have call predecessors, (831), 831 states have call successors, (831) [2025-03-17 04:30:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9598 states to 9598 states and 14611 transitions. [2025-03-17 04:30:23,569 INFO L78 Accepts]: Start accepts. Automaton has 9598 states and 14611 transitions. Word has length 251 [2025-03-17 04:30:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 9598 states and 14611 transitions. [2025-03-17 04:30:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 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-17 04:30:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 9598 states and 14611 transitions. [2025-03-17 04:30:23,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:23,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:23,579 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-17 04:30:23,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:30:23,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:23,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1271229529, now seen corresponding path program 1 times [2025-03-17 04:30:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842003735] [2025-03-17 04:30:23,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:23,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:23,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:23,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:23,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:23,666 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-17 04:30:23,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:23,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842003735] [2025-03-17 04:30:23,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842003735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:23,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:23,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:30:23,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182840146] [2025-03-17 04:30:23,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:23,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:30:23,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:23,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:30:23,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:23,667 INFO L87 Difference]: Start difference. First operand 9598 states and 14611 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-17 04:30:24,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:24,050 INFO L93 Difference]: Finished difference Result 16012 states and 24159 transitions. [2025-03-17 04:30:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:30:24,056 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-17 04:30:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:24,089 INFO L225 Difference]: With dead ends: 16012 [2025-03-17 04:30:24,090 INFO L226 Difference]: Without dead ends: 9964 [2025-03-17 04:30:24,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:30:24,104 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 215 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 499 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-17 04:30:24,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 499 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:30:24,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9964 states. [2025-03-17 04:30:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9964 to 8356. [2025-03-17 04:30:24,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8356 states, 7366 states have (on average 1.4747488460494163) internal successors, (10863), 7418 states have internal predecessors, (10863), 883 states have call successors, (883), 106 states have call predecessors, (883), 106 states have return successors, (883), 831 states have call predecessors, (883), 883 states have call successors, (883) [2025-03-17 04:30:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 12629 transitions. [2025-03-17 04:30:24,613 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 12629 transitions. Word has length 251 [2025-03-17 04:30:24,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:24,615 INFO L471 AbstractCegarLoop]: Abstraction has 8356 states and 12629 transitions. [2025-03-17 04:30:24,615 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-17 04:30:24,615 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 12629 transitions. [2025-03-17 04:30:24,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:24,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:24,624 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-17 04:30:24,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:30:24,624 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:24,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1226786408, now seen corresponding path program 1 times [2025-03-17 04:30:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:24,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850855426] [2025-03-17 04:30:24,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:24,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:24,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:24,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:24,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:25,009 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-17 04:30:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:25,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850855426] [2025-03-17 04:30:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850855426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:30:25,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57059114] [2025-03-17 04:30:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:25,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:30:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:25,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:30:25,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:30:25,012 INFO L87 Difference]: Start difference. First operand 8356 states and 12629 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-17 04:30:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:25,924 INFO L93 Difference]: Finished difference Result 18582 states and 27819 transitions. [2025-03-17 04:30:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:30:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-17 04:30:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:25,963 INFO L225 Difference]: With dead ends: 18582 [2025-03-17 04:30:25,964 INFO L226 Difference]: Without dead ends: 12564 [2025-03-17 04:30:25,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-17 04:30:25,979 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 555 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:25,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1384 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:30:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12564 states. [2025-03-17 04:30:26,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12564 to 10834. [2025-03-17 04:30:26,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10834 states, 9378 states have (on average 1.4417786308381317) internal successors, (13521), 9454 states have internal predecessors, (13521), 1295 states have call successors, (1295), 160 states have call predecessors, (1295), 160 states have return successors, (1295), 1219 states have call predecessors, (1295), 1295 states have call successors, (1295) [2025-03-17 04:30:26,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10834 states to 10834 states and 16111 transitions. [2025-03-17 04:30:26,496 INFO L78 Accepts]: Start accepts. Automaton has 10834 states and 16111 transitions. Word has length 251 [2025-03-17 04:30:26,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:26,496 INFO L471 AbstractCegarLoop]: Abstraction has 10834 states and 16111 transitions. [2025-03-17 04:30:26,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-17 04:30:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 10834 states and 16111 transitions. [2025-03-17 04:30:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:26,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:26,506 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-17 04:30:26,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:30:26,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:26,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:26,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1254131134, now seen corresponding path program 1 times [2025-03-17 04:30:26,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:26,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775991351] [2025-03-17 04:30:26,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:26,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:26,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:26,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:26,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:26,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:26,780 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-17 04:30:26,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:26,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775991351] [2025-03-17 04:30:26,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775991351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:26,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:26,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:30:26,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482543368] [2025-03-17 04:30:26,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:26,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:30:26,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:26,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:30:26,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:30:26,782 INFO L87 Difference]: Start difference. First operand 10834 states and 16111 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:27,714 INFO L93 Difference]: Finished difference Result 20692 states and 30479 transitions. [2025-03-17 04:30:27,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 04:30:27,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:27,750 INFO L225 Difference]: With dead ends: 20692 [2025-03-17 04:30:27,750 INFO L226 Difference]: Without dead ends: 12118 [2025-03-17 04:30:27,767 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-17 04:30:27,767 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 272 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1361 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:27,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1361 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:30:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12118 states. [2025-03-17 04:30:28,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12118 to 10834. [2025-03-17 04:30:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10834 states, 9378 states have (on average 1.4417786308381317) internal successors, (13521), 9454 states have internal predecessors, (13521), 1295 states have call successors, (1295), 160 states have call predecessors, (1295), 160 states have return successors, (1295), 1219 states have call predecessors, (1295), 1295 states have call successors, (1295) [2025-03-17 04:30:28,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10834 states to 10834 states and 16111 transitions. [2025-03-17 04:30:28,365 INFO L78 Accepts]: Start accepts. Automaton has 10834 states and 16111 transitions. Word has length 251 [2025-03-17 04:30:28,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:28,365 INFO L471 AbstractCegarLoop]: Abstraction has 10834 states and 16111 transitions. [2025-03-17 04:30:28,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 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-17 04:30:28,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10834 states and 16111 transitions. [2025-03-17 04:30:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-17 04:30:28,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:28,375 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-17 04:30:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:30:28,375 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:28,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:28,376 INFO L85 PathProgramCache]: Analyzing trace with hash -645658679, now seen corresponding path program 1 times [2025-03-17 04:30:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109324664] [2025-03-17 04:30:28,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:28,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:28,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:28,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:28,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:29,342 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-17 04:30:29,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109324664] [2025-03-17 04:30:29,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109324664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:29,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452482355] [2025-03-17 04:30:29,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:29,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:29,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:29,345 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-17 04:30:29,347 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-17 04:30:29,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-17 04:30:29,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-17 04:30:29,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:29,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:29,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 04:30:29,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:30,394 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-17 04:30:30,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:30:31,600 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-17 04:30:31,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452482355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:30:31,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:30:31,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2025-03-17 04:30:31,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517648361] [2025-03-17 04:30:31,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:30:31,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 04:30:31,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:31,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 04:30:31,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2025-03-17 04:30:31,603 INFO L87 Difference]: Start difference. First operand 10834 states and 16111 transitions. Second operand has 26 states, 25 states have (on average 7.52) internal successors, (188), 24 states have internal predecessors, (188), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-03-17 04:30:43,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:43,082 INFO L93 Difference]: Finished difference Result 118043 states and 172539 transitions. [2025-03-17 04:30:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-17 04:30:43,083 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 7.52) internal successors, (188), 24 states have internal predecessors, (188), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) Word has length 251 [2025-03-17 04:30:43,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:43,383 INFO L225 Difference]: With dead ends: 118043 [2025-03-17 04:30:43,383 INFO L226 Difference]: Without dead ends: 108777 [2025-03-17 04:30:43,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 510 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6715 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3752, Invalid=12760, Unknown=0, NotChecked=0, Total=16512 [2025-03-17 04:30:43,425 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 4314 mSDsluCounter, 4383 mSDsCounter, 0 mSdLazyCounter, 4125 mSolverCounterSat, 1170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4343 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 5295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1170 IncrementalHoareTripleChecker+Valid, 4125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:43,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4343 Valid, 4839 Invalid, 5295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1170 Valid, 4125 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-17 04:30:43,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108777 states. [2025-03-17 04:30:46,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108777 to 67721. [2025-03-17 04:30:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67721 states, 63328 states have (on average 1.4885200859019707) internal successors, (94265), 63642 states have internal predecessors, (94265), 3825 states have call successors, (3825), 567 states have call predecessors, (3825), 567 states have return successors, (3825), 3511 states have call predecessors, (3825), 3825 states have call successors, (3825) [2025-03-17 04:30:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67721 states to 67721 states and 101915 transitions. [2025-03-17 04:30:46,533 INFO L78 Accepts]: Start accepts. Automaton has 67721 states and 101915 transitions. Word has length 251 [2025-03-17 04:30:46,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:46,534 INFO L471 AbstractCegarLoop]: Abstraction has 67721 states and 101915 transitions. [2025-03-17 04:30:46,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 7.52) internal successors, (188), 24 states have internal predecessors, (188), 7 states have call successors, (105), 4 states have call predecessors, (105), 8 states have return successors, (105), 7 states have call predecessors, (105), 7 states have call successors, (105) [2025-03-17 04:30:46,535 INFO L276 IsEmpty]: Start isEmpty. Operand 67721 states and 101915 transitions. [2025-03-17 04:30:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-17 04:30:46,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:46,570 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-17 04:30:46,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 04:30:46,771 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,SelfDestructingSolverStorable14 [2025-03-17 04:30:46,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1636363461, now seen corresponding path program 1 times [2025-03-17 04:30:46,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:46,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922394824] [2025-03-17 04:30:46,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:46,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:46,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 04:30:46,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 04:30:46,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:46,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:47,390 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-17 04:30:47,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:47,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922394824] [2025-03-17 04:30:47,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922394824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:30:47,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:30:47,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 04:30:47,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595594973] [2025-03-17 04:30:47,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:30:47,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 04:30:47,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:47,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 04:30:47,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:30:47,392 INFO L87 Difference]: Start difference. First operand 67721 states and 101915 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-17 04:30:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:30:50,551 INFO L93 Difference]: Finished difference Result 139198 states and 207967 transitions. [2025-03-17 04:30:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:30:50,551 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-17 04:30:50,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:30:50,724 INFO L225 Difference]: With dead ends: 139198 [2025-03-17 04:30:50,725 INFO L226 Difference]: Without dead ends: 86729 [2025-03-17 04:30:50,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2025-03-17 04:30:50,783 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 929 mSDsluCounter, 1427 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:30:50,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1672 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:30:50,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86729 states. [2025-03-17 04:30:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86729 to 68918. [2025-03-17 04:30:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68918 states, 64524 states have (on average 1.4890583348831443) internal successors, (96080), 64838 states have internal predecessors, (96080), 3825 states have call successors, (3825), 568 states have call predecessors, (3825), 568 states have return successors, (3825), 3511 states have call predecessors, (3825), 3825 states have call successors, (3825) [2025-03-17 04:30:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68918 states to 68918 states and 103730 transitions. [2025-03-17 04:30:53,755 INFO L78 Accepts]: Start accepts. Automaton has 68918 states and 103730 transitions. Word has length 252 [2025-03-17 04:30:53,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:30:53,756 INFO L471 AbstractCegarLoop]: Abstraction has 68918 states and 103730 transitions. [2025-03-17 04:30:53,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 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-17 04:30:53,756 INFO L276 IsEmpty]: Start isEmpty. Operand 68918 states and 103730 transitions. [2025-03-17 04:30:53,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-17 04:30:53,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:30:53,791 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-17 04:30:53,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 04:30:53,791 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:30:53,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:30:53,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1225196173, now seen corresponding path program 1 times [2025-03-17 04:30:53,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:30:53,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853220171] [2025-03-17 04:30:53,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:53,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:30:53,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 04:30:53,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 04:30:53,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:53,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:54,117 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-17 04:30:54,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:30:54,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853220171] [2025-03-17 04:30:54,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853220171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:30:54,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728100415] [2025-03-17 04:30:54,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:30:54,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:30:54,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:30:54,121 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-17 04:30:54,123 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-17 04:30:54,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 04:30:54,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 04:30:54,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:30:54,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:30:54,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 04:30:54,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:30:54,717 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-17 04:30:54,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:30:55,084 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-17 04:30:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728100415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:30:55,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:30:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 19 [2025-03-17 04:30:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487848110] [2025-03-17 04:30:55,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:30:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 04:30:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:30:55,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 04:30:55,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:30:55,086 INFO L87 Difference]: Start difference. First operand 68918 states and 103730 transitions. Second operand has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 19 states have internal predecessors, (150), 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-17 04:31:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:01,061 INFO L93 Difference]: Finished difference Result 215346 states and 324032 transitions. [2025-03-17 04:31:01,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 04:31:01,062 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 19 states have internal predecessors, (150), 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 252 [2025-03-17 04:31:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:01,376 INFO L225 Difference]: With dead ends: 215346 [2025-03-17 04:31:01,377 INFO L226 Difference]: Without dead ends: 154570 [2025-03-17 04:31:01,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 496 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-17 04:31:01,438 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 1979 mSDsluCounter, 2553 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2012 SdHoareTripleChecker+Valid, 2980 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:01,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2012 Valid, 2980 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 04:31:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154570 states. [2025-03-17 04:31:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154570 to 108126. [2025-03-17 04:31:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108126 states, 100114 states have (on average 1.4809816808837926) internal successors, (148267), 100682 states have internal predecessors, (148267), 6905 states have call successors, (6905), 1106 states have call predecessors, (6905), 1106 states have return successors, (6905), 6337 states have call predecessors, (6905), 6905 states have call successors, (6905) [2025-03-17 04:31:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108126 states to 108126 states and 162077 transitions. [2025-03-17 04:31:06,623 INFO L78 Accepts]: Start accepts. Automaton has 108126 states and 162077 transitions. Word has length 252 [2025-03-17 04:31:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:06,624 INFO L471 AbstractCegarLoop]: Abstraction has 108126 states and 162077 transitions. [2025-03-17 04:31:06,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.894736842105263) internal successors, (150), 19 states have internal predecessors, (150), 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-17 04:31:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 108126 states and 162077 transitions. [2025-03-17 04:31:06,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-17 04:31:06,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:06,652 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] [2025-03-17 04:31:06,660 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-17 04:31:06,853 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,SelfDestructingSolverStorable16 [2025-03-17 04:31:06,853 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1457900700, now seen corresponding path program 1 times [2025-03-17 04:31:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486925813] [2025-03-17 04:31:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:06,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 04:31:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 04:31:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:06,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:07,232 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-17 04:31:07,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:07,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486925813] [2025-03-17 04:31:07,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486925813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:07,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:07,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:31:07,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55774498] [2025-03-17 04:31:07,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:07,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:31:07,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:07,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:31:07,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:31:07,235 INFO L87 Difference]: Start difference. First operand 108126 states and 162077 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-17 04:31:12,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:31:12,610 INFO L93 Difference]: Finished difference Result 218962 states and 327683 transitions. [2025-03-17 04:31:12,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:31:12,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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 253 [2025-03-17 04:31:12,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:31:12,899 INFO L225 Difference]: With dead ends: 218962 [2025-03-17 04:31:12,899 INFO L226 Difference]: Without dead ends: 128871 [2025-03-17 04:31:12,996 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-17 04:31:12,997 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 471 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:31:12,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1056 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:31:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128871 states. [2025-03-17 04:31:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128871 to 93092. [2025-03-17 04:31:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93092 states, 86678 states have (on average 1.485982602275087) internal successors, (128802), 87130 states have internal predecessors, (128802), 5531 states have call successors, (5531), 882 states have call predecessors, (5531), 882 states have return successors, (5531), 5079 states have call predecessors, (5531), 5531 states have call successors, (5531) [2025-03-17 04:31:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93092 states to 93092 states and 139864 transitions. [2025-03-17 04:31:17,315 INFO L78 Accepts]: Start accepts. Automaton has 93092 states and 139864 transitions. Word has length 253 [2025-03-17 04:31:17,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:31:17,316 INFO L471 AbstractCegarLoop]: Abstraction has 93092 states and 139864 transitions. [2025-03-17 04:31:17,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-17 04:31:17,316 INFO L276 IsEmpty]: Start isEmpty. Operand 93092 states and 139864 transitions. [2025-03-17 04:31:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-17 04:31:17,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:31:17,341 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] [2025-03-17 04:31:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:31:17,342 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:31:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:31:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1278666458, now seen corresponding path program 1 times [2025-03-17 04:31:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:31:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891931300] [2025-03-17 04:31:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:31:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:31:17,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-17 04:31:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-17 04:31:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:31:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:31:17,498 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-17 04:31:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:31:17,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891931300] [2025-03-17 04:31:17,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891931300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:31:17,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:31:17,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:31:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225986380] [2025-03-17 04:31:17,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:31:17,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:31:17,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:31:17,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:31:17,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:31:17,501 INFO L87 Difference]: Start difference. First operand 93092 states and 139864 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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)