./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.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_fillercode_fillercodesize_ps-cn-250_file-3.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 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:04:12,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:04:12,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:04:12,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:04:12,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:04:12,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:04:12,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:04:12,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:04:12,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:04:12,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:04:12,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:04:12,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:04:12,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:04:12,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:04:12,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:04:12,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:04:12,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:04:12,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:04:12,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:04:12,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:04:12,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:04:12,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:04:12,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:04:12,972 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 -> 5435813e8a4ec120b68138e4f3d79279dd9250845bb50f86b902d431f8071ca4 [2025-03-17 00:04:13,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:04:13,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:04:13,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:04:13,380 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:04:13,381 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:04:13,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-17 00:04:15,093 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebc2dc01/ac203f0a62d34f249d2c3b2e925d03fd/FLAG687112f61 [2025-03-17 00:04:15,546 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:04:15,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-17 00:04:15,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebc2dc01/ac203f0a62d34f249d2c3b2e925d03fd/FLAG687112f61 [2025-03-17 00:04:15,698 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebc2dc01/ac203f0a62d34f249d2c3b2e925d03fd [2025-03-17 00:04:15,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:04:15,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:04:15,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:04:15,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:04:15,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:04:15,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:04:15" (1/1) ... [2025-03-17 00:04:15,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cd0b5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:15, skipping insertion in model container [2025-03-17 00:04:15,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:04:15" (1/1) ... [2025-03-17 00:04:15,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:04:15,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i[915,928] [2025-03-17 00:04:16,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:04:16,139 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:04:16,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-3.i[915,928] [2025-03-17 00:04:16,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:04:16,282 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:04:16,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16 WrapperNode [2025-03-17 00:04:16,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:04:16,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:04:16,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:04:16,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:04:16,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,326 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,418 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 581 [2025-03-17 00:04:16,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:04:16,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:04:16,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:04:16,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:04:16,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,499 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 00:04:16,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,552 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:04:16,565 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:04:16,565 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:04:16,565 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:04:16,572 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (1/1) ... [2025-03-17 00:04:16,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:04:16,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:04:16,610 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 00:04:16,612 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 00:04:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:04:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:04:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:04:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:04:16,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:04:16,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:04:16,742 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:04:16,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:04:17,602 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc property_#t~bitwise62#1;havoc property_#t~short63#1; [2025-03-17 00:04:17,792 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-17 00:04:17,793 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:04:17,840 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:04:17,841 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 00:04:17,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:04:17 BoogieIcfgContainer [2025-03-17 00:04:17,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:04:17,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:04:17,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:04:17,853 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:04:17,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:04:15" (1/3) ... [2025-03-17 00:04:17,854 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da189b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:04:17, skipping insertion in model container [2025-03-17 00:04:17,854 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:04:16" (2/3) ... [2025-03-17 00:04:17,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5da189b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:04:17, skipping insertion in model container [2025-03-17 00:04:17,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:04:17" (3/3) ... [2025-03-17 00:04:17,856 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i [2025-03-17 00:04:17,876 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:04:17,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-3.i that has 2 procedures, 249 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:04:17,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:04:17,998 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;@2fc988e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:04:18,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:04:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 160 states have (on average 1.525) internal successors, (244), 161 states have internal predecessors, (244), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:04:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:04:18,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:18,053 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:18,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:18,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:18,063 INFO L85 PathProgramCache]: Analyzing trace with hash 198432580, now seen corresponding path program 1 times [2025-03-17 00:04:18,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:18,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372547550] [2025-03-17 00:04:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:18,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:04:18,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:04:18,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:18,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-17 00:04:19,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372547550] [2025-03-17 00:04:19,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372547550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:04:19,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234258960] [2025-03-17 00:04:19,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:19,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:04:19,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:04:19,027 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 00:04:19,036 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 00:04:19,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:04:19,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:04:19,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:19,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:19,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:04:19,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:04:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-17 00:04:19,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:04:19,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234258960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:19,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:04:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:04:19,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839958632] [2025-03-17 00:04:19,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:04:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:19,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:04:19,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:04:19,648 INFO L87 Difference]: Start difference. First operand has 249 states, 160 states have (on average 1.525) internal successors, (244), 161 states have internal predecessors, (244), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-17 00:04:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:19,768 INFO L93 Difference]: Finished difference Result 495 states and 916 transitions. [2025-03-17 00:04:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:04:19,775 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 532 [2025-03-17 00:04:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:19,791 INFO L225 Difference]: With dead ends: 495 [2025-03-17 00:04:19,791 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 00:04:19,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 533 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 00:04:19,808 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:19,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:04:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 00:04:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2025-03-17 00:04:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 159 states have (on average 1.4968553459119496) internal successors, (238), 159 states have internal predecessors, (238), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:04:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 410 transitions. [2025-03-17 00:04:19,944 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 410 transitions. Word has length 532 [2025-03-17 00:04:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:19,946 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 410 transitions. [2025-03-17 00:04:19,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-17 00:04:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 410 transitions. [2025-03-17 00:04:19,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-17 00:04:19,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:19,965 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:19,984 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 00:04:20,169 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 00:04:20,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:20,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1634038210, now seen corresponding path program 1 times [2025-03-17 00:04:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:20,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956260376] [2025-03-17 00:04:20,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:20,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-03-17 00:04:20,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-03-17 00:04:20,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:20,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956260376] [2025-03-17 00:04:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956260376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:21,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:21,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:21,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211189074] [2025-03-17 00:04:21,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:21,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:21,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:21,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:21,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:21,516 INFO L87 Difference]: Start difference. First operand 247 states and 410 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:21,617 INFO L93 Difference]: Finished difference Result 494 states and 821 transitions. [2025-03-17 00:04:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:21,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 532 [2025-03-17 00:04:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:21,628 INFO L225 Difference]: With dead ends: 494 [2025-03-17 00:04:21,633 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 00:04:21,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:21,635 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:21,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 792 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 00:04:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2025-03-17 00:04:21,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 160 states have (on average 1.49375) internal successors, (239), 160 states have internal predecessors, (239), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 00:04:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 411 transitions. [2025-03-17 00:04:21,695 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 411 transitions. Word has length 532 [2025-03-17 00:04:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 411 transitions. [2025-03-17 00:04:21,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 411 transitions. [2025-03-17 00:04:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-03-17 00:04:21,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:21,717 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:21,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:04:21,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:21,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2078111497, now seen corresponding path program 1 times [2025-03-17 00:04:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605738385] [2025-03-17 00:04:21,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:21,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:21,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-03-17 00:04:21,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-03-17 00:04:21,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:21,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:22,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:22,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605738385] [2025-03-17 00:04:22,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605738385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:22,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:22,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:22,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009693021] [2025-03-17 00:04:22,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:22,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:22,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:22,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:22,895 INFO L87 Difference]: Start difference. First operand 248 states and 411 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:23,015 INFO L93 Difference]: Finished difference Result 742 states and 1231 transitions. [2025-03-17 00:04:23,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:23,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 534 [2025-03-17 00:04:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:23,023 INFO L225 Difference]: With dead ends: 742 [2025-03-17 00:04:23,023 INFO L226 Difference]: Without dead ends: 495 [2025-03-17 00:04:23,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:23,024 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 224 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:23,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 797 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:23,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-17 00:04:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2025-03-17 00:04:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 318 states have (on average 1.4842767295597483) internal successors, (472), 318 states have internal predecessors, (472), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-17 00:04:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 816 transitions. [2025-03-17 00:04:23,113 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 816 transitions. Word has length 534 [2025-03-17 00:04:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:23,115 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 816 transitions. [2025-03-17 00:04:23,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:23,115 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 816 transitions. [2025-03-17 00:04:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-17 00:04:23,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:23,122 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:23,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:04:23,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:23,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 490018449, now seen corresponding path program 1 times [2025-03-17 00:04:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:23,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131444964] [2025-03-17 00:04:23,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:23,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:23,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-17 00:04:23,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-17 00:04:23,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:23,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:23,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131444964] [2025-03-17 00:04:23,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131444964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:23,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:23,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479033162] [2025-03-17 00:04:23,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:23,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:23,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:23,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:23,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:23,461 INFO L87 Difference]: Start difference. First operand 493 states and 816 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:23,593 INFO L93 Difference]: Finished difference Result 1047 states and 1724 transitions. [2025-03-17 00:04:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:23,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 535 [2025-03-17 00:04:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:23,606 INFO L225 Difference]: With dead ends: 1047 [2025-03-17 00:04:23,607 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 00:04:23,608 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 00:04:23,615 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 40 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:23,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 814 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 00:04:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 511. [2025-03-17 00:04:23,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 336 states have (on average 1.4821428571428572) internal successors, (498), 336 states have internal predecessors, (498), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-17 00:04:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 842 transitions. [2025-03-17 00:04:23,785 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 842 transitions. Word has length 535 [2025-03-17 00:04:23,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 842 transitions. [2025-03-17 00:04:23,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 842 transitions. [2025-03-17 00:04:23,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-17 00:04:23,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:23,803 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:04:23,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:23,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 344253842, now seen corresponding path program 1 times [2025-03-17 00:04:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374486429] [2025-03-17 00:04:23,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:23,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:23,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-17 00:04:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-17 00:04:23,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:23,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:24,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:24,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374486429] [2025-03-17 00:04:24,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374486429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:24,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:24,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:04:24,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895748987] [2025-03-17 00:04:24,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:24,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:04:24,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:24,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:04:24,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:04:24,407 INFO L87 Difference]: Start difference. First operand 511 states and 842 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:24,623 INFO L93 Difference]: Finished difference Result 1523 states and 2514 transitions. [2025-03-17 00:04:24,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:04:24,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 535 [2025-03-17 00:04:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:24,640 INFO L225 Difference]: With dead ends: 1523 [2025-03-17 00:04:24,644 INFO L226 Difference]: Without dead ends: 1013 [2025-03-17 00:04:24,647 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 00:04:24,653 INFO L435 NwaCegarLoop]: 775 mSDtfsCounter, 396 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:24,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1154 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:04:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-17 00:04:24,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 1011. [2025-03-17 00:04:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 662 states have (on average 1.4773413897280967) internal successors, (978), 662 states have internal predecessors, (978), 344 states have call successors, (344), 4 states have call predecessors, (344), 4 states have return successors, (344), 344 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-17 00:04:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1666 transitions. [2025-03-17 00:04:24,971 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1666 transitions. Word has length 535 [2025-03-17 00:04:24,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:24,972 INFO L471 AbstractCegarLoop]: Abstraction has 1011 states and 1666 transitions. [2025-03-17 00:04:24,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:24,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1666 transitions. [2025-03-17 00:04:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:04:24,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:24,991 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:24,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:04:24,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:24,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2142324730, now seen corresponding path program 1 times [2025-03-17 00:04:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307621676] [2025-03-17 00:04:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:25,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:04:25,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:04:25,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:25,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:26,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307621676] [2025-03-17 00:04:26,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307621676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:26,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:04:26,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732207266] [2025-03-17 00:04:26,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:26,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:04:26,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:26,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:04:26,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:26,052 INFO L87 Difference]: Start difference. First operand 1011 states and 1666 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:26,400 INFO L93 Difference]: Finished difference Result 2583 states and 4260 transitions. [2025-03-17 00:04:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:04:26,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-17 00:04:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:26,420 INFO L225 Difference]: With dead ends: 2583 [2025-03-17 00:04:26,423 INFO L226 Difference]: Without dead ends: 1573 [2025-03-17 00:04:26,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 00:04:26,431 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 220 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:26,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1515 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:04:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-03-17 00:04:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1563. [2025-03-17 00:04:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1150 states have (on average 1.5426086956521738) internal successors, (1774), 1154 states have internal predecessors, (1774), 404 states have call successors, (404), 8 states have call predecessors, (404), 8 states have return successors, (404), 400 states have call predecessors, (404), 404 states have call successors, (404) [2025-03-17 00:04:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2582 transitions. [2025-03-17 00:04:26,715 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2582 transitions. Word has length 536 [2025-03-17 00:04:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:26,720 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2582 transitions. [2025-03-17 00:04:26,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:26,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2582 transitions. [2025-03-17 00:04:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:04:26,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:26,736 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:26,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:04:26,736 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:26,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:26,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1522183941, now seen corresponding path program 1 times [2025-03-17 00:04:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:26,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397970251] [2025-03-17 00:04:26,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:26,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:26,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:04:27,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:04:27,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:27,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:27,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397970251] [2025-03-17 00:04:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397970251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:27,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:04:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470775944] [2025-03-17 00:04:27,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:04:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:27,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:04:27,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:04:27,858 INFO L87 Difference]: Start difference. First operand 1563 states and 2582 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:28,823 INFO L93 Difference]: Finished difference Result 3915 states and 6470 transitions. [2025-03-17 00:04:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:04:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-17 00:04:28,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:28,867 INFO L225 Difference]: With dead ends: 3915 [2025-03-17 00:04:28,871 INFO L226 Difference]: Without dead ends: 3133 [2025-03-17 00:04:28,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:04:28,882 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 232 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:28,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 1754 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:04:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3133 states. [2025-03-17 00:04:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3133 to 3119. [2025-03-17 00:04:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 2294 states have (on average 1.5440278988666085) internal successors, (3542), 2302 states have internal predecessors, (3542), 808 states have call successors, (808), 16 states have call predecessors, (808), 16 states have return successors, (808), 800 states have call predecessors, (808), 808 states have call successors, (808) [2025-03-17 00:04:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 5158 transitions. [2025-03-17 00:04:29,505 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 5158 transitions. Word has length 536 [2025-03-17 00:04:29,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:29,510 INFO L471 AbstractCegarLoop]: Abstraction has 3119 states and 5158 transitions. [2025-03-17 00:04:29,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:29,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 5158 transitions. [2025-03-17 00:04:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:04:29,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:29,526 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:04:29,526 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:29,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:29,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1895965692, now seen corresponding path program 1 times [2025-03-17 00:04:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:29,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033782200] [2025-03-17 00:04:29,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:29,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:04:29,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:04:29,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:29,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033782200] [2025-03-17 00:04:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033782200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:31,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:31,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:04:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691790069] [2025-03-17 00:04:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:31,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:04:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:31,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:04:31,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:31,807 INFO L87 Difference]: Start difference. First operand 3119 states and 5158 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:32,753 INFO L93 Difference]: Finished difference Result 10553 states and 17365 transitions. [2025-03-17 00:04:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:04:32,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-17 00:04:32,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:32,795 INFO L225 Difference]: With dead ends: 10553 [2025-03-17 00:04:32,796 INFO L226 Difference]: Without dead ends: 7435 [2025-03-17 00:04:32,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:04:32,808 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 478 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:32,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1150 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:04:32,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2025-03-17 00:04:33,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 5483. [2025-03-17 00:04:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5483 states, 4202 states have (on average 1.5559257496430272) internal successors, (6538), 4226 states have internal predecessors, (6538), 1248 states have call successors, (1248), 32 states have call predecessors, (1248), 32 states have return successors, (1248), 1224 states have call predecessors, (1248), 1248 states have call successors, (1248) [2025-03-17 00:04:33,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5483 states to 5483 states and 9034 transitions. [2025-03-17 00:04:33,333 INFO L78 Accepts]: Start accepts. Automaton has 5483 states and 9034 transitions. Word has length 536 [2025-03-17 00:04:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:33,334 INFO L471 AbstractCegarLoop]: Abstraction has 5483 states and 9034 transitions. [2025-03-17 00:04:33,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-17 00:04:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 5483 states and 9034 transitions. [2025-03-17 00:04:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-17 00:04:33,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:33,344 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:33,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:04:33,344 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:33,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -673520707, now seen corresponding path program 1 times [2025-03-17 00:04:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:33,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897897166] [2025-03-17 00:04:33,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:33,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:33,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-17 00:04:33,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-17 00:04:33,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-17 00:04:34,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:34,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897897166] [2025-03-17 00:04:34,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897897166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:04:34,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:04:34,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 00:04:34,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686662439] [2025-03-17 00:04:34,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:04:34,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:04:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:34,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:04:34,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:04:34,258 INFO L87 Difference]: Start difference. First operand 5483 states and 9034 transitions. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-17 00:04:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:37,180 INFO L93 Difference]: Finished difference Result 33675 states and 55253 transitions. [2025-03-17 00:04:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 00:04:37,182 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 536 [2025-03-17 00:04:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:37,302 INFO L225 Difference]: With dead ends: 33675 [2025-03-17 00:04:37,302 INFO L226 Difference]: Without dead ends: 28193 [2025-03-17 00:04:37,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:04:37,332 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2968 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 734 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2968 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 734 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:37,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2968 Valid, 3073 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [734 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:04:37,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28193 states. [2025-03-17 00:04:38,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28193 to 12175. [2025-03-17 00:04:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12175 states, 9982 states have (on average 1.5778401122019636) internal successors, (15750), 10054 states have internal predecessors, (15750), 2096 states have call successors, (2096), 96 states have call predecessors, (2096), 96 states have return successors, (2096), 2024 states have call predecessors, (2096), 2096 states have call successors, (2096) [2025-03-17 00:04:38,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12175 states to 12175 states and 19942 transitions. [2025-03-17 00:04:38,812 INFO L78 Accepts]: Start accepts. Automaton has 12175 states and 19942 transitions. Word has length 536 [2025-03-17 00:04:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:38,816 INFO L471 AbstractCegarLoop]: Abstraction has 12175 states and 19942 transitions. [2025-03-17 00:04:38,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-17 00:04:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 12175 states and 19942 transitions. [2025-03-17 00:04:38,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-17 00:04:38,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:38,825 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:38,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:04:38,825 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:38,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 384423443, now seen corresponding path program 1 times [2025-03-17 00:04:38,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:38,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107848501] [2025-03-17 00:04:38,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:38,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:38,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-17 00:04:39,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-17 00:04:39,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:39,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 180 proven. 75 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-17 00:04:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107848501] [2025-03-17 00:04:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107848501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:04:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826730825] [2025-03-17 00:04:39,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:39,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:04:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:04:39,509 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 00:04:39,511 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 00:04:39,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-17 00:04:39,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-17 00:04:39,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:39,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:39,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:04:39,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:04:40,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3489 proven. 33 refuted. 0 times theorem prover too weak. 11098 trivial. 0 not checked. [2025-03-17 00:04:40,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:04:40,523 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 222 proven. 33 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-17 00:04:40,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826730825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:04:40,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:04:40,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-17 00:04:40,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901099313] [2025-03-17 00:04:40,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:04:40,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:04:40,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:40,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:04:40,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:04:40,525 INFO L87 Difference]: Start difference. First operand 12175 states and 19942 transitions. Second operand has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-17 00:04:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:42,373 INFO L93 Difference]: Finished difference Result 24621 states and 40131 transitions. [2025-03-17 00:04:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 00:04:42,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) Word has length 537 [2025-03-17 00:04:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:42,429 INFO L225 Difference]: With dead ends: 24621 [2025-03-17 00:04:42,429 INFO L226 Difference]: Without dead ends: 12447 [2025-03-17 00:04:42,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1091 GetRequests, 1071 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=285, Unknown=0, NotChecked=0, Total=420 [2025-03-17 00:04:42,463 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 1000 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 744 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:42,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 728 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:04:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2025-03-17 00:04:43,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 12271. [2025-03-17 00:04:43,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12271 states, 10054 states have (on average 1.549830913069425) internal successors, (15582), 10126 states have internal predecessors, (15582), 2096 states have call successors, (2096), 120 states have call predecessors, (2096), 120 states have return successors, (2096), 2024 states have call predecessors, (2096), 2096 states have call successors, (2096) [2025-03-17 00:04:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12271 states to 12271 states and 19774 transitions. [2025-03-17 00:04:43,557 INFO L78 Accepts]: Start accepts. Automaton has 12271 states and 19774 transitions. Word has length 537 [2025-03-17 00:04:43,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:04:43,558 INFO L471 AbstractCegarLoop]: Abstraction has 12271 states and 19774 transitions. [2025-03-17 00:04:43,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.0) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (124), 4 states have call predecessors, (124), 4 states have call successors, (124) [2025-03-17 00:04:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12271 states and 19774 transitions. [2025-03-17 00:04:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-17 00:04:43,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:04:43,567 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:04:43,579 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 00:04:43,770 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,SelfDestructingSolverStorable9 [2025-03-17 00:04:43,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:04:43,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:04:43,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1508089157, now seen corresponding path program 1 times [2025-03-17 00:04:43,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:04:43,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017171342] [2025-03-17 00:04:43,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:43,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:04:43,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-17 00:04:43,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-17 00:04:43,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:43,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:44,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 66 proven. 189 refuted. 0 times theorem prover too weak. 14365 trivial. 0 not checked. [2025-03-17 00:04:44,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:04:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017171342] [2025-03-17 00:04:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017171342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:04:44,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448957535] [2025-03-17 00:04:44,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:04:44,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:04:44,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:04:44,493 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 00:04:44,495 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 00:04:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-17 00:04:44,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-17 00:04:44,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:04:44,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:04:44,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 00:04:44,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:04:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 8580 proven. 240 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2025-03-17 00:04:45,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:04:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 264 proven. 243 refuted. 0 times theorem prover too weak. 14113 trivial. 0 not checked. [2025-03-17 00:04:46,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448957535] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:04:46,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:04:46,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 19 [2025-03-17 00:04:46,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450099913] [2025-03-17 00:04:46,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:04:46,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 00:04:46,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:04:46,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 00:04:46,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:04:46,240 INFO L87 Difference]: Start difference. First operand 12271 states and 19774 transitions. Second operand has 19 states, 19 states have (on average 12.947368421052632) internal successors, (246), 19 states have internal predecessors, (246), 6 states have call successors, (217), 3 states have call predecessors, (217), 7 states have return successors, (218), 6 states have call predecessors, (218), 6 states have call successors, (218) [2025-03-17 00:04:53,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:04:53,988 INFO L93 Difference]: Finished difference Result 66375 states and 105128 transitions. [2025-03-17 00:04:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-17 00:04:53,989 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.947368421052632) internal successors, (246), 19 states have internal predecessors, (246), 6 states have call successors, (217), 3 states have call predecessors, (217), 7 states have return successors, (218), 6 states have call predecessors, (218), 6 states have call successors, (218) Word has length 538 [2025-03-17 00:04:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:04:54,262 INFO L225 Difference]: With dead ends: 66375 [2025-03-17 00:04:54,262 INFO L226 Difference]: Without dead ends: 53465 [2025-03-17 00:04:54,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1173 GetRequests, 1076 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3442 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1958, Invalid=7548, Unknown=0, NotChecked=0, Total=9506 [2025-03-17 00:04:54,381 INFO L435 NwaCegarLoop]: 786 mSDtfsCounter, 2371 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 2511 mSolverCounterSat, 1636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2374 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 4147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1636 IncrementalHoareTripleChecker+Valid, 2511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:04:54,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2374 Valid, 3484 Invalid, 4147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1636 Valid, 2511 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-17 00:04:54,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53465 states. [2025-03-17 00:04:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53465 to 34087. [2025-03-17 00:04:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34087 states, 27694 states have (on average 1.5234346789918394) internal successors, (42190), 27918 states have internal predecessors, (42190), 5952 states have call successors, (5952), 440 states have call predecessors, (5952), 440 states have return successors, (5952), 5728 states have call predecessors, (5952), 5952 states have call successors, (5952) [2025-03-17 00:05:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34087 states to 34087 states and 54094 transitions. [2025-03-17 00:05:00,250 INFO L78 Accepts]: Start accepts. Automaton has 34087 states and 54094 transitions. Word has length 538 [2025-03-17 00:05:00,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:05:00,254 INFO L471 AbstractCegarLoop]: Abstraction has 34087 states and 54094 transitions. [2025-03-17 00:05:00,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.947368421052632) internal successors, (246), 19 states have internal predecessors, (246), 6 states have call successors, (217), 3 states have call predecessors, (217), 7 states have return successors, (218), 6 states have call predecessors, (218), 6 states have call successors, (218) [2025-03-17 00:05:00,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34087 states and 54094 transitions. [2025-03-17 00:05:00,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-17 00:05:00,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:05:00,277 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:05:00,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:05:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:05:00,478 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:05:00,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:05:00,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1622535307, now seen corresponding path program 1 times [2025-03-17 00:05:00,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:05:00,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540264337] [2025-03-17 00:05:00,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:05:00,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:05:00,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:05:00,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:00,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 360 proven. 387 refuted. 0 times theorem prover too weak. 13873 trivial. 0 not checked. [2025-03-17 00:05:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:05:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540264337] [2025-03-17 00:05:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540264337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:05:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011214695] [2025-03-17 00:05:05,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:05:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:05:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:05:05,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:05:05,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:05:05,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:05:05,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:05:05,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:05:05,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:05:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 00:05:05,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:05:08,373 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 3908 proven. 660 refuted. 0 times theorem prover too weak. 10052 trivial. 0 not checked. [2025-03-17 00:05:08,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:05:10,964 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 87 proven. 669 refuted. 0 times theorem prover too weak. 13864 trivial. 0 not checked. [2025-03-17 00:05:10,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011214695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:05:10,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:05:10,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 38 [2025-03-17 00:05:10,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941080241] [2025-03-17 00:05:10,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:05:10,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-17 00:05:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:05:10,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-17 00:05:10,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2025-03-17 00:05:10,969 INFO L87 Difference]: Start difference. First operand 34087 states and 54094 transitions. Second operand has 38 states, 38 states have (on average 8.657894736842104) internal successors, (329), 38 states have internal predecessors, (329), 11 states have call successors, (244), 4 states have call predecessors, (244), 10 states have return successors, (246), 11 states have call predecessors, (246), 11 states have call successors, (246)