./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-44.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-44.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 cc3984a70cd12d1d8d9819c7a441be5e9fcf1734b23271ea13bfbb9a60a77e9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:06:02,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:06:02,370 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:06:02,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:06:02,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:06:02,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:06:02,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:06:02,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:06:02,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:06:02,401 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:06:02,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:06:02,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:06:02,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:06:02,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:06:02,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:06:02,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:06:02,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:06:02,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:06:02,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:06:02,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:06:02,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:06:02,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:02,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:06:02,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:06:02,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:06:02,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:06:02,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:06:02,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:06:02,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:06:02,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:06:02,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:06:02,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:06:02,406 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 -> cc3984a70cd12d1d8d9819c7a441be5e9fcf1734b23271ea13bfbb9a60a77e9c [2025-03-17 00:06:02,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:06:02,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:06:02,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:06:02,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:06:02,655 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:06:02,656 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-44.i [2025-03-17 00:06:03,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766556d0f/effb8ecd2ada4c2aa0f54872401d2e87/FLAG15f6bd610 [2025-03-17 00:06:04,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:06:04,186 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-44.i [2025-03-17 00:06:04,200 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766556d0f/effb8ecd2ada4c2aa0f54872401d2e87/FLAG15f6bd610 [2025-03-17 00:06:04,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766556d0f/effb8ecd2ada4c2aa0f54872401d2e87 [2025-03-17 00:06:04,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:06:04,221 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:06:04,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:04,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:06:04,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:06:04,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcfb4cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04, skipping insertion in model container [2025-03-17 00:06:04,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:06:04,379 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-44.i[916,929] [2025-03-17 00:06:04,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:04,489 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:06:04,504 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-44.i[916,929] [2025-03-17 00:06:04,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:06:04,587 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:06:04,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04 WrapperNode [2025-03-17 00:06:04,589 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:06:04,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:04,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:06:04,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:06:04,594 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:06:04" (1/1) ... [2025-03-17 00:06:04,610 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:06:04" (1/1) ... [2025-03-17 00:06:04,671 INFO L138 Inliner]: procedures = 26, calls = 94, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-17 00:06:04,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:06:04,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:06:04,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:06:04,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:06:04,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,720 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:06:04,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:06:04,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:06:04,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:06:04,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:06:04,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (1/1) ... [2025-03-17 00:06:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:06:04,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:04,784 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:06:04,786 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:06:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:06:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:06:04,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:06:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:06:04,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:06:04,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:06:04,891 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:06:04,893 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:06:05,470 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L459: havoc property_#t~bitwise54#1; [2025-03-17 00:06:05,588 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 00:06:05,588 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:06:05,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:06:05,613 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:06:05,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:05 BoogieIcfgContainer [2025-03-17 00:06:05,614 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:06:05,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:06:05,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:06:05,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:06:05,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:06:04" (1/3) ... [2025-03-17 00:06:05,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:05, skipping insertion in model container [2025-03-17 00:06:05,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:06:04" (2/3) ... [2025-03-17 00:06:05,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c2a844a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:06:05, skipping insertion in model container [2025-03-17 00:06:05,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:06:05" (3/3) ... [2025-03-17 00:06:05,623 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-44.i [2025-03-17 00:06:05,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:06:05,637 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-44.i that has 2 procedures, 218 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:06:05,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:06:05,705 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;@f0e1856, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:06:05,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:06:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 135 states have internal predecessors, (205), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:06:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-17 00:06:05,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:05,726 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:05,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:05,731 INFO L85 PathProgramCache]: Analyzing trace with hash 730801421, now seen corresponding path program 1 times [2025-03-17 00:06:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048421410] [2025-03-17 00:06:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:05,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-17 00:06:05,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-17 00:06:05,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:05,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-17 00:06:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048421410] [2025-03-17 00:06:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048421410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736342225] [2025-03-17 00:06:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:06,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:06,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:06,282 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:06:06,288 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:06:06,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-17 00:06:06,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-17 00:06:06,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:06,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:06,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:06:06,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:06,646 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 12800 trivial. 0 not checked. [2025-03-17 00:06:06,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:06:06,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736342225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:06,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:06:06,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:06:06,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511761086] [2025-03-17 00:06:06,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:06:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:06,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:06:06,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:06:06,674 INFO L87 Difference]: Start difference. First operand has 218 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 135 states have internal predecessors, (205), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:06,722 INFO L93 Difference]: Finished difference Result 429 states and 805 transitions. [2025-03-17 00:06:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:06:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) Word has length 495 [2025-03-17 00:06:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:06,733 INFO L225 Difference]: With dead ends: 429 [2025-03-17 00:06:06,733 INFO L226 Difference]: Without dead ends: 212 [2025-03-17 00:06:06,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 496 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:06:06,744 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:06,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 348 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-17 00:06:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-03-17 00:06:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 129 states have (on average 1.4806201550387597) internal successors, (191), 129 states have internal predecessors, (191), 81 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-17 00:06:06,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 353 transitions. [2025-03-17 00:06:06,816 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 353 transitions. Word has length 495 [2025-03-17 00:06:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:06,817 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 353 transitions. [2025-03-17 00:06:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (81), 2 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 2 states have call successors, (81) [2025-03-17 00:06:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 353 transitions. [2025-03-17 00:06:06,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2025-03-17 00:06:06,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:06,827 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:06,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:06:07,028 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:06:07,029 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:07,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2099467586, now seen corresponding path program 1 times [2025-03-17 00:06:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742519049] [2025-03-17 00:06:07,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 495 statements into 1 equivalence classes. [2025-03-17 00:06:07,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 495 of 495 statements. [2025-03-17 00:06:07,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:07,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:07,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:07,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742519049] [2025-03-17 00:06:07,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742519049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:07,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:07,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:07,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857426952] [2025-03-17 00:06:07,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:07,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:07,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:07,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:07,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:07,568 INFO L87 Difference]: Start difference. First operand 212 states and 353 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:07,663 INFO L93 Difference]: Finished difference Result 625 states and 1040 transitions. [2025-03-17 00:06:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:07,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 495 [2025-03-17 00:06:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:07,673 INFO L225 Difference]: With dead ends: 625 [2025-03-17 00:06:07,675 INFO L226 Difference]: Without dead ends: 414 [2025-03-17 00:06:07,677 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:06:07,677 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 339 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:07,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 990 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-03-17 00:06:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2025-03-17 00:06:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 246 states have (on average 1.4593495934959348) internal successors, (359), 246 states have internal predecessors, (359), 162 states have call successors, (162), 2 states have call predecessors, (162), 2 states have return successors, (162), 162 states have call predecessors, (162), 162 states have call successors, (162) [2025-03-17 00:06:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 683 transitions. [2025-03-17 00:06:07,765 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 683 transitions. Word has length 495 [2025-03-17 00:06:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:07,768 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 683 transitions. [2025-03-17 00:06:07,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 683 transitions. [2025-03-17 00:06:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:06:07,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:07,773 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:07,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:06:07,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:07,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 954334149, now seen corresponding path program 1 times [2025-03-17 00:06:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094400533] [2025-03-17 00:06:07,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:07,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:07,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:07,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:07,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:08,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:08,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:08,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094400533] [2025-03-17 00:06:08,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094400533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:08,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:08,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:08,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357556115] [2025-03-17 00:06:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:08,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:08,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:08,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:08,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:08,175 INFO L87 Difference]: Start difference. First operand 411 states and 683 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:08,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:08,257 INFO L93 Difference]: Finished difference Result 1039 states and 1716 transitions. [2025-03-17 00:06:08,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:08,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-17 00:06:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:08,268 INFO L225 Difference]: With dead ends: 1039 [2025-03-17 00:06:08,268 INFO L226 Difference]: Without dead ends: 629 [2025-03-17 00:06:08,272 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:06:08,273 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 169 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 785 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:08,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-17 00:06:08,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 625. [2025-03-17 00:06:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 382 states have (on average 1.4476439790575917) internal successors, (553), 384 states have internal predecessors, (553), 238 states have call successors, (238), 4 states have call predecessors, (238), 4 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 00:06:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1029 transitions. [2025-03-17 00:06:08,373 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1029 transitions. Word has length 496 [2025-03-17 00:06:08,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:08,376 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 1029 transitions. [2025-03-17 00:06:08,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1029 transitions. [2025-03-17 00:06:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:06:08,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:08,380 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:06:08,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1363158374, now seen corresponding path program 1 times [2025-03-17 00:06:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413746333] [2025-03-17 00:06:08,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:08,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:08,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:08,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:08,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413746333] [2025-03-17 00:06:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413746333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236852210] [2025-03-17 00:06:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:08,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:08,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:08,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:08,629 INFO L87 Difference]: Start difference. First operand 625 states and 1029 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:08,751 INFO L93 Difference]: Finished difference Result 1873 states and 3085 transitions. [2025-03-17 00:06:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-17 00:06:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:08,763 INFO L225 Difference]: With dead ends: 1873 [2025-03-17 00:06:08,764 INFO L226 Difference]: Without dead ends: 1249 [2025-03-17 00:06:08,768 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:06:08,769 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 327 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:08,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 724 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-17 00:06:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1247. [2025-03-17 00:06:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 762 states have (on average 1.4435695538057742) internal successors, (1100), 766 states have internal predecessors, (1100), 476 states have call successors, (476), 8 states have call predecessors, (476), 8 states have return successors, (476), 472 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-17 00:06:08,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 2052 transitions. [2025-03-17 00:06:08,916 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 2052 transitions. Word has length 496 [2025-03-17 00:06:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:08,917 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 2052 transitions. [2025-03-17 00:06:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2052 transitions. [2025-03-17 00:06:08,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:06:08,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:08,923 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:08,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:06:08,924 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:08,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:08,924 INFO L85 PathProgramCache]: Analyzing trace with hash 440474791, now seen corresponding path program 1 times [2025-03-17 00:06:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:08,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652365390] [2025-03-17 00:06:08,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:08,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:08,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:08,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:08,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:08,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:09,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:09,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652365390] [2025-03-17 00:06:09,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652365390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:09,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:09,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283820656] [2025-03-17 00:06:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:09,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:09,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:09,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:09,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:09,519 INFO L87 Difference]: Start difference. First operand 1247 states and 2052 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:10,189 INFO L93 Difference]: Finished difference Result 4263 states and 7023 transitions. [2025-03-17 00:06:10,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:06:10,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-17 00:06:10,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:10,215 INFO L225 Difference]: With dead ends: 4263 [2025-03-17 00:06:10,216 INFO L226 Difference]: Without dead ends: 3017 [2025-03-17 00:06:10,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:10,225 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 639 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:10,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 893 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:06:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3017 states. [2025-03-17 00:06:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3017 to 1377. [2025-03-17 00:06:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 892 states have (on average 1.5089686098654709) internal successors, (1346), 896 states have internal predecessors, (1346), 476 states have call successors, (476), 8 states have call predecessors, (476), 8 states have return successors, (476), 472 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-17 00:06:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2298 transitions. [2025-03-17 00:06:10,449 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2298 transitions. Word has length 496 [2025-03-17 00:06:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:10,450 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 2298 transitions. [2025-03-17 00:06:10,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2298 transitions. [2025-03-17 00:06:10,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:06:10,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:10,454 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:10,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:06:10,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:10,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash 62670373, now seen corresponding path program 1 times [2025-03-17 00:06:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:10,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911265408] [2025-03-17 00:06:10,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:10,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:10,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:10,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:10,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:10,910 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911265408] [2025-03-17 00:06:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911265408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893459828] [2025-03-17 00:06:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:10,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:10,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:10,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:10,912 INFO L87 Difference]: Start difference. First operand 1377 states and 2298 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:11,571 INFO L93 Difference]: Finished difference Result 4471 states and 7417 transitions. [2025-03-17 00:06:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:06:11,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 496 [2025-03-17 00:06:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:11,590 INFO L225 Difference]: With dead ends: 4471 [2025-03-17 00:06:11,590 INFO L226 Difference]: Without dead ends: 3095 [2025-03-17 00:06:11,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:11,596 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 620 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:11,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 913 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 00:06:11,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3095 states. [2025-03-17 00:06:11,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3095 to 1806. [2025-03-17 00:06:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1806 states, 1173 states have (on average 1.4970161977834613) internal successors, (1756), 1181 states have internal predecessors, (1756), 620 states have call successors, (620), 12 states have call predecessors, (620), 12 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2025-03-17 00:06:11,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 2996 transitions. [2025-03-17 00:06:11,899 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 2996 transitions. Word has length 496 [2025-03-17 00:06:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:11,900 INFO L471 AbstractCegarLoop]: Abstraction has 1806 states and 2996 transitions. [2025-03-17 00:06:11,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 2996 transitions. [2025-03-17 00:06:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-03-17 00:06:11,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:11,907 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:11,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:06:11,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash -934401980, now seen corresponding path program 1 times [2025-03-17 00:06:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:11,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034488478] [2025-03-17 00:06:11,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:11,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:11,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:12,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 165 proven. 75 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:12,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034488478] [2025-03-17 00:06:12,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034488478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:12,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193717579] [2025-03-17 00:06:12,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:12,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:12,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:12,481 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:06:12,483 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:06:12,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-03-17 00:06:12,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-03-17 00:06:12,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:12,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:12,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:06:12,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 2270 proven. 21 refuted. 0 times theorem prover too weak. 10669 trivial. 0 not checked. [2025-03-17 00:06:12,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:13,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193717579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:13,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:13,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 00:06:13,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997048533] [2025-03-17 00:06:13,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:13,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 00:06:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:13,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 00:06:13,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 00:06:13,239 INFO L87 Difference]: Start difference. First operand 1806 states and 2996 transitions. Second operand has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) [2025-03-17 00:06:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:13,977 INFO L93 Difference]: Finished difference Result 3605 states and 5920 transitions. [2025-03-17 00:06:13,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 00:06:13,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) Word has length 496 [2025-03-17 00:06:13,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:13,991 INFO L225 Difference]: With dead ends: 3605 [2025-03-17 00:06:13,991 INFO L226 Difference]: Without dead ends: 1800 [2025-03-17 00:06:13,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1004 GetRequests, 989 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:06:13,999 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 442 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:13,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 556 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:06:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1800 states. [2025-03-17 00:06:14,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1800 to 912. [2025-03-17 00:06:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 591 states have (on average 1.428087986463621) internal successors, (844), 595 states have internal predecessors, (844), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 306 states have call predecessors, (310), 310 states have call successors, (310) [2025-03-17 00:06:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1464 transitions. [2025-03-17 00:06:14,142 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1464 transitions. Word has length 496 [2025-03-17 00:06:14,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:14,144 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1464 transitions. [2025-03-17 00:06:14,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.77777777777778) internal successors, (160), 9 states have internal predecessors, (160), 4 states have call successors, (113), 2 states have call predecessors, (113), 4 states have return successors, (115), 4 states have call predecessors, (115), 4 states have call successors, (115) [2025-03-17 00:06:14,144 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1464 transitions. [2025-03-17 00:06:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-03-17 00:06:14,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:14,148 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:14,158 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:06:14,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 00:06:14,349 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:14,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:14,350 INFO L85 PathProgramCache]: Analyzing trace with hash 645669409, now seen corresponding path program 1 times [2025-03-17 00:06:14,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:14,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111744220] [2025-03-17 00:06:14,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:14,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:14,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-03-17 00:06:14,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-03-17 00:06:14,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:14,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:14,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:14,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:14,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111744220] [2025-03-17 00:06:14,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111744220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:14,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:14,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:06:14,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943430715] [2025-03-17 00:06:14,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:14,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:06:14,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:14,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:06:14,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:06:14,712 INFO L87 Difference]: Start difference. First operand 912 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:14,876 INFO L93 Difference]: Finished difference Result 2281 states and 3665 transitions. [2025-03-17 00:06:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:06:14,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 500 [2025-03-17 00:06:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:14,884 INFO L225 Difference]: With dead ends: 2281 [2025-03-17 00:06:14,884 INFO L226 Difference]: Without dead ends: 1370 [2025-03-17 00:06:14,887 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:06:14,887 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 190 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:14,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 731 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:06:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-03-17 00:06:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1366. [2025-03-17 00:06:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 885 states have (on average 1.4259887005649718) internal successors, (1262), 891 states have internal predecessors, (1262), 465 states have call successors, (465), 15 states have call predecessors, (465), 15 states have return successors, (465), 459 states have call predecessors, (465), 465 states have call successors, (465) [2025-03-17 00:06:15,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 2192 transitions. [2025-03-17 00:06:15,034 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 2192 transitions. Word has length 500 [2025-03-17 00:06:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:15,036 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 2192 transitions. [2025-03-17 00:06:15,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:15,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 2192 transitions. [2025-03-17 00:06:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 00:06:15,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:15,039 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:15,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:06:15,040 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:15,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash -64688737, now seen corresponding path program 1 times [2025-03-17 00:06:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:15,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674233813] [2025-03-17 00:06:15,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:15,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:15,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:15,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:15,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:15,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:15,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674233813] [2025-03-17 00:06:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674233813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:15,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:15,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:06:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265589049] [2025-03-17 00:06:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:06:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:15,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:06:15,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:15,724 INFO L87 Difference]: Start difference. First operand 1366 states and 2192 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:16,721 INFO L93 Difference]: Finished difference Result 5002 states and 8005 transitions. [2025-03-17 00:06:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:06:16,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 501 [2025-03-17 00:06:16,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:16,744 INFO L225 Difference]: With dead ends: 5002 [2025-03-17 00:06:16,744 INFO L226 Difference]: Without dead ends: 4091 [2025-03-17 00:06:16,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:16,750 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 800 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:16,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1016 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:06:16,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2025-03-17 00:06:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4007. [2025-03-17 00:06:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 2824 states have (on average 1.468484419263456) internal successors, (4147), 2854 states have internal predecessors, (4147), 1137 states have call successors, (1137), 45 states have call predecessors, (1137), 45 states have return successors, (1137), 1107 states have call predecessors, (1137), 1137 states have call successors, (1137) [2025-03-17 00:06:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6421 transitions. [2025-03-17 00:06:17,132 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6421 transitions. Word has length 501 [2025-03-17 00:06:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:17,132 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 6421 transitions. [2025-03-17 00:06:17,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6421 transitions. [2025-03-17 00:06:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 00:06:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:17,166 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:17,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:06:17,167 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:17,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:17,167 INFO L85 PathProgramCache]: Analyzing trace with hash -131695490, now seen corresponding path program 1 times [2025-03-17 00:06:17,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:17,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275627458] [2025-03-17 00:06:17,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:17,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:17,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:17,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:17,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:17,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12960 trivial. 0 not checked. [2025-03-17 00:06:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:17,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275627458] [2025-03-17 00:06:17,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275627458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:06:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:06:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:06:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712496968] [2025-03-17 00:06:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:06:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:06:17,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:17,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:06:17,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:06:17,526 INFO L87 Difference]: Start difference. First operand 4007 states and 6421 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:18,396 INFO L93 Difference]: Finished difference Result 7563 states and 12095 transitions. [2025-03-17 00:06:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:06:18,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) Word has length 501 [2025-03-17 00:06:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:18,430 INFO L225 Difference]: With dead ends: 7563 [2025-03-17 00:06:18,430 INFO L226 Difference]: Without dead ends: 4663 [2025-03-17 00:06:18,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:06:18,440 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 452 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:18,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1013 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2025-03-17 00:06:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4007. [2025-03-17 00:06:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4007 states, 2824 states have (on average 1.4677762039660056) internal successors, (4145), 2854 states have internal predecessors, (4145), 1137 states have call successors, (1137), 45 states have call predecessors, (1137), 45 states have return successors, (1137), 1107 states have call predecessors, (1137), 1137 states have call successors, (1137) [2025-03-17 00:06:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4007 states to 4007 states and 6419 transitions. [2025-03-17 00:06:18,847 INFO L78 Accepts]: Start accepts. Automaton has 4007 states and 6419 transitions. Word has length 501 [2025-03-17 00:06:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:18,848 INFO L471 AbstractCegarLoop]: Abstraction has 4007 states and 6419 transitions. [2025-03-17 00:06:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (81), 1 states have call predecessors, (81), 1 states have return successors, (81), 1 states have call predecessors, (81), 1 states have call successors, (81) [2025-03-17 00:06:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4007 states and 6419 transitions. [2025-03-17 00:06:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 00:06:18,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:18,854 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:18,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:06:18,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:18,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:18,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1329884509, now seen corresponding path program 1 times [2025-03-17 00:06:18,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:18,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495164051] [2025-03-17 00:06:18,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:18,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:19,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:19,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:19,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 111 proven. 129 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:19,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495164051] [2025-03-17 00:06:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495164051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:19,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603592773] [2025-03-17 00:06:19,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:19,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:19,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:19,377 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:06:19,379 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:06:19,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:19,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:19,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:19,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:19,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:06:19,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6518 proven. 129 refuted. 0 times theorem prover too weak. 6313 trivial. 0 not checked. [2025-03-17 00:06:20,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 111 proven. 129 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:20,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603592773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:20,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:20,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 00:06:20,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384732837] [2025-03-17 00:06:20,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:20,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:06:20,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:20,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:06:20,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:06:20,437 INFO L87 Difference]: Start difference. First operand 4007 states and 6419 transitions. Second operand has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-17 00:06:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:21,227 INFO L93 Difference]: Finished difference Result 7957 states and 12685 transitions. [2025-03-17 00:06:21,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:06:21,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 501 [2025-03-17 00:06:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:21,255 INFO L225 Difference]: With dead ends: 7957 [2025-03-17 00:06:21,255 INFO L226 Difference]: Without dead ends: 3951 [2025-03-17 00:06:21,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1009 GetRequests, 999 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:21,267 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 261 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:21,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 555 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:06:21,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2025-03-17 00:06:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 2825. [2025-03-17 00:06:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 1990 states have (on average 1.464824120603015) internal successors, (2915), 2009 states have internal predecessors, (2915), 799 states have call successors, (799), 35 states have call predecessors, (799), 35 states have return successors, (799), 780 states have call predecessors, (799), 799 states have call successors, (799) [2025-03-17 00:06:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4513 transitions. [2025-03-17 00:06:21,550 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4513 transitions. Word has length 501 [2025-03-17 00:06:21,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:21,551 INFO L471 AbstractCegarLoop]: Abstraction has 2825 states and 4513 transitions. [2025-03-17 00:06:21,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.428571428571429) internal successors, (108), 7 states have internal predecessors, (108), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-17 00:06:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4513 transitions. [2025-03-17 00:06:21,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-03-17 00:06:21,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:21,556 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:21,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 00:06:21,759 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:06:21,759 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:21,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:21,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1541235422, now seen corresponding path program 1 times [2025-03-17 00:06:21,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:21,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860732412] [2025-03-17 00:06:21,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:21,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:21,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:21,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:21,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:21,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:22,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 117 proven. 123 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:22,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860732412] [2025-03-17 00:06:22,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860732412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:22,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608585731] [2025-03-17 00:06:22,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:22,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:22,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:22,152 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:06:22,153 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:06:22,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-03-17 00:06:22,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-03-17 00:06:22,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:22,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:22,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 00:06:22,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4110 proven. 45 refuted. 0 times theorem prover too weak. 8805 trivial. 0 not checked. [2025-03-17 00:06:22,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 195 proven. 45 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608585731] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-03-17 00:06:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461162402] [2025-03-17 00:06:23,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 00:06:23,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:23,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 00:06:23,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:06:23,014 INFO L87 Difference]: Start difference. First operand 2825 states and 4513 transitions. Second operand has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) [2025-03-17 00:06:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:25,777 INFO L93 Difference]: Finished difference Result 9985 states and 15715 transitions. [2025-03-17 00:06:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 00:06:25,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) Word has length 501 [2025-03-17 00:06:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:25,813 INFO L225 Difference]: With dead ends: 9985 [2025-03-17 00:06:25,813 INFO L226 Difference]: Without dead ends: 7161 [2025-03-17 00:06:25,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 999 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=357, Invalid=833, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 00:06:25,825 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 897 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:25,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 1036 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:06:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7161 states. [2025-03-17 00:06:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7161 to 5063. [2025-03-17 00:06:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5063 states, 3436 states have (on average 1.3990104772991852) internal successors, (4807), 3477 states have internal predecessors, (4807), 1550 states have call successors, (1550), 76 states have call predecessors, (1550), 76 states have return successors, (1550), 1509 states have call predecessors, (1550), 1550 states have call successors, (1550) [2025-03-17 00:06:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5063 states to 5063 states and 7907 transitions. [2025-03-17 00:06:26,432 INFO L78 Accepts]: Start accepts. Automaton has 5063 states and 7907 transitions. Word has length 501 [2025-03-17 00:06:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:26,433 INFO L471 AbstractCegarLoop]: Abstraction has 5063 states and 7907 transitions. [2025-03-17 00:06:26,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.363636363636363) internal successors, (202), 11 states have internal predecessors, (202), 4 states have call successors, (137), 2 states have call predecessors, (137), 4 states have return successors, (139), 4 states have call predecessors, (139), 4 states have call successors, (139) [2025-03-17 00:06:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 5063 states and 7907 transitions. [2025-03-17 00:06:26,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 00:06:26,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:26,440 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:26,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 00:06:26,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:26,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:26,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1753553487, now seen corresponding path program 1 times [2025-03-17 00:06:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:26,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29896615] [2025-03-17 00:06:26,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:26,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:06:26,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:06:26,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:26,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:27,166 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29896615] [2025-03-17 00:06:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29896615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:27,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743716866] [2025-03-17 00:06:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:27,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:27,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:27,170 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:06:27,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 00:06:27,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:06:27,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:06:27,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:27,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:27,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:06:27,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4490 proven. 51 refuted. 0 times theorem prover too weak. 8419 trivial. 0 not checked. [2025-03-17 00:06:27,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:28,080 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743716866] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:28,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-03-17 00:06:28,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134270134] [2025-03-17 00:06:28,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:28,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:06:28,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:28,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:06:28,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:06:28,083 INFO L87 Difference]: Start difference. First operand 5063 states and 7907 transitions. Second operand has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-17 00:06:29,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:29,046 INFO L93 Difference]: Finished difference Result 10371 states and 16119 transitions. [2025-03-17 00:06:29,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 00:06:29,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) Word has length 502 [2025-03-17 00:06:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:29,100 INFO L225 Difference]: With dead ends: 10371 [2025-03-17 00:06:29,100 INFO L226 Difference]: Without dead ends: 5309 [2025-03-17 00:06:29,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1015 GetRequests, 998 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-17 00:06:29,110 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 323 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:29,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1235 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:06:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2025-03-17 00:06:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 5175. [2025-03-17 00:06:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 3542 states have (on average 1.3932806324110671) internal successors, (4935), 3583 states have internal predecessors, (4935), 1550 states have call successors, (1550), 82 states have call predecessors, (1550), 82 states have return successors, (1550), 1509 states have call predecessors, (1550), 1550 states have call successors, (1550) [2025-03-17 00:06:29,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 8035 transitions. [2025-03-17 00:06:29,753 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 8035 transitions. Word has length 502 [2025-03-17 00:06:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:29,754 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 8035 transitions. [2025-03-17 00:06:29,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.75) internal successors, (153), 12 states have internal predecessors, (153), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-17 00:06:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 8035 transitions. [2025-03-17 00:06:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-17 00:06:29,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:29,763 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:29,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 00:06:29,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 00:06:29,967 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash 154256352, now seen corresponding path program 1 times [2025-03-17 00:06:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:29,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440683450] [2025-03-17 00:06:29,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:29,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:29,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:06:30,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:06:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 123 proven. 117 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:31,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440683450] [2025-03-17 00:06:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440683450] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:31,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336635006] [2025-03-17 00:06:31,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:31,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:31,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:31,092 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:06:31,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 00:06:31,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-17 00:06:31,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-17 00:06:31,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:31,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:31,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 1110 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 00:06:31,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4571 proven. 93 refuted. 0 times theorem prover too weak. 8296 trivial. 0 not checked. [2025-03-17 00:06:31,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:32,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 381 proven. 96 refuted. 0 times theorem prover too weak. 12483 trivial. 0 not checked. [2025-03-17 00:06:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336635006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:32,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:32,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2025-03-17 00:06:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600552804] [2025-03-17 00:06:32,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:32,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 00:06:32,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:32,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 00:06:32,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-17 00:06:32,392 INFO L87 Difference]: Start difference. First operand 5175 states and 8035 transitions. Second operand has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 23 states have internal predecessors, (216), 6 states have call successors, (137), 3 states have call predecessors, (137), 7 states have return successors, (139), 6 states have call predecessors, (139), 6 states have call successors, (139) [2025-03-17 00:06:34,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:34,961 INFO L93 Difference]: Finished difference Result 11988 states and 18486 transitions. [2025-03-17 00:06:34,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-17 00:06:34,961 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 23 states have internal predecessors, (216), 6 states have call successors, (137), 3 states have call predecessors, (137), 7 states have return successors, (139), 6 states have call predecessors, (139), 6 states have call successors, (139) Word has length 502 [2025-03-17 00:06:34,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:34,991 INFO L225 Difference]: With dead ends: 11988 [2025-03-17 00:06:34,991 INFO L226 Difference]: Without dead ends: 6667 [2025-03-17 00:06:35,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1045 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=649, Invalid=2003, Unknown=0, NotChecked=0, Total=2652 [2025-03-17 00:06:35,042 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 1053 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 2436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:35,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1717 Invalid, 2436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [657 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 00:06:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6667 states. [2025-03-17 00:06:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6667 to 5340. [2025-03-17 00:06:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5340 states, 3707 states have (on average 1.403560830860534) internal successors, (5203), 3748 states have internal predecessors, (5203), 1544 states have call successors, (1544), 88 states have call predecessors, (1544), 88 states have return successors, (1544), 1503 states have call predecessors, (1544), 1544 states have call successors, (1544) [2025-03-17 00:06:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5340 states to 5340 states and 8291 transitions. [2025-03-17 00:06:35,942 INFO L78 Accepts]: Start accepts. Automaton has 5340 states and 8291 transitions. Word has length 502 [2025-03-17 00:06:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:35,943 INFO L471 AbstractCegarLoop]: Abstraction has 5340 states and 8291 transitions. [2025-03-17 00:06:35,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.391304347826088) internal successors, (216), 23 states have internal predecessors, (216), 6 states have call successors, (137), 3 states have call predecessors, (137), 7 states have return successors, (139), 6 states have call predecessors, (139), 6 states have call successors, (139) [2025-03-17 00:06:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 5340 states and 8291 transitions. [2025-03-17 00:06:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-17 00:06:35,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:35,951 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:35,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 00:06:36,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:36,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:36,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash 455492976, now seen corresponding path program 1 times [2025-03-17 00:06:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191361644] [2025-03-17 00:06:36,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:36,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:36,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:36,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:36,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:36,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 123 proven. 117 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:37,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191361644] [2025-03-17 00:06:37,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191361644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:37,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137611664] [2025-03-17 00:06:37,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:37,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:37,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:37,018 INFO L229 MonitoredProcess]: Starting monitored process 8 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:06:37,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 00:06:37,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:37,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:37,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:37,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:37,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 00:06:37,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6558 proven. 117 refuted. 0 times theorem prover too weak. 6285 trivial. 0 not checked. [2025-03-17 00:06:37,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 123 proven. 117 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137611664] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:38,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 19 [2025-03-17 00:06:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759405245] [2025-03-17 00:06:38,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:38,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 00:06:38,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:38,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 00:06:38,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-17 00:06:38,354 INFO L87 Difference]: Start difference. First operand 5340 states and 8291 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 2 states have call predecessors, (121), 2 states have call successors, (121) [2025-03-17 00:06:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:43,193 INFO L93 Difference]: Finished difference Result 21325 states and 32726 transitions. [2025-03-17 00:06:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-17 00:06:43,193 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 2 states have call predecessors, (121), 2 states have call successors, (121) Word has length 503 [2025-03-17 00:06:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:43,260 INFO L225 Difference]: With dead ends: 21325 [2025-03-17 00:06:43,260 INFO L226 Difference]: Without dead ends: 14254 [2025-03-17 00:06:43,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 1000 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1150, Invalid=4400, Unknown=0, NotChecked=0, Total=5550 [2025-03-17 00:06:43,284 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2011 mSDsluCounter, 2506 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2087 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 3312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:43,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2087 Valid, 2923 Invalid, 3312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 00:06:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14254 states. [2025-03-17 00:06:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14254 to 3850. [2025-03-17 00:06:44,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 2651 states have (on average 1.3828743870237645) internal successors, (3666), 2678 states have internal predecessors, (3666), 1122 states have call successors, (1122), 76 states have call predecessors, (1122), 76 states have return successors, (1122), 1095 states have call predecessors, (1122), 1122 states have call successors, (1122) [2025-03-17 00:06:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 5910 transitions. [2025-03-17 00:06:44,227 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 5910 transitions. Word has length 503 [2025-03-17 00:06:44,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:44,228 INFO L471 AbstractCegarLoop]: Abstraction has 3850 states and 5910 transitions. [2025-03-17 00:06:44,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 2 states have call successors, (120), 2 states have call predecessors, (120), 4 states have return successors, (121), 2 states have call predecessors, (121), 2 states have call successors, (121) [2025-03-17 00:06:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 5910 transitions. [2025-03-17 00:06:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-17 00:06:44,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:44,235 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:44,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 00:06:44,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:44,437 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:44,439 INFO L85 PathProgramCache]: Analyzing trace with hash -727854321, now seen corresponding path program 1 times [2025-03-17 00:06:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17300779] [2025-03-17 00:06:44,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:44,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:44,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:44,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:44,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:45,343 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:45,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:06:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17300779] [2025-03-17 00:06:45,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17300779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:06:45,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263984415] [2025-03-17 00:06:45,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:45,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:45,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:45,347 INFO L229 MonitoredProcess]: Starting monitored process 9 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:06:45,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 00:06:45,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:45,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:45,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 00:06:45,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 4490 proven. 51 refuted. 0 times theorem prover too weak. 8419 trivial. 0 not checked. [2025-03-17 00:06:45,868 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:06:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 189 proven. 51 refuted. 0 times theorem prover too weak. 12720 trivial. 0 not checked. [2025-03-17 00:06:46,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263984415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:06:46,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:06:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 15 [2025-03-17 00:06:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379884149] [2025-03-17 00:06:46,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:06:46,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 00:06:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:06:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 00:06:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:06:46,301 INFO L87 Difference]: Start difference. First operand 3850 states and 5910 transitions. Second operand has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-17 00:06:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:06:57,038 INFO L93 Difference]: Finished difference Result 28204 states and 42473 transitions. [2025-03-17 00:06:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-03-17 00:06:57,039 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) Word has length 503 [2025-03-17 00:06:57,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:06:57,169 INFO L225 Difference]: With dead ends: 28204 [2025-03-17 00:06:57,170 INFO L226 Difference]: Without dead ends: 24355 [2025-03-17 00:06:57,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1164 GetRequests, 1022 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8254 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3341, Invalid=16965, Unknown=0, NotChecked=0, Total=20306 [2025-03-17 00:06:57,198 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 5236 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 3683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5372 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 6626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3683 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:06:57,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5372 Valid, 1789 Invalid, 6626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3683 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 00:06:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24355 states. [2025-03-17 00:06:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24355 to 2998. [2025-03-17 00:06:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2229 states have (on average 1.3907581875280395) internal successors, (3100), 2241 states have internal predecessors, (3100), 697 states have call successors, (697), 71 states have call predecessors, (697), 71 states have return successors, (697), 685 states have call predecessors, (697), 697 states have call successors, (697) [2025-03-17 00:06:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 4494 transitions. [2025-03-17 00:06:58,349 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 4494 transitions. Word has length 503 [2025-03-17 00:06:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:06:58,350 INFO L471 AbstractCegarLoop]: Abstraction has 2998 states and 4494 transitions. [2025-03-17 00:06:58,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 3 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 3 states have call predecessors, (116), 3 states have call successors, (116) [2025-03-17 00:06:58,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 4494 transitions. [2025-03-17 00:06:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-17 00:06:58,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:06:58,356 INFO L218 NwaCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:58,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 00:06:58,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 00:06:58,558 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:06:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:06:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -48948714, now seen corresponding path program 1 times [2025-03-17 00:06:58,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:06:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747612027] [2025-03-17 00:06:58,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:06:58,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:58,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:58,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:58,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:06:58,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189973817] [2025-03-17 00:06:58,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:06:58,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:06:58,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:06:58,735 INFO L229 MonitoredProcess]: Starting monitored process 10 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:06:58,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 00:06:58,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-17 00:06:59,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-17 00:06:59,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:06:59,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:06:59,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 00:06:59,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:06:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12960 backedges. 6428 proven. 102 refuted. 0 times theorem prover too weak. 6430 trivial. 0 not checked. [2025-03-17 00:06:59,972 INFO L312 TraceCheckSpWp]: Computing backward predicates...