./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.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-9.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 b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:34:39,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:34:40,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:34:40,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:34:40,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:34:40,056 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:34:40,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:34:40,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:34:40,056 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:34:40,056 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:34:40,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:34:40,056 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:34:40,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:34:40,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:34:40,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:34:40,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:34:40,063 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:40,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:34:40,063 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:34:40,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:34:40,064 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 -> b3c86227bd3c166c2c8d2c3f7201460a37b3a8cc1b1724af153204475ecb73cc [2025-03-17 04:34:40,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:34:40,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:34:40,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:34:40,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:34:40,325 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:34:40,326 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-9.i [2025-03-17 04:34:41,540 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a3e7c5c/0243c6dc7c854fa598147b496b11426c/FLAGbe23b5824 [2025-03-17 04:34:41,799 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:34:41,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-9.i [2025-03-17 04:34:41,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a3e7c5c/0243c6dc7c854fa598147b496b11426c/FLAGbe23b5824 [2025-03-17 04:34:41,821 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6a3e7c5c/0243c6dc7c854fa598147b496b11426c [2025-03-17 04:34:41,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:34:41,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:34:41,826 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:41,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:34:41,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:34:41,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:41" (1/1) ... [2025-03-17 04:34:41,832 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c177e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:41, skipping insertion in model container [2025-03-17 04:34:41,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:34:41" (1/1) ... [2025-03-17 04:34:41,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:34:41,994 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-9.i[915,928] [2025-03-17 04:34:42,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:42,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:34:42,132 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-9.i[915,928] [2025-03-17 04:34:42,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:34:42,212 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:34:42,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42 WrapperNode [2025-03-17 04:34:42,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:34:42,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:42,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:34:42,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:34:42,220 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:34:42" (1/1) ... [2025-03-17 04:34:42,238 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:34:42" (1/1) ... [2025-03-17 04:34:42,293 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 416 [2025-03-17 04:34:42,293 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:34:42,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:34:42,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:34:42,294 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:34:42,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,335 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:34:42,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:34:42,379 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:34:42,379 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:34:42,379 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:34:42,380 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (1/1) ... [2025-03-17 04:34:42,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:34:42,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:42,406 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:34:42,408 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:34:42,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:34:42,426 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:34:42,426 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:34:42,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:34:42,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:34:42,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:34:42,519 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:34:42,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:34:43,078 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc property_#t~ite35#1;havoc property_#t~ite34#1;havoc property_#t~bitwise33#1;havoc property_#t~short36#1;havoc property_#t~ite38#1;havoc property_#t~bitwise37#1;havoc property_#t~short39#1; [2025-03-17 04:34:43,137 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2025-03-17 04:34:43,138 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:34:43,164 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:34:43,164 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 04:34:43,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:43 BoogieIcfgContainer [2025-03-17 04:34:43,164 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:34:43,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:34:43,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:34:43,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:34:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:34:41" (1/3) ... [2025-03-17 04:34:43,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06ff10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:43, skipping insertion in model container [2025-03-17 04:34:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:34:42" (2/3) ... [2025-03-17 04:34:43,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c06ff10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:34:43, skipping insertion in model container [2025-03-17 04:34:43,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:34:43" (3/3) ... [2025-03-17 04:34:43,171 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-9.i [2025-03-17 04:34:43,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:34:43,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-9.i that has 2 procedures, 172 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:34:43,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:34:43,245 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;@27d848ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:34:43,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:34:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 121 states have (on average 1.5289256198347108) internal successors, (185), 122 states have internal predecessors, (185), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 04:34:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-17 04:34:43,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:43,267 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:43,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:43,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:43,272 INFO L85 PathProgramCache]: Analyzing trace with hash 2135521710, now seen corresponding path program 1 times [2025-03-17 04:34:43,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131965199] [2025-03-17 04:34:43,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-17 04:34:43,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-17 04:34:43,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:43,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-17 04:34:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131965199] [2025-03-17 04:34:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131965199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:34:43,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354222273] [2025-03-17 04:34:43,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:43,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:34:43,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:34:43,649 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:34:43,651 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:34:43,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-17 04:34:43,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-17 04:34:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:43,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:34:43,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:34:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-17 04:34:43,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:34:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354222273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:43,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:34:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:34:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400085206] [2025-03-17 04:34:43,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:34:43,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:43,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:34:43,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:34:43,932 INFO L87 Difference]: Start difference. First operand has 172 states, 121 states have (on average 1.5289256198347108) internal successors, (185), 122 states have internal predecessors, (185), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 04:34:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:44,002 INFO L93 Difference]: Finished difference Result 341 states and 608 transitions. [2025-03-17 04:34:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:34:44,004 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 309 [2025-03-17 04:34:44,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:44,034 INFO L225 Difference]: With dead ends: 341 [2025-03-17 04:34:44,035 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 04:34:44,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 310 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:34:44,039 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:44,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:34:44,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 04:34:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-17 04:34:44,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 120 states have (on average 1.5083333333333333) internal successors, (181), 120 states have internal predecessors, (181), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 04:34:44,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 277 transitions. [2025-03-17 04:34:44,103 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 277 transitions. Word has length 309 [2025-03-17 04:34:44,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:44,103 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 277 transitions. [2025-03-17 04:34:44,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-17 04:34:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 277 transitions. [2025-03-17 04:34:44,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-17 04:34:44,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:44,139 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:34:44,340 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:34:44,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:44,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:44,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1504630536, now seen corresponding path program 1 times [2025-03-17 04:34:44,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:44,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340746833] [2025-03-17 04:34:44,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:44,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:44,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-17 04:34:44,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-17 04:34:44,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:44,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:34:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340746833] [2025-03-17 04:34:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340746833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:44,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:44,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:44,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285312884] [2025-03-17 04:34:44,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:44,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:44,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:44,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:44,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:44,672 INFO L87 Difference]: Start difference. First operand 170 states and 277 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:44,759 INFO L93 Difference]: Finished difference Result 471 states and 766 transitions. [2025-03-17 04:34:44,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 309 [2025-03-17 04:34:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:44,764 INFO L225 Difference]: With dead ends: 471 [2025-03-17 04:34:44,766 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 04:34:44,767 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:34:44,769 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 199 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:44,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 622 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 04:34:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2025-03-17 04:34:44,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 212 states have (on average 1.5) internal successors, (318), 213 states have internal predecessors, (318), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 04:34:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 486 transitions. [2025-03-17 04:34:44,806 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 486 transitions. Word has length 309 [2025-03-17 04:34:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:44,807 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 486 transitions. [2025-03-17 04:34:44,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 486 transitions. [2025-03-17 04:34:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-17 04:34:44,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:44,814 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:34:44,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:44,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:44,815 INFO L85 PathProgramCache]: Analyzing trace with hash -873156310, now seen corresponding path program 1 times [2025-03-17 04:34:44,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:44,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356234396] [2025-03-17 04:34:44,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:44,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:44,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-17 04:34:44,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-17 04:34:44,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:44,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:34:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:45,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356234396] [2025-03-17 04:34:45,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356234396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:45,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:45,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:34:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032925060] [2025-03-17 04:34:45,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:45,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:34:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:45,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:34:45,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:34:45,072 INFO L87 Difference]: Start difference. First operand 299 states and 486 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:45,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:45,165 INFO L93 Difference]: Finished difference Result 895 states and 1456 transitions. [2025-03-17 04:34:45,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:34:45,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 310 [2025-03-17 04:34:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:45,170 INFO L225 Difference]: With dead ends: 895 [2025-03-17 04:34:45,170 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 04:34:45,172 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:34:45,173 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 245 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:45,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 730 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:34:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 04:34:45,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 353. [2025-03-17 04:34:45,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 266 states have (on average 1.518796992481203) internal successors, (404), 267 states have internal predecessors, (404), 84 states have call successors, (84), 2 states have call predecessors, (84), 2 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 04:34:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 572 transitions. [2025-03-17 04:34:45,222 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 572 transitions. Word has length 310 [2025-03-17 04:34:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:45,222 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 572 transitions. [2025-03-17 04:34:45,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 572 transitions. [2025-03-17 04:34:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-17 04:34:45,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:45,225 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:45,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:34:45,225 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:45,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:45,226 INFO L85 PathProgramCache]: Analyzing trace with hash 2127629015, now seen corresponding path program 1 times [2025-03-17 04:34:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:45,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162386140] [2025-03-17 04:34:45,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:45,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:45,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-17 04:34:45,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-17 04:34:45,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:45,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:34:45,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162386140] [2025-03-17 04:34:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162386140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:45,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:45,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:34:45,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957866417] [2025-03-17 04:34:45,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:45,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:34:45,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:45,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:34:45,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:34:45,679 INFO L87 Difference]: Start difference. First operand 353 states and 572 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:46,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:46,704 INFO L93 Difference]: Finished difference Result 2126 states and 3439 transitions. [2025-03-17 04:34:46,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:34:46,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 311 [2025-03-17 04:34:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:46,719 INFO L225 Difference]: With dead ends: 2126 [2025-03-17 04:34:46,719 INFO L226 Difference]: Without dead ends: 1774 [2025-03-17 04:34:46,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:34:46,724 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 926 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 2298 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:34:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-17 04:34:46,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1562. [2025-03-17 04:34:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1169 states have (on average 1.5175363558597093) internal successors, (1774), 1179 states have internal predecessors, (1774), 376 states have call successors, (376), 16 states have call predecessors, (376), 16 states have return successors, (376), 366 states have call predecessors, (376), 376 states have call successors, (376) [2025-03-17 04:34:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2526 transitions. [2025-03-17 04:34:46,866 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2526 transitions. Word has length 311 [2025-03-17 04:34:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:46,867 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2526 transitions. [2025-03-17 04:34:46,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2526 transitions. [2025-03-17 04:34:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-17 04:34:46,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:46,872 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:34:46,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1837572520, now seen corresponding path program 1 times [2025-03-17 04:34:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900706901] [2025-03-17 04:34:46,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:46,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:46,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-17 04:34:47,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-17 04:34:47,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:47,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:34:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900706901] [2025-03-17 04:34:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900706901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:34:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990872144] [2025-03-17 04:34:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:47,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:34:47,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:47,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:34:47,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:34:47,826 INFO L87 Difference]: Start difference. First operand 1562 states and 2526 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:48,314 INFO L93 Difference]: Finished difference Result 4461 states and 7204 transitions. [2025-03-17 04:34:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:34:48,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 311 [2025-03-17 04:34:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:48,382 INFO L225 Difference]: With dead ends: 4461 [2025-03-17 04:34:48,382 INFO L226 Difference]: Without dead ends: 2900 [2025-03-17 04:34:48,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:34:48,389 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 247 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:48,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1258 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:34:48,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2900 states. [2025-03-17 04:34:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2900 to 2890. [2025-03-17 04:34:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2890 states, 2185 states have (on average 1.500228832951945) internal successors, (3278), 2207 states have internal predecessors, (3278), 672 states have call successors, (672), 32 states have call predecessors, (672), 32 states have return successors, (672), 650 states have call predecessors, (672), 672 states have call successors, (672) [2025-03-17 04:34:48,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 4622 transitions. [2025-03-17 04:34:48,598 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 4622 transitions. Word has length 311 [2025-03-17 04:34:48,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:48,599 INFO L471 AbstractCegarLoop]: Abstraction has 2890 states and 4622 transitions. [2025-03-17 04:34:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 4622 transitions. [2025-03-17 04:34:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-03-17 04:34:48,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:48,607 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:48,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:34:48,609 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1144470823, now seen corresponding path program 1 times [2025-03-17 04:34:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:48,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116940433] [2025-03-17 04:34:48,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:48,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-03-17 04:34:48,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-03-17 04:34:48,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:34:48,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:34:57,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:34:57,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:34:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116940433] [2025-03-17 04:34:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116940433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:34:57,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:34:57,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:34:57,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703716962] [2025-03-17 04:34:57,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:34:57,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:34:57,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:34:57,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:34:57,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:34:57,655 INFO L87 Difference]: Start difference. First operand 2890 states and 4622 transitions. Second operand has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:34:59,363 INFO L93 Difference]: Finished difference Result 9424 states and 14885 transitions. [2025-03-17 04:34:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:34:59,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 311 [2025-03-17 04:34:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:34:59,400 INFO L225 Difference]: With dead ends: 9424 [2025-03-17 04:34:59,401 INFO L226 Difference]: Without dead ends: 6535 [2025-03-17 04:34:59,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:34:59,412 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 450 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:34:59,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1126 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 04:34:59,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2025-03-17 04:34:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 4800. [2025-03-17 04:34:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4800 states, 3995 states have (on average 1.541927409261577) internal successors, (6160), 4042 states have internal predecessors, (6160), 724 states have call successors, (724), 80 states have call predecessors, (724), 80 states have return successors, (724), 677 states have call predecessors, (724), 724 states have call successors, (724) [2025-03-17 04:34:59,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4800 states to 4800 states and 7608 transitions. [2025-03-17 04:34:59,779 INFO L78 Accepts]: Start accepts. Automaton has 4800 states and 7608 transitions. Word has length 311 [2025-03-17 04:34:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:34:59,780 INFO L471 AbstractCegarLoop]: Abstraction has 4800 states and 7608 transitions. [2025-03-17 04:34:59,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.25) internal successors, (74), 8 states have internal predecessors, (74), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:34:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4800 states and 7608 transitions. [2025-03-17 04:34:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-17 04:34:59,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:34:59,788 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:34:59,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:34:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:34:59,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1768688300, now seen corresponding path program 1 times [2025-03-17 04:34:59,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:34:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953978283] [2025-03-17 04:34:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:34:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:34:59,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 04:35:00,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 04:35:00,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:00,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:09,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:09,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953978283] [2025-03-17 04:35:09,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953978283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:09,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:09,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:35:09,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186200395] [2025-03-17 04:35:09,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:09,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:35:09,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:09,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:35:09,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:09,191 INFO L87 Difference]: Start difference. First operand 4800 states and 7608 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:10,731 INFO L93 Difference]: Finished difference Result 13207 states and 20884 transitions. [2025-03-17 04:35:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:35:10,732 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2025-03-17 04:35:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:10,763 INFO L225 Difference]: With dead ends: 13207 [2025-03-17 04:35:10,763 INFO L226 Difference]: Without dead ends: 8414 [2025-03-17 04:35:10,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:35:10,774 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 613 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:10,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1118 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 04:35:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8414 states. [2025-03-17 04:35:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8414 to 4872. [2025-03-17 04:35:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4067 states have (on average 1.5441357265797886) internal successors, (6280), 4114 states have internal predecessors, (6280), 724 states have call successors, (724), 80 states have call predecessors, (724), 80 states have return successors, (724), 677 states have call predecessors, (724), 724 states have call successors, (724) [2025-03-17 04:35:11,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 7728 transitions. [2025-03-17 04:35:11,100 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 7728 transitions. Word has length 312 [2025-03-17 04:35:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:11,102 INFO L471 AbstractCegarLoop]: Abstraction has 4872 states and 7728 transitions. [2025-03-17 04:35:11,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 7728 transitions. [2025-03-17 04:35:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-17 04:35:11,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:11,109 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:11,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:35:11,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1488177674, now seen corresponding path program 1 times [2025-03-17 04:35:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908264749] [2025-03-17 04:35:11,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:11,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:11,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-17 04:35:11,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-17 04:35:11,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:11,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908264749] [2025-03-17 04:35:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908264749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 04:35:20,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305609180] [2025-03-17 04:35:20,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 04:35:20,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:20,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 04:35:20,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-17 04:35:20,104 INFO L87 Difference]: Start difference. First operand 4872 states and 7728 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:23,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:23,155 INFO L93 Difference]: Finished difference Result 15276 states and 24031 transitions. [2025-03-17 04:35:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 04:35:23,156 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 312 [2025-03-17 04:35:23,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:23,199 INFO L225 Difference]: With dead ends: 15276 [2025-03-17 04:35:23,200 INFO L226 Difference]: Without dead ends: 10411 [2025-03-17 04:35:23,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-03-17 04:35:23,210 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 863 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:23,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 1216 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 04:35:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10411 states. [2025-03-17 04:35:23,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10411 to 6872. [2025-03-17 04:35:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6872 states, 5923 states have (on average 1.5586695931115988) internal successors, (9232), 5994 states have internal predecessors, (9232), 820 states have call successors, (820), 128 states have call predecessors, (820), 128 states have return successors, (820), 749 states have call predecessors, (820), 820 states have call successors, (820) [2025-03-17 04:35:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6872 states to 6872 states and 10872 transitions. [2025-03-17 04:35:23,800 INFO L78 Accepts]: Start accepts. Automaton has 6872 states and 10872 transitions. Word has length 312 [2025-03-17 04:35:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:23,800 INFO L471 AbstractCegarLoop]: Abstraction has 6872 states and 10872 transitions. [2025-03-17 04:35:23,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6872 states and 10872 transitions. [2025-03-17 04:35:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:23,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:23,811 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:23,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:35:23,811 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash 162887352, now seen corresponding path program 1 times [2025-03-17 04:35:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:23,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901180730] [2025-03-17 04:35:23,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:23,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:23,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:23,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:23,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:23,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:24,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:24,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901180730] [2025-03-17 04:35:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901180730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:24,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:24,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498169882] [2025-03-17 04:35:24,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:24,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:24,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:24,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:24,065 INFO L87 Difference]: Start difference. First operand 6872 states and 10872 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:25,027 INFO L93 Difference]: Finished difference Result 10598 states and 16704 transitions. [2025-03-17 04:35:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:35:25,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-03-17 04:35:25,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:25,052 INFO L225 Difference]: With dead ends: 10598 [2025-03-17 04:35:25,052 INFO L226 Difference]: Without dead ends: 8372 [2025-03-17 04:35:25,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:35:25,056 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 408 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:25,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 975 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:35:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8372 states. [2025-03-17 04:35:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8372 to 7142. [2025-03-17 04:35:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7142 states, 6193 states have (on average 1.554658485386727) internal successors, (9628), 6264 states have internal predecessors, (9628), 820 states have call successors, (820), 128 states have call predecessors, (820), 128 states have return successors, (820), 749 states have call predecessors, (820), 820 states have call successors, (820) [2025-03-17 04:35:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7142 states to 7142 states and 11268 transitions. [2025-03-17 04:35:25,546 INFO L78 Accepts]: Start accepts. Automaton has 7142 states and 11268 transitions. Word has length 313 [2025-03-17 04:35:25,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:25,547 INFO L471 AbstractCegarLoop]: Abstraction has 7142 states and 11268 transitions. [2025-03-17 04:35:25,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:25,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7142 states and 11268 transitions. [2025-03-17 04:35:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:25,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:25,555 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:35:25,556 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:25,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash 307142554, now seen corresponding path program 1 times [2025-03-17 04:35:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758130238] [2025-03-17 04:35:25,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:25,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:25,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:34,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:34,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:34,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758130238] [2025-03-17 04:35:34,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758130238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:34,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:34,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 04:35:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472287360] [2025-03-17 04:35:34,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:34,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 04:35:34,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:34,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 04:35:34,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 04:35:34,360 INFO L87 Difference]: Start difference. First operand 7142 states and 11268 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:36,884 INFO L93 Difference]: Finished difference Result 19324 states and 30407 transitions. [2025-03-17 04:35:36,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:35:36,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-03-17 04:35:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:36,953 INFO L225 Difference]: With dead ends: 19324 [2025-03-17 04:35:36,954 INFO L226 Difference]: Without dead ends: 12189 [2025-03-17 04:35:36,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:35:36,970 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 679 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:36,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1148 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:35:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12189 states. [2025-03-17 04:35:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12189 to 6680. [2025-03-17 04:35:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6680 states, 5731 states have (on average 1.5508637236084453) internal successors, (8888), 5802 states have internal predecessors, (8888), 820 states have call successors, (820), 128 states have call predecessors, (820), 128 states have return successors, (820), 749 states have call predecessors, (820), 820 states have call successors, (820) [2025-03-17 04:35:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6680 states to 6680 states and 10528 transitions. [2025-03-17 04:35:37,738 INFO L78 Accepts]: Start accepts. Automaton has 6680 states and 10528 transitions. Word has length 313 [2025-03-17 04:35:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 6680 states and 10528 transitions. [2025-03-17 04:35:37,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6680 states and 10528 transitions. [2025-03-17 04:35:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:37,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:37,762 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:37,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:35:37,763 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:37,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:37,763 INFO L85 PathProgramCache]: Analyzing trace with hash 635917019, now seen corresponding path program 1 times [2025-03-17 04:35:37,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:37,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58963055] [2025-03-17 04:35:37,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:37,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:37,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:38,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:38,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:38,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:38,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:38,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:38,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58963055] [2025-03-17 04:35:38,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58963055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:38,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:38,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:35:38,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981363894] [2025-03-17 04:35:38,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:38,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:35:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:35:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:38,373 INFO L87 Difference]: Start difference. First operand 6680 states and 10528 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:39,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:39,524 INFO L93 Difference]: Finished difference Result 16714 states and 26277 transitions. [2025-03-17 04:35:39,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:35:39,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-03-17 04:35:39,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:39,558 INFO L225 Difference]: With dead ends: 16714 [2025-03-17 04:35:39,559 INFO L226 Difference]: Without dead ends: 10041 [2025-03-17 04:35:39,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:35:39,576 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 166 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:39,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 885 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:35:39,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10041 states. [2025-03-17 04:35:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10041 to 10039. [2025-03-17 04:35:40,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10039 states, 8338 states have (on average 1.5285440153514032) internal successors, (12745), 8431 states have internal predecessors, (12745), 1492 states have call successors, (1492), 208 states have call predecessors, (1492), 208 states have return successors, (1492), 1399 states have call predecessors, (1492), 1492 states have call successors, (1492) [2025-03-17 04:35:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 15729 transitions. [2025-03-17 04:35:40,539 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 15729 transitions. Word has length 313 [2025-03-17 04:35:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 10039 states and 15729 transitions. [2025-03-17 04:35:40,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 15729 transitions. [2025-03-17 04:35:40,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:40,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:40,554 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:40,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:35:40,555 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:40,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 604897212, now seen corresponding path program 1 times [2025-03-17 04:35:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117313619] [2025-03-17 04:35:40,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:40,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:40,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:40,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:40,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:40,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117313619] [2025-03-17 04:35:40,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117313619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:40,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:40,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:35:40,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44647360] [2025-03-17 04:35:40,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:40,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:35:40,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:40,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:35:40,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:35:40,809 INFO L87 Difference]: Start difference. First operand 10039 states and 15729 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:41,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:41,818 INFO L93 Difference]: Finished difference Result 18110 states and 28745 transitions. [2025-03-17 04:35:41,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:35:41,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-03-17 04:35:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:41,853 INFO L225 Difference]: With dead ends: 18110 [2025-03-17 04:35:41,853 INFO L226 Difference]: Without dead ends: 11437 [2025-03-17 04:35:41,869 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:35:41,870 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 71 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:41,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 513 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:35:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11437 states. [2025-03-17 04:35:42,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11437 to 10039. [2025-03-17 04:35:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10039 states, 8338 states have (on average 1.5227872391460782) internal successors, (12697), 8431 states have internal predecessors, (12697), 1492 states have call successors, (1492), 208 states have call predecessors, (1492), 208 states have return successors, (1492), 1399 states have call predecessors, (1492), 1492 states have call successors, (1492) [2025-03-17 04:35:42,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10039 states to 10039 states and 15681 transitions. [2025-03-17 04:35:42,795 INFO L78 Accepts]: Start accepts. Automaton has 10039 states and 15681 transitions. Word has length 313 [2025-03-17 04:35:42,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:42,796 INFO L471 AbstractCegarLoop]: Abstraction has 10039 states and 15681 transitions. [2025-03-17 04:35:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 10039 states and 15681 transitions. [2025-03-17 04:35:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:42,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:42,811 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:42,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:35:42,811 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:42,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1460501481, now seen corresponding path program 1 times [2025-03-17 04:35:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:42,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594652250] [2025-03-17 04:35:42,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:42,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:42,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:42,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:42,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:42,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-17 04:35:42,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:42,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594652250] [2025-03-17 04:35:42,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594652250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:35:42,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:35:42,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:35:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775675088] [2025-03-17 04:35:42,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:35:42,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:35:42,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:42,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:35:42,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:35:42,976 INFO L87 Difference]: Start difference. First operand 10039 states and 15681 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:43,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:43,746 INFO L93 Difference]: Finished difference Result 21673 states and 34015 transitions. [2025-03-17 04:35:43,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:35:43,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 313 [2025-03-17 04:35:43,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:43,784 INFO L225 Difference]: With dead ends: 21673 [2025-03-17 04:35:43,785 INFO L226 Difference]: Without dead ends: 11641 [2025-03-17 04:35:43,803 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:35:43,804 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 110 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:43,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 571 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:35:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11641 states. [2025-03-17 04:35:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11641 to 11191. [2025-03-17 04:35:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11191 states, 9490 states have (on average 1.5443624868282402) internal successors, (14656), 9583 states have internal predecessors, (14656), 1492 states have call successors, (1492), 208 states have call predecessors, (1492), 208 states have return successors, (1492), 1399 states have call predecessors, (1492), 1492 states have call successors, (1492) [2025-03-17 04:35:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 17640 transitions. [2025-03-17 04:35:45,054 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 17640 transitions. Word has length 313 [2025-03-17 04:35:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:45,056 INFO L471 AbstractCegarLoop]: Abstraction has 11191 states and 17640 transitions. [2025-03-17 04:35:45,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-17 04:35:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 17640 transitions. [2025-03-17 04:35:45,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:45,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:45,070 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:45,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:35:45,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:45,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -383183744, now seen corresponding path program 1 times [2025-03-17 04:35:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021074813] [2025-03-17 04:35:45,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:45,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:45,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:45,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:45,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:45,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 84 proven. 57 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-17 04:35:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021074813] [2025-03-17 04:35:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021074813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:35:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357676401] [2025-03-17 04:35:45,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:45,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:35:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:35:45,932 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:35:45,934 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:35:46,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:46,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:46,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:46,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:46,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:35:46,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:35:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2231 proven. 57 refuted. 0 times theorem prover too weak. 2224 trivial. 0 not checked. [2025-03-17 04:35:46,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:35:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 84 proven. 57 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-17 04:35:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357676401] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:35:46,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:35:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-17 04:35:46,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923568910] [2025-03-17 04:35:46,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:35:46,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:35:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:35:46,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:35:46,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:35:46,504 INFO L87 Difference]: Start difference. First operand 11191 states and 17640 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2025-03-17 04:35:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:35:47,364 INFO L93 Difference]: Finished difference Result 15441 states and 24245 transitions. [2025-03-17 04:35:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 04:35:47,366 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) Word has length 313 [2025-03-17 04:35:47,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:35:47,397 INFO L225 Difference]: With dead ends: 15441 [2025-03-17 04:35:47,397 INFO L226 Difference]: Without dead ends: 9867 [2025-03-17 04:35:47,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 623 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:35:47,408 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 485 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:35:47,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 543 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:35:47,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2025-03-17 04:35:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9807. [2025-03-17 04:35:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9807 states, 8312 states have (on average 1.5406641000962464) internal successors, (12806), 8389 states have internal predecessors, (12806), 1292 states have call successors, (1292), 202 states have call predecessors, (1292), 202 states have return successors, (1292), 1215 states have call predecessors, (1292), 1292 states have call successors, (1292) [2025-03-17 04:35:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9807 states to 9807 states and 15390 transitions. [2025-03-17 04:35:48,151 INFO L78 Accepts]: Start accepts. Automaton has 9807 states and 15390 transitions. Word has length 313 [2025-03-17 04:35:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:35:48,152 INFO L471 AbstractCegarLoop]: Abstraction has 9807 states and 15390 transitions. [2025-03-17 04:35:48,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (87), 3 states have call predecessors, (87), 3 states have call successors, (87) [2025-03-17 04:35:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 9807 states and 15390 transitions. [2025-03-17 04:35:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 04:35:48,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:35:48,162 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:48,170 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:35:48,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 04:35:48,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:35:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:35:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1901679711, now seen corresponding path program 1 times [2025-03-17 04:35:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:35:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734202565] [2025-03-17 04:35:48,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:35:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:48,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:48,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:48,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 42 proven. 99 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2025-03-17 04:35:49,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:35:49,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734202565] [2025-03-17 04:35:49,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734202565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:35:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589203540] [2025-03-17 04:35:49,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:35:49,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:35:49,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:35:49,893 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:35:49,896 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:35:49,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 04:35:50,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 04:35:50,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:35:50,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:35:50,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 04:35:50,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:35:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 1002 proven. 369 refuted. 0 times theorem prover too weak. 3141 trivial. 0 not checked. [2025-03-17 04:35:52,235 INFO L312 TraceCheckSpWp]: Computing backward predicates...