./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.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-0.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 bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:25:28,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:25:28,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:25:28,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:25:28,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:25:28,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:25:28,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:25:28,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:25:28,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:25:28,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:25:28,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:25:28,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:25:28,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:25:28,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:25:28,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:25:28,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:25:28,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:28,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:25:28,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:25:28,839 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:25:28,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:25:28,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:25:28,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:25:28,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:25:28,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:25:28,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:25:28,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:25:28,840 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 -> bc8ba5687f86ca6bc535ef8887bd15483610a3c920778b0e5f157ae799e621ff [2025-03-17 04:25:29,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:25:29,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:25:29,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:25:29,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:25:29,114 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:25:29,116 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-0.i [2025-03-17 04:25:30,385 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357ad43cb/6188667c0553485e84ef95230b3897dd/FLAG1b0c2df51 [2025-03-17 04:25:30,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:25:30,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-0.i [2025-03-17 04:25:30,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357ad43cb/6188667c0553485e84ef95230b3897dd/FLAG1b0c2df51 [2025-03-17 04:25:30,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/357ad43cb/6188667c0553485e84ef95230b3897dd [2025-03-17 04:25:30,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:25:30,687 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:25:30,688 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:30,688 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:25:30,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:25:30,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:30" (1/1) ... [2025-03-17 04:25:30,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476cee48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:30, skipping insertion in model container [2025-03-17 04:25:30,694 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:25:30" (1/1) ... [2025-03-17 04:25:30,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:25:30,837 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-0.i[915,928] [2025-03-17 04:25:30,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:30,987 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:25:30,997 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-0.i[915,928] [2025-03-17 04:25:31,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:25:31,061 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:25:31,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31 WrapperNode [2025-03-17 04:25:31,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:25:31,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:31,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:25:31,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:25:31,068 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:25:31" (1/1) ... [2025-03-17 04:25:31,085 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:25:31" (1/1) ... [2025-03-17 04:25:31,154 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 344 [2025-03-17 04:25:31,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:25:31,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:25:31,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:25:31,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:25:31,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,224 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:25:31,224 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,224 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:25:31,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:25:31,281 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:25:31,281 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:25:31,282 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (1/1) ... [2025-03-17 04:25:31,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:25:31,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:31,342 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:25:31,352 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:25:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:25:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:25:31,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:25:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:25:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:25:31,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:25:31,466 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:25:31,468 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:25:32,178 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L314: havoc property_#t~bitwise26#1;havoc property_#t~bitwise27#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-03-17 04:25:32,231 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-17 04:25:32,231 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:25:32,253 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:25:32,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:25:32,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:32 BoogieIcfgContainer [2025-03-17 04:25:32,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:25:32,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:25:32,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:25:32,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:25:32,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:25:30" (1/3) ... [2025-03-17 04:25:32,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c578a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:32, skipping insertion in model container [2025-03-17 04:25:32,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:25:31" (2/3) ... [2025-03-17 04:25:32,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16c578a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:25:32, skipping insertion in model container [2025-03-17 04:25:32,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:25:32" (3/3) ... [2025-03-17 04:25:32,263 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-0.i [2025-03-17 04:25:32,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:25:32,278 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-0.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:25:32,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:25:32,333 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;@5f6c4947, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:25:32,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:25:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 109 states have internal predecessors, (168), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 04:25:32,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 04:25:32,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:32,351 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:32,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:32,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:32,358 INFO L85 PathProgramCache]: Analyzing trace with hash -27307461, now seen corresponding path program 1 times [2025-03-17 04:25:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041627338] [2025-03-17 04:25:32,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:32,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:32,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:32,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 04:25:32,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:32,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041627338] [2025-03-17 04:25:32,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041627338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:32,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164313552] [2025-03-17 04:25:32,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:32,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:32,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:32,736 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:25:32,738 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:25:32,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:32,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:32,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:32,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:25:32,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 1922 trivial. 0 not checked. [2025-03-17 04:25:33,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:25:33,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164313552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:33,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:33,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:25:33,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492259671] [2025-03-17 04:25:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:25:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:33,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:25:33,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:25:33,042 INFO L87 Difference]: Start difference. First operand has 143 states, 108 states have (on average 1.5555555555555556) internal successors, (168), 109 states have internal predecessors, (168), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 04:25:33,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:33,090 INFO L93 Difference]: Finished difference Result 283 states and 494 transitions. [2025-03-17 04:25:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:25:33,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 227 [2025-03-17 04:25:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:33,099 INFO L225 Difference]: With dead ends: 283 [2025-03-17 04:25:33,099 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 04:25:33,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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:25:33,108 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:33,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:25:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 04:25:33,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 04:25:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 107 states have (on average 1.5327102803738317) internal successors, (164), 107 states have internal predecessors, (164), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 04:25:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 228 transitions. [2025-03-17 04:25:33,163 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 228 transitions. Word has length 227 [2025-03-17 04:25:33,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:33,163 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 228 transitions. [2025-03-17 04:25:33,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-17 04:25:33,163 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 228 transitions. [2025-03-17 04:25:33,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 04:25:33,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:33,167 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:33,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 04:25:33,368 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:25:33,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:33,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:33,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1528929889, now seen corresponding path program 1 times [2025-03-17 04:25:33,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:33,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87910252] [2025-03-17 04:25:33,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:33,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:33,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:33,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:33,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:33,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 04:25:33,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:33,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87910252] [2025-03-17 04:25:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87910252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:33,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:25:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430138916] [2025-03-17 04:25:33,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:33,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:25:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:33,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:25:33,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:25:33,761 INFO L87 Difference]: Start difference. First operand 141 states and 228 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:33,885 INFO L93 Difference]: Finished difference Result 377 states and 607 transitions. [2025-03-17 04:25:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:25:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 227 [2025-03-17 04:25:33,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:33,890 INFO L225 Difference]: With dead ends: 377 [2025-03-17 04:25:33,892 INFO L226 Difference]: Without dead ends: 237 [2025-03-17 04:25:33,893 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:25:33,893 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 146 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:33,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 414 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:25:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-17 04:25:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-03-17 04:25:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.5449735449735449) internal successors, (292), 190 states have internal predecessors, (292), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 04:25:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 376 transitions. [2025-03-17 04:25:33,927 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 376 transitions. Word has length 227 [2025-03-17 04:25:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:33,928 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 376 transitions. [2025-03-17 04:25:33,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 376 transitions. [2025-03-17 04:25:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 04:25:33,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:33,930 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:33,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:25:33,930 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:33,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:33,931 INFO L85 PathProgramCache]: Analyzing trace with hash -815737152, now seen corresponding path program 1 times [2025-03-17 04:25:33,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:33,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102530044] [2025-03-17 04:25:33,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:33,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:33,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:34,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:34,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 04:25:34,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102530044] [2025-03-17 04:25:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102530044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:25:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722817086] [2025-03-17 04:25:34,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:34,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:34,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:25:34,680 INFO L87 Difference]: Start difference. First operand 234 states and 376 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:34,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:34,877 INFO L93 Difference]: Finished difference Result 467 states and 751 transitions. [2025-03-17 04:25:34,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:25:34,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 227 [2025-03-17 04:25:34,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:34,883 INFO L225 Difference]: With dead ends: 467 [2025-03-17 04:25:34,884 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 04:25:34,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:25:34,886 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:34,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 727 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:25:34,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 04:25:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-17 04:25:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.5396825396825398) internal successors, (291), 190 states have internal predecessors, (291), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-17 04:25:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 375 transitions. [2025-03-17 04:25:34,912 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 375 transitions. Word has length 227 [2025-03-17 04:25:34,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:34,913 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 375 transitions. [2025-03-17 04:25:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 375 transitions. [2025-03-17 04:25:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 04:25:34,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:34,918 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:25:34,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 208956769, now seen corresponding path program 1 times [2025-03-17 04:25:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714623079] [2025-03-17 04:25:34,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:34,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:35,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:35,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:35,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 04:25:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714623079] [2025-03-17 04:25:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714623079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:35,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:25:35,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416206273] [2025-03-17 04:25:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:25:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:35,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:25:35,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:35,692 INFO L87 Difference]: Start difference. First operand 234 states and 375 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:36,801 INFO L93 Difference]: Finished difference Result 918 states and 1472 transitions. [2025-03-17 04:25:36,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 227 [2025-03-17 04:25:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:36,808 INFO L225 Difference]: With dead ends: 918 [2025-03-17 04:25:36,808 INFO L226 Difference]: Without dead ends: 685 [2025-03-17 04:25:36,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:25:36,811 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 662 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:36,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 513 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:25:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-17 04:25:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 519. [2025-03-17 04:25:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 430 states have (on average 1.558139534883721) internal successors, (670), 432 states have internal predecessors, (670), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 04:25:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 838 transitions. [2025-03-17 04:25:36,873 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 838 transitions. Word has length 227 [2025-03-17 04:25:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 838 transitions. [2025-03-17 04:25:36,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 838 transitions. [2025-03-17 04:25:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-17 04:25:36,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:36,878 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:25:36,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:36,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2050500993, now seen corresponding path program 1 times [2025-03-17 04:25:36,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:36,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725370600] [2025-03-17 04:25:36,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:36,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:36,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:37,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:37,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:37,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 24 proven. 69 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:37,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725370600] [2025-03-17 04:25:37,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725370600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:37,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425026220] [2025-03-17 04:25:37,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:37,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:37,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:37,468 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:25:37,485 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:25:37,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-17 04:25:37,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-17 04:25:37,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:37,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:37,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:25:37,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 891 proven. 63 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-03-17 04:25:37,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 30 proven. 63 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425026220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:25:38,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:25:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 04:25:38,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334897091] [2025-03-17 04:25:38,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:25:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:25:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:38,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:25:38,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:25:38,184 INFO L87 Difference]: Start difference. First operand 519 states and 838 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2025-03-17 04:25:38,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:38,831 INFO L93 Difference]: Finished difference Result 871 states and 1386 transitions. [2025-03-17 04:25:38,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 04:25:38,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) Word has length 227 [2025-03-17 04:25:38,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:38,834 INFO L225 Difference]: With dead ends: 871 [2025-03-17 04:25:38,834 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 04:25:38,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 451 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-17 04:25:38,836 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 556 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:38,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 450 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:25:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 04:25:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 348. [2025-03-17 04:25:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 265 states have (on average 1.4264150943396225) internal successors, (378), 266 states have internal predecessors, (378), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 04:25:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 526 transitions. [2025-03-17 04:25:38,892 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 526 transitions. Word has length 227 [2025-03-17 04:25:38,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:38,892 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 526 transitions. [2025-03-17 04:25:38,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (78), 3 states have call predecessors, (78), 3 states have call successors, (78) [2025-03-17 04:25:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 526 transitions. [2025-03-17 04:25:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:25:38,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:38,899 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:38,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:25:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:39,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:39,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:39,100 INFO L85 PathProgramCache]: Analyzing trace with hash -932361629, now seen corresponding path program 1 times [2025-03-17 04:25:39,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847984691] [2025-03-17 04:25:39,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:39,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:39,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:39,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:39,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 04:25:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:39,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847984691] [2025-03-17 04:25:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847984691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:39,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:39,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:25:39,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846857241] [2025-03-17 04:25:39,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:39,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:39,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:39,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:39,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:25:39,622 INFO L87 Difference]: Start difference. First operand 348 states and 526 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:40,268 INFO L93 Difference]: Finished difference Result 1141 states and 1722 transitions. [2025-03-17 04:25:40,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:25:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 229 [2025-03-17 04:25:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:40,275 INFO L225 Difference]: With dead ends: 1141 [2025-03-17 04:25:40,276 INFO L226 Difference]: Without dead ends: 820 [2025-03-17 04:25:40,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 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:25:40,279 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 309 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:40,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 506 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 04:25:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-17 04:25:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 648. [2025-03-17 04:25:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 523 states have (on average 1.4531548757170172) internal successors, (760), 526 states have internal predecessors, (760), 110 states have call successors, (110), 14 states have call predecessors, (110), 14 states have return successors, (110), 107 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 04:25:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 980 transitions. [2025-03-17 04:25:40,359 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 980 transitions. Word has length 229 [2025-03-17 04:25:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 980 transitions. [2025-03-17 04:25:40,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 980 transitions. [2025-03-17 04:25:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:25:40,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:40,366 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:40,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:25:40,367 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash 909182595, now seen corresponding path program 1 times [2025-03-17 04:25:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:40,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122335610] [2025-03-17 04:25:40,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:40,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:40,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:40,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:40,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:40,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122335610] [2025-03-17 04:25:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122335610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:40,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320833590] [2025-03-17 04:25:40,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:40,879 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:25:40,881 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:25:40,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:41,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:41,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:41,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:41,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:25:41,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 993 proven. 54 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked. [2025-03-17 04:25:41,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:41,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 39 proven. 54 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:41,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320833590] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:25:41,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:25:41,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 04:25:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374066003] [2025-03-17 04:25:41,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:25:41,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:25:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:41,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:25:41,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:25:41,459 INFO L87 Difference]: Start difference. First operand 648 states and 980 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:25:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:41,728 INFO L93 Difference]: Finished difference Result 1301 states and 1953 transitions. [2025-03-17 04:25:41,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:25:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 229 [2025-03-17 04:25:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:41,733 INFO L225 Difference]: With dead ends: 1301 [2025-03-17 04:25:41,733 INFO L226 Difference]: Without dead ends: 680 [2025-03-17 04:25:41,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 455 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:25:41,735 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 143 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:41,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 433 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:25:41,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-17 04:25:41,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 664. [2025-03-17 04:25:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 535 states have (on average 1.422429906542056) internal successors, (761), 538 states have internal predecessors, (761), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 107 states have call predecessors, (110), 110 states have call successors, (110) [2025-03-17 04:25:41,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 981 transitions. [2025-03-17 04:25:41,828 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 981 transitions. Word has length 229 [2025-03-17 04:25:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:41,831 INFO L471 AbstractCegarLoop]: Abstraction has 664 states and 981 transitions. [2025-03-17 04:25:41,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-17 04:25:41,831 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 981 transitions. [2025-03-17 04:25:41,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:25:41,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:41,834 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:41,849 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:25:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:42,037 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2184861, now seen corresponding path program 1 times [2025-03-17 04:25:42,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:42,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595612336] [2025-03-17 04:25:42,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:42,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:42,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:43,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595612336] [2025-03-17 04:25:43,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595612336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:43,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140459303] [2025-03-17 04:25:43,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:43,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:43,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:43,183 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:25:43,185 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:25:43,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:43,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:43,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:43,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:43,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 04:25:43,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:44,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 453 proven. 57 refuted. 0 times theorem prover too weak. 1474 trivial. 0 not checked. [2025-03-17 04:25:44,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:25:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140459303] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:25:44,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:25:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 19 [2025-03-17 04:25:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970107599] [2025-03-17 04:25:44,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:25:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 04:25:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:44,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 04:25:44,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:25:44,746 INFO L87 Difference]: Start difference. First operand 664 states and 981 transitions. Second operand has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-03-17 04:25:54,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:54,209 INFO L93 Difference]: Finished difference Result 8178 states and 11654 transitions. [2025-03-17 04:25:54,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-17 04:25:54,209 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 229 [2025-03-17 04:25:54,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:54,252 INFO L225 Difference]: With dead ends: 8178 [2025-03-17 04:25:54,253 INFO L226 Difference]: Without dead ends: 7541 [2025-03-17 04:25:54,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5015 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2440, Invalid=11366, Unknown=0, NotChecked=0, Total=13806 [2025-03-17 04:25:54,263 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 3863 mSDsluCounter, 2046 mSDsCounter, 0 mSdLazyCounter, 3472 mSolverCounterSat, 2636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3950 SdHoareTripleChecker+Valid, 2271 SdHoareTripleChecker+Invalid, 6108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2636 IncrementalHoareTripleChecker+Valid, 3472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:54,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3950 Valid, 2271 Invalid, 6108 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2636 Valid, 3472 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-03-17 04:25:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7541 states. [2025-03-17 04:25:54,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7541 to 1864. [2025-03-17 04:25:54,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1483 states have (on average 1.4012137559002023) internal successors, (2078), 1494 states have internal predecessors, (2078), 320 states have call successors, (320), 60 states have call predecessors, (320), 60 states have return successors, (320), 309 states have call predecessors, (320), 320 states have call successors, (320) [2025-03-17 04:25:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2718 transitions. [2025-03-17 04:25:54,684 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2718 transitions. Word has length 229 [2025-03-17 04:25:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:54,685 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2718 transitions. [2025-03-17 04:25:54,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.526315789473684) internal successors, (143), 19 states have internal predecessors, (143), 3 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2025-03-17 04:25:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2718 transitions. [2025-03-17 04:25:54,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:25:54,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:54,688 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:54,696 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:25:54,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:54,890 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:54,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:54,890 INFO L85 PathProgramCache]: Analyzing trace with hash -512719038, now seen corresponding path program 1 times [2025-03-17 04:25:54,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:54,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942083508] [2025-03-17 04:25:54,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:54,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:54,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:54,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:54,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2025-03-17 04:25:55,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:55,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942083508] [2025-03-17 04:25:55,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942083508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:25:55,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:25:55,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:25:55,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311787344] [2025-03-17 04:25:55,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:25:55,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:25:55,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:55,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:25:55,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:25:55,446 INFO L87 Difference]: Start difference. First operand 1864 states and 2718 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:25:56,041 INFO L93 Difference]: Finished difference Result 6100 states and 8982 transitions. [2025-03-17 04:25:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:25:56,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 229 [2025-03-17 04:25:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:25:56,058 INFO L225 Difference]: With dead ends: 6100 [2025-03-17 04:25:56,058 INFO L226 Difference]: Without dead ends: 4298 [2025-03-17 04:25:56,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:25:56,063 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 319 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:25:56,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 801 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:25:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2025-03-17 04:25:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 3624. [2025-03-17 04:25:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 2897 states have (on average 1.3983431135657576) internal successors, (4051), 2918 states have internal predecessors, (4051), 612 states have call successors, (612), 114 states have call predecessors, (612), 114 states have return successors, (612), 591 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-17 04:25:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 5275 transitions. [2025-03-17 04:25:56,597 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 5275 transitions. Word has length 229 [2025-03-17 04:25:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:25:56,600 INFO L471 AbstractCegarLoop]: Abstraction has 3624 states and 5275 transitions. [2025-03-17 04:25:56,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-17 04:25:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 5275 transitions. [2025-03-17 04:25:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:25:56,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:25:56,607 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:25:56,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:25:56,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:25:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 330056482, now seen corresponding path program 1 times [2025-03-17 04:25:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:25:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740756289] [2025-03-17 04:25:56,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:56,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:25:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:57,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:57,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:57,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:25:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [987150128] [2025-03-17 04:25:57,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:25:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:25:57,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:25:57,011 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:25:57,013 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:25:57,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:25:57,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:25:57,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:25:57,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:25:57,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 04:25:57,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:25:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1255 proven. 63 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2025-03-17 04:25:57,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:25:58,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:25:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740756289] [2025-03-17 04:25:58,383 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 04:25:58,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987150128] [2025-03-17 04:25:58,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987150128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:25:58,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:25:58,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-17 04:25:58,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868759968] [2025-03-17 04:25:58,383 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 04:25:58,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 04:25:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:25:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 04:25:58,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-03-17 04:25:58,385 INFO L87 Difference]: Start difference. First operand 3624 states and 5275 transitions. Second operand has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 04:26:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:26:00,415 INFO L93 Difference]: Finished difference Result 10079 states and 14410 transitions. [2025-03-17 04:26:00,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 04:26:00,415 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 229 [2025-03-17 04:26:00,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:26:00,448 INFO L225 Difference]: With dead ends: 10079 [2025-03-17 04:26:00,448 INFO L226 Difference]: Without dead ends: 6525 [2025-03-17 04:26:00,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 04:26:00,460 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 963 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:26:00,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 960 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:26:00,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6525 states. [2025-03-17 04:26:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6525 to 4442. [2025-03-17 04:26:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4442 states, 3837 states have (on average 1.4310659369298933) internal successors, (5491), 3854 states have internal predecessors, (5491), 476 states have call successors, (476), 128 states have call predecessors, (476), 128 states have return successors, (476), 459 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-17 04:26:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4442 states to 4442 states and 6443 transitions. [2025-03-17 04:26:01,174 INFO L78 Accepts]: Start accepts. Automaton has 4442 states and 6443 transitions. Word has length 229 [2025-03-17 04:26:01,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:26:01,174 INFO L471 AbstractCegarLoop]: Abstraction has 4442 states and 6443 transitions. [2025-03-17 04:26:01,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.8) internal successors, (87), 15 states have internal predecessors, (87), 4 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 04:26:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 4442 states and 6443 transitions. [2025-03-17 04:26:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-17 04:26:01,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:26:01,179 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:01,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 04:26:01,383 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,SelfDestructingSolverStorable9 [2025-03-17 04:26:01,383 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:26:01,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:26:01,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1181721981, now seen corresponding path program 1 times [2025-03-17 04:26:01,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:26:01,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-17 04:26:01,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:26:01,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:26:01,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:26:01,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:01,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 04:26:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365826156] [2025-03-17 04:26:01,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:26:01,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:26:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:26:01,571 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:26:01,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 04:26:01,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-17 04:26:01,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-17 04:26:01,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:26:01,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:26:01,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 04:26:01,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:26:03,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1173 proven. 48 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-17 04:26:03,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:26:05,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2025-03-17 04:26:05,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:26:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839284758] [2025-03-17 04:26:05,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 04:26:05,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365826156] [2025-03-17 04:26:05,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365826156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:26:05,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 04:26:05,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 33 [2025-03-17 04:26:05,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263297951] [2025-03-17 04:26:05,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 04:26:05,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-17 04:26:05,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:26:05,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-17 04:26:05,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=896, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 04:26:05,478 INFO L87 Difference]: Start difference. First operand 4442 states and 6443 transitions. Second operand has 33 states, 33 states have (on average 4.090909090909091) internal successors, (135), 33 states have internal predecessors, (135), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (47), 4 states have call predecessors, (47), 4 states have call successors, (47) [2025-03-17 04:26:10,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:13,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:20,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:22,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:25,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:30,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:34,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2025-03-17 04:26:50,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]