./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.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 de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:24:08,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:24:08,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:24:08,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:24:08,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:24:08,751 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:24:08,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:24:08,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:24:08,753 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:24:08,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:24:08,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:24:08,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:24:08,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:24:08,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:24:08,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:24:08,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:08,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:24:08,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:24:08,756 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 -> de52c08fb0028bef519c22f81b06d40dd6144270e7f5fea59e5bb117b888da23 [2025-03-08 15:24:08,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:24:08,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:24:08,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:24:08,977 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:24:08,978 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:24:08,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-08 15:24:10,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fd471cb/52e23768996f49a5ab7516350c962feb/FLAG6812b8e23 [2025-03-08 15:24:10,468 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:24:10,470 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i [2025-03-08 15:24:10,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fd471cb/52e23768996f49a5ab7516350c962feb/FLAG6812b8e23 [2025-03-08 15:24:10,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8fd471cb/52e23768996f49a5ab7516350c962feb [2025-03-08 15:24:10,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:24:10,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:24:10,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:10,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:24:10,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:24:10,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:10" (1/1) ... [2025-03-08 15:24:10,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5513b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:10, skipping insertion in model container [2025-03-08 15:24:10,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:10" (1/1) ... [2025-03-08 15:24:10,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:24:10,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-08 15:24:10,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:10,998 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:24:11,005 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-56.i[916,929] [2025-03-08 15:24:11,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:11,054 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:24:11,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11 WrapperNode [2025-03-08 15:24:11,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:11,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:11,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:24:11,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:24:11,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,102 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 367 [2025-03-08 15:24:11,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:11,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:24:11,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:24:11,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:24:11,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,141 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-08 15:24:11,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,185 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:24:11,196 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:24:11,196 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:24:11,196 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:24:11,197 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (1/1) ... [2025-03-08 15:24:11,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:11,221 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-08 15:24:11,226 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-08 15:24:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:24:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:24:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:24:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:24:11,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:24:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:24:11,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:24:11,317 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:24:11,818 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc property_#t~bitwise34#1;havoc property_#t~short35#1; [2025-03-08 15:24:11,871 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-08 15:24:11,872 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:24:11,891 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:24:11,895 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:24:11,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:11 BoogieIcfgContainer [2025-03-08 15:24:11,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:24:11,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:24:11,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:24:11,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:24:11,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:24:10" (1/3) ... [2025-03-08 15:24:11,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214339a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:11, skipping insertion in model container [2025-03-08 15:24:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:11" (2/3) ... [2025-03-08 15:24:11,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@214339a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:11, skipping insertion in model container [2025-03-08 15:24:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:11" (3/3) ... [2025-03-08 15:24:11,906 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-56.i [2025-03-08 15:24:11,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:24:11,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-56.i that has 2 procedures, 156 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:24:11,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:24:11,972 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;@1d17c2ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:24:11,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:24:11,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 15:24:11,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 15:24:11,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:11,992 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:11,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -681760163, now seen corresponding path program 1 times [2025-03-08 15:24:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034894711] [2025-03-08 15:24:12,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:12,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:12,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 15:24:12,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 15:24:12,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:12,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:12,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 15:24:12,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:12,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034894711] [2025-03-08 15:24:12,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034894711] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:12,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975072264] [2025-03-08 15:24:12,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:12,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:12,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:12,463 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-08 15:24:12,465 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-08 15:24:12,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 15:24:12,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 15:24:12,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:12,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:12,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 748 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:24:12,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 4802 trivial. 0 not checked. [2025-03-08 15:24:12,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:24:12,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975072264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:12,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:24:12,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:24:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640086973] [2025-03-08 15:24:12,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:12,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:24:12,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:12,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:24:12,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:12,760 INFO L87 Difference]: Start difference. First operand has 156 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:12,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:12,792 INFO L93 Difference]: Finished difference Result 303 states and 543 transitions. [2025-03-08 15:24:12,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:24:12,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 324 [2025-03-08 15:24:12,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:12,800 INFO L225 Difference]: With dead ends: 303 [2025-03-08 15:24:12,800 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 15:24:12,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 325 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-08 15:24:12,805 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:12,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 15:24:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-03-08 15:24:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 98 states have internal predecessors, (140), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 15:24:12,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 240 transitions. [2025-03-08 15:24:12,852 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 240 transitions. Word has length 324 [2025-03-08 15:24:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:12,852 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 240 transitions. [2025-03-08 15:24:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 39.5) internal successors, (79), 2 states have internal predecessors, (79), 2 states have call successors, (50), 2 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 240 transitions. [2025-03-08 15:24:12,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 15:24:12,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:12,856 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:12,867 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-08 15:24:13,063 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-08 15:24:13,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:13,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:13,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2032726745, now seen corresponding path program 1 times [2025-03-08 15:24:13,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:13,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145992179] [2025-03-08 15:24:13,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:13,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 15:24:13,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 15:24:13,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:13,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:13,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:13,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145992179] [2025-03-08 15:24:13,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145992179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475583980] [2025-03-08 15:24:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:13,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:13,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:13,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:13,384 INFO L87 Difference]: Start difference. First operand 150 states and 240 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:13,531 INFO L93 Difference]: Finished difference Result 438 states and 703 transitions. [2025-03-08 15:24:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-03-08 15:24:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:13,535 INFO L225 Difference]: With dead ends: 438 [2025-03-08 15:24:13,538 INFO L226 Difference]: Without dead ends: 291 [2025-03-08 15:24:13,539 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-08 15:24:13,541 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 211 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:13,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 620 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-08 15:24:13,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 190. [2025-03-08 15:24:13,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 138 states have internal predecessors, (205), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 15:24:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 305 transitions. [2025-03-08 15:24:13,573 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 305 transitions. Word has length 324 [2025-03-08 15:24:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:13,575 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 305 transitions. [2025-03-08 15:24:13,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 305 transitions. [2025-03-08 15:24:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-08 15:24:13,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:13,582 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:24:13,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -82426490, now seen corresponding path program 1 times [2025-03-08 15:24:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399912451] [2025-03-08 15:24:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:13,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-03-08 15:24:13,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-03-08 15:24:13,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:13,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:13,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:13,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:13,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399912451] [2025-03-08 15:24:13,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399912451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:13,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:13,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:13,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332235877] [2025-03-08 15:24:13,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:13,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:13,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:13,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:13,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:13,830 INFO L87 Difference]: Start difference. First operand 190 states and 305 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:13,915 INFO L93 Difference]: Finished difference Result 560 states and 901 transitions. [2025-03-08 15:24:13,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:13,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 324 [2025-03-08 15:24:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:13,922 INFO L225 Difference]: With dead ends: 560 [2025-03-08 15:24:13,922 INFO L226 Difference]: Without dead ends: 373 [2025-03-08 15:24:13,924 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-08 15:24:13,924 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 214 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:13,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 445 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:24:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-08 15:24:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 247. [2025-03-08 15:24:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 15:24:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 396 transitions. [2025-03-08 15:24:13,951 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 396 transitions. Word has length 324 [2025-03-08 15:24:13,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:13,952 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 396 transitions. [2025-03-08 15:24:13,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 396 transitions. [2025-03-08 15:24:13,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:13,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:13,956 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:13,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:24:13,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:13,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:13,956 INFO L85 PathProgramCache]: Analyzing trace with hash -983359990, now seen corresponding path program 1 times [2025-03-08 15:24:13,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575032755] [2025-03-08 15:24:13,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:13,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:13,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:14,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:14,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:14,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:14,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575032755] [2025-03-08 15:24:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575032755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:14,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:14,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:14,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700680767] [2025-03-08 15:24:14,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:14,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:14,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:14,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:14,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:14,685 INFO L87 Difference]: Start difference. First operand 247 states and 396 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:15,088 INFO L93 Difference]: Finished difference Result 791 states and 1261 transitions. [2025-03-08 15:24:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-08 15:24:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:15,094 INFO L225 Difference]: With dead ends: 791 [2025-03-08 15:24:15,094 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 15:24:15,096 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-08 15:24:15,097 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 410 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:15,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 744 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:15,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 15:24:15,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-08 15:24:15,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.530503978779841) internal successors, (577), 378 states have internal predecessors, (577), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:24:15,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 749 transitions. [2025-03-08 15:24:15,141 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 749 transitions. Word has length 325 [2025-03-08 15:24:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:15,143 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 749 transitions. [2025-03-08 15:24:15,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:15,144 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 749 transitions. [2025-03-08 15:24:15,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:15,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:15,148 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:15,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:24:15,148 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:15,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:15,149 INFO L85 PathProgramCache]: Analyzing trace with hash 649444009, now seen corresponding path program 1 times [2025-03-08 15:24:15,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:15,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356541458] [2025-03-08 15:24:15,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:15,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:15,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:15,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:15,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356541458] [2025-03-08 15:24:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356541458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921465458] [2025-03-08 15:24:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:16,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:16,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:16,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:16,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:16,007 INFO L87 Difference]: Start difference. First operand 466 states and 749 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:16,420 INFO L93 Difference]: Finished difference Result 1010 states and 1613 transitions. [2025-03-08 15:24:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:16,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-08 15:24:16,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:16,426 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 15:24:16,426 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 15:24:16,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:16,428 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 370 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:16,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 889 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 15:24:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-08 15:24:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5172413793103448) internal successors, (572), 378 states have internal predecessors, (572), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:24:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 744 transitions. [2025-03-08 15:24:16,459 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 744 transitions. Word has length 325 [2025-03-08 15:24:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:16,461 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 744 transitions. [2025-03-08 15:24:16,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 744 transitions. [2025-03-08 15:24:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:16,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:16,466 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:16,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:24:16,468 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:16,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:16,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1920042390, now seen corresponding path program 1 times [2025-03-08 15:24:16,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:16,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155171201] [2025-03-08 15:24:16,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:16,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:16,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:16,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:16,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:16,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155171201] [2025-03-08 15:24:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155171201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008513681] [2025-03-08 15:24:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:17,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:17,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:17,192 INFO L87 Difference]: Start difference. First operand 466 states and 744 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:17,631 INFO L93 Difference]: Finished difference Result 1010 states and 1603 transitions. [2025-03-08 15:24:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-08 15:24:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:17,635 INFO L225 Difference]: With dead ends: 1010 [2025-03-08 15:24:17,635 INFO L226 Difference]: Without dead ends: 547 [2025-03-08 15:24:17,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:17,636 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 451 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:17,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 865 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-08 15:24:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 466. [2025-03-08 15:24:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 377 states have (on average 1.5145888594164456) internal successors, (571), 378 states have internal predecessors, (571), 86 states have call successors, (86), 2 states have call predecessors, (86), 2 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-08 15:24:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 743 transitions. [2025-03-08 15:24:17,675 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 743 transitions. Word has length 325 [2025-03-08 15:24:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:17,676 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 743 transitions. [2025-03-08 15:24:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 743 transitions. [2025-03-08 15:24:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:17,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:17,680 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:17,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:24:17,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1569242453, now seen corresponding path program 1 times [2025-03-08 15:24:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431002887] [2025-03-08 15:24:17,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:17,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:17,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:17,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:17,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:19,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:19,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431002887] [2025-03-08 15:24:19,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431002887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:19,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:19,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 15:24:19,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504633933] [2025-03-08 15:24:19,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:24:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:19,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:24:19,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:24:19,145 INFO L87 Difference]: Start difference. First operand 466 states and 743 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:23,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:24:27,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:24:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:28,829 INFO L93 Difference]: Finished difference Result 2043 states and 3254 transitions. [2025-03-08 15:24:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:24:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-03-08 15:24:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:28,839 INFO L225 Difference]: With dead ends: 2043 [2025-03-08 15:24:28,839 INFO L226 Difference]: Without dead ends: 1580 [2025-03-08 15:24:28,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:24:28,842 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 772 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 251 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:28,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1382 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 966 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2025-03-08 15:24:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-03-08 15:24:28,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1559. [2025-03-08 15:24:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1206 states have (on average 1.494195688225539) internal successors, (1802), 1210 states have internal predecessors, (1802), 344 states have call successors, (344), 8 states have call predecessors, (344), 8 states have return successors, (344), 340 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-08 15:24:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2490 transitions. [2025-03-08 15:24:28,956 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2490 transitions. Word has length 325 [2025-03-08 15:24:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:28,957 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2490 transitions. [2025-03-08 15:24:28,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2490 transitions. [2025-03-08 15:24:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:28,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:28,961 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:28,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:24:28,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:28,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:28,962 INFO L85 PathProgramCache]: Analyzing trace with hash 857044838, now seen corresponding path program 1 times [2025-03-08 15:24:28,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177902397] [2025-03-08 15:24:28,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:28,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:29,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:29,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:29,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177902397] [2025-03-08 15:24:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177902397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:24:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520182247] [2025-03-08 15:24:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:30,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:24:30,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:30,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:24:30,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:24:30,167 INFO L87 Difference]: Start difference. First operand 1559 states and 2490 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:31,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:31,324 INFO L93 Difference]: Finished difference Result 3855 states and 6155 transitions. [2025-03-08 15:24:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:31,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 325 [2025-03-08 15:24:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:31,336 INFO L225 Difference]: With dead ends: 3855 [2025-03-08 15:24:31,336 INFO L226 Difference]: Without dead ends: 2299 [2025-03-08 15:24:31,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:24:31,342 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 548 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:31,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 996 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:24:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2025-03-08 15:24:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2285. [2025-03-08 15:24:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 1756 states have (on average 1.4908883826879271) internal successors, (2618), 1762 states have internal predecessors, (2618), 516 states have call successors, (516), 12 states have call predecessors, (516), 12 states have return successors, (516), 510 states have call predecessors, (516), 516 states have call successors, (516) [2025-03-08 15:24:31,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3650 transitions. [2025-03-08 15:24:31,488 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3650 transitions. Word has length 325 [2025-03-08 15:24:31,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:31,489 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3650 transitions. [2025-03-08 15:24:31,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2025-03-08 15:24:31,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3650 transitions. [2025-03-08 15:24:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:31,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:31,495 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:24:31,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:31,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:31,495 INFO L85 PathProgramCache]: Analyzing trace with hash 478220009, now seen corresponding path program 1 times [2025-03-08 15:24:31,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700304792] [2025-03-08 15:24:31,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:31,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:31,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:31,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:31,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700304792] [2025-03-08 15:24:31,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700304792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:31,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:31,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:31,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250899456] [2025-03-08 15:24:31,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:31,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:31,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:31,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:31,903 INFO L87 Difference]: Start difference. First operand 2285 states and 3650 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:32,360 INFO L93 Difference]: Finished difference Result 4918 states and 7834 transitions. [2025-03-08 15:24:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:32,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-08 15:24:32,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:32,374 INFO L225 Difference]: With dead ends: 4918 [2025-03-08 15:24:32,374 INFO L226 Difference]: Without dead ends: 2636 [2025-03-08 15:24:32,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-08 15:24:32,381 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 430 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:32,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 1027 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:24:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-08 15:24:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2459. [2025-03-08 15:24:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2459 states, 1828 states have (on average 1.4715536105032823) internal successors, (2690), 1835 states have internal predecessors, (2690), 612 states have call successors, (612), 18 states have call predecessors, (612), 18 states have return successors, (612), 605 states have call predecessors, (612), 612 states have call successors, (612) [2025-03-08 15:24:32,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 3914 transitions. [2025-03-08 15:24:32,536 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 3914 transitions. Word has length 325 [2025-03-08 15:24:32,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:32,537 INFO L471 AbstractCegarLoop]: Abstraction has 2459 states and 3914 transitions. [2025-03-08 15:24:32,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:32,537 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 3914 transitions. [2025-03-08 15:24:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2025-03-08 15:24:32,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:32,540 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:32,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:24:32,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:32,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:32,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2111024008, now seen corresponding path program 1 times [2025-03-08 15:24:32,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:32,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249416727] [2025-03-08 15:24:32,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:32,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:32,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-03-08 15:24:32,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-03-08 15:24:32,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:32,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:32,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:32,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249416727] [2025-03-08 15:24:32,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249416727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:32,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:32,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967797637] [2025-03-08 15:24:32,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:32,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:32,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:32,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:32,920 INFO L87 Difference]: Start difference. First operand 2459 states and 3914 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:33,614 INFO L93 Difference]: Finished difference Result 4747 states and 7541 transitions. [2025-03-08 15:24:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:33,614 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 325 [2025-03-08 15:24:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:33,630 INFO L225 Difference]: With dead ends: 4747 [2025-03-08 15:24:33,630 INFO L226 Difference]: Without dead ends: 2350 [2025-03-08 15:24:33,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:24:33,636 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 469 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:33,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 929 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:24:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2025-03-08 15:24:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2171. [2025-03-08 15:24:33,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1576 states have (on average 1.4378172588832487) internal successors, (2266), 1582 states have internal predecessors, (2266), 576 states have call successors, (576), 18 states have call predecessors, (576), 18 states have return successors, (576), 570 states have call predecessors, (576), 576 states have call successors, (576) [2025-03-08 15:24:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3418 transitions. [2025-03-08 15:24:33,784 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3418 transitions. Word has length 325 [2025-03-08 15:24:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:33,785 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3418 transitions. [2025-03-08 15:24:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3418 transitions. [2025-03-08 15:24:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-08 15:24:33,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:33,788 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:33,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:24:33,789 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:33,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1822661304, now seen corresponding path program 1 times [2025-03-08 15:24:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053865978] [2025-03-08 15:24:33,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:33,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:33,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:33,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:33,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053865978] [2025-03-08 15:24:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053865978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:34,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780289513] [2025-03-08 15:24:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:34,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:34,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:34,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:34,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:34,867 INFO L87 Difference]: Start difference. First operand 2171 states and 3418 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:38,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-08 15:24:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:39,441 INFO L93 Difference]: Finished difference Result 3522 states and 5539 transitions. [2025-03-08 15:24:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:39,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-08 15:24:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:39,458 INFO L225 Difference]: With dead ends: 3522 [2025-03-08 15:24:39,459 INFO L226 Difference]: Without dead ends: 3039 [2025-03-08 15:24:39,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:24:39,462 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 395 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:39,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1328 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 15:24:39,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2025-03-08 15:24:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 2012. [2025-03-08 15:24:39,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1516 states have (on average 1.4538258575197889) internal successors, (2204), 1521 states have internal predecessors, (2204), 480 states have call successors, (480), 15 states have call predecessors, (480), 15 states have return successors, (480), 475 states have call predecessors, (480), 480 states have call successors, (480) [2025-03-08 15:24:39,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 3164 transitions. [2025-03-08 15:24:39,630 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 3164 transitions. Word has length 326 [2025-03-08 15:24:39,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:39,631 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 3164 transitions. [2025-03-08 15:24:39,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 3164 transitions. [2025-03-08 15:24:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-08 15:24:39,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:39,634 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:39,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 15:24:39,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:39,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1987749710, now seen corresponding path program 1 times [2025-03-08 15:24:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946794180] [2025-03-08 15:24:39,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:39,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:39,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:39,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:39,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:40,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:40,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:40,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946794180] [2025-03-08 15:24:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946794180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:40,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433613387] [2025-03-08 15:24:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:40,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:40,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:40,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:40,459 INFO L87 Difference]: Start difference. First operand 2012 states and 3164 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:41,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:41,065 INFO L93 Difference]: Finished difference Result 4703 states and 7396 transitions. [2025-03-08 15:24:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:41,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-08 15:24:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:41,082 INFO L225 Difference]: With dead ends: 4703 [2025-03-08 15:24:41,082 INFO L226 Difference]: Without dead ends: 2694 [2025-03-08 15:24:41,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-08 15:24:41,088 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 222 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:41,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 522 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2025-03-08 15:24:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 951. [2025-03-08 15:24:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 752 states have (on average 1.476063829787234) internal successors, (1110), 754 states have internal predecessors, (1110), 192 states have call successors, (192), 6 states have call predecessors, (192), 6 states have return successors, (192), 190 states have call predecessors, (192), 192 states have call successors, (192) [2025-03-08 15:24:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1494 transitions. [2025-03-08 15:24:41,247 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1494 transitions. Word has length 326 [2025-03-08 15:24:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:41,248 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1494 transitions. [2025-03-08 15:24:41,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1494 transitions. [2025-03-08 15:24:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-08 15:24:41,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:41,252 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:41,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:24:41,252 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:41,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1947233529, now seen corresponding path program 1 times [2025-03-08 15:24:41,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:41,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757541979] [2025-03-08 15:24:41,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:41,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:41,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:41,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:41,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:41,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:41,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757541979] [2025-03-08 15:24:41,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757541979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:41,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437054863] [2025-03-08 15:24:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:41,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:41,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:41,775 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-08 15:24:41,776 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-08 15:24:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:41,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:41,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:41,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:41,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 15:24:41,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:42,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2074 proven. 39 refuted. 0 times theorem prover too weak. 2787 trivial. 0 not checked. [2025-03-08 15:24:42,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 108 proven. 39 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437054863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:42,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 18 [2025-03-08 15:24:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733942335] [2025-03-08 15:24:42,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:42,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:24:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:42,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:24:42,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:24:42,591 INFO L87 Difference]: Start difference. First operand 951 states and 1494 transitions. Second operand has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-08 15:24:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:46,986 INFO L93 Difference]: Finished difference Result 3165 states and 4766 transitions. [2025-03-08 15:24:46,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-03-08 15:24:46,987 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) Word has length 326 [2025-03-08 15:24:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:46,999 INFO L225 Difference]: With dead ends: 3165 [2025-03-08 15:24:46,999 INFO L226 Difference]: Without dead ends: 2217 [2025-03-08 15:24:47,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=906, Invalid=5100, Unknown=0, NotChecked=0, Total=6006 [2025-03-08 15:24:47,004 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 1598 mSDsluCounter, 3769 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 893 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 4399 SdHoareTripleChecker+Invalid, 4986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 893 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:47,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 4399 Invalid, 4986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [893 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 15:24:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-03-08 15:24:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 871. [2025-03-08 15:24:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 652 states have (on average 1.366564417177914) internal successors, (891), 654 states have internal predecessors, (891), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 15:24:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1291 transitions. [2025-03-08 15:24:47,114 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1291 transitions. Word has length 326 [2025-03-08 15:24:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:47,114 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1291 transitions. [2025-03-08 15:24:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.166666666666667) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (76), 3 states have call predecessors, (76), 6 states have return successors, (77), 4 states have call predecessors, (77), 4 states have call successors, (77) [2025-03-08 15:24:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1291 transitions. [2025-03-08 15:24:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-08 15:24:47,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:47,117 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:47,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:24:47,317 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,SelfDestructingSolverStorable12 [2025-03-08 15:24:47,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:47,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:47,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1872789975, now seen corresponding path program 1 times [2025-03-08 15:24:47,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051295161] [2025-03-08 15:24:47,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:47,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:47,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:47,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:47,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-03-08 15:24:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051295161] [2025-03-08 15:24:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051295161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:24:47,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821569491] [2025-03-08 15:24:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:24:47,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:47,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:24:47,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:24:47,645 INFO L87 Difference]: Start difference. First operand 871 states and 1291 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:48,206 INFO L93 Difference]: Finished difference Result 1883 states and 2784 transitions. [2025-03-08 15:24:48,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:24:48,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 326 [2025-03-08 15:24:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:48,217 INFO L225 Difference]: With dead ends: 1883 [2025-03-08 15:24:48,219 INFO L226 Difference]: Without dead ends: 1015 [2025-03-08 15:24:48,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:24:48,222 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 503 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:48,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 742 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:24:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2025-03-08 15:24:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 813. [2025-03-08 15:24:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 594 states have (on average 1.3468013468013469) internal successors, (800), 596 states have internal predecessors, (800), 200 states have call successors, (200), 18 states have call predecessors, (200), 18 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-03-08 15:24:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1200 transitions. [2025-03-08 15:24:48,322 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1200 transitions. Word has length 326 [2025-03-08 15:24:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:48,323 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1200 transitions. [2025-03-08 15:24:48,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2025-03-08 15:24:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1200 transitions. [2025-03-08 15:24:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2025-03-08 15:24:48,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:48,325 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:48,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:24:48,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 412073480, now seen corresponding path program 1 times [2025-03-08 15:24:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:48,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571474347] [2025-03-08 15:24:48,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:48,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:48,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:48,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:48,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:48,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571474347] [2025-03-08 15:24:48,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571474347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:48,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369842779] [2025-03-08 15:24:48,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:48,657 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-08 15:24:48,658 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-08 15:24:48,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 326 statements into 1 equivalence classes. [2025-03-08 15:24:48,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 326 of 326 statements. [2025-03-08 15:24:48,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:48,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:24:48,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 693 proven. 9 refuted. 0 times theorem prover too weak. 4198 trivial. 0 not checked. [2025-03-08 15:24:48,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 138 proven. 9 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:49,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369842779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:49,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:49,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 15:24:49,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942115879] [2025-03-08 15:24:49,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:49,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 15:24:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:49,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 15:24:49,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:24:49,099 INFO L87 Difference]: Start difference. First operand 813 states and 1200 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-08 15:24:49,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:49,417 INFO L93 Difference]: Finished difference Result 1555 states and 2280 transitions. [2025-03-08 15:24:49,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:24:49,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 326 [2025-03-08 15:24:49,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:49,421 INFO L225 Difference]: With dead ends: 1555 [2025-03-08 15:24:49,421 INFO L226 Difference]: Without dead ends: 745 [2025-03-08 15:24:49,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 649 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:24:49,423 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 286 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:49,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 413 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:24:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-08 15:24:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 442. [2025-03-08 15:24:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 330 states have (on average 1.3333333333333333) internal successors, (440), 331 states have internal predecessors, (440), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 15:24:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 640 transitions. [2025-03-08 15:24:49,501 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 640 transitions. Word has length 326 [2025-03-08 15:24:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:49,501 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 640 transitions. [2025-03-08 15:24:49,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-08 15:24:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 640 transitions. [2025-03-08 15:24:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-08 15:24:49,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:49,503 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:49,511 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-08 15:24:49,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:49,706 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1213283318, now seen corresponding path program 1 times [2025-03-08 15:24:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364887066] [2025-03-08 15:24:49,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:49,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:49,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 15:24:49,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 15:24:49,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:49,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:50,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364887066] [2025-03-08 15:24:50,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364887066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:50,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064838429] [2025-03-08 15:24:50,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:50,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:50,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:50,696 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-08 15:24:50,698 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-08 15:24:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 15:24:50,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 15:24:50,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:50,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:50,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 15:24:50,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 1017 proven. 15 refuted. 0 times theorem prover too weak. 3868 trivial. 0 not checked. [2025-03-08 15:24:51,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 132 proven. 15 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2025-03-08 15:24:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064838429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:51,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:51,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2025-03-08 15:24:51,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051293961] [2025-03-08 15:24:51,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:51,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 15:24:51,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:51,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 15:24:51,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-08 15:24:51,909 INFO L87 Difference]: Start difference. First operand 442 states and 640 transitions. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-08 15:24:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:54,523 INFO L93 Difference]: Finished difference Result 1784 states and 2541 transitions. [2025-03-08 15:24:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 15:24:54,523 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) Word has length 327 [2025-03-08 15:24:54,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:54,529 INFO L225 Difference]: With dead ends: 1784 [2025-03-08 15:24:54,529 INFO L226 Difference]: Without dead ends: 1345 [2025-03-08 15:24:54,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=509, Invalid=2247, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 15:24:54,531 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 1854 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 975 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1856 SdHoareTripleChecker+Valid, 2498 SdHoareTripleChecker+Invalid, 3606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 975 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:54,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1856 Valid, 2498 Invalid, 3606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [975 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 15:24:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-08 15:24:54,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 810. [2025-03-08 15:24:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 535 states have (on average 1.2429906542056075) internal successors, (665), 538 states have internal predecessors, (665), 245 states have call successors, (245), 29 states have call predecessors, (245), 29 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-08 15:24:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1155 transitions. [2025-03-08 15:24:54,684 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1155 transitions. Word has length 327 [2025-03-08 15:24:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:54,684 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1155 transitions. [2025-03-08 15:24:54,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 4 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (150), 4 states have call predecessors, (150), 4 states have call successors, (150) [2025-03-08 15:24:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1155 transitions. [2025-03-08 15:24:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-08 15:24:54,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:54,686 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:54,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 15:24:54,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:24:54,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:54,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2131988608, now seen corresponding path program 1 times [2025-03-08 15:24:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:54,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301764244] [2025-03-08 15:24:54,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:54,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:54,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 15:24:55,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 15:24:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:56,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 249 refuted. 0 times theorem prover too weak. 4348 trivial. 0 not checked. [2025-03-08 15:24:56,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301764244] [2025-03-08 15:24:56,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301764244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:56,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187168268] [2025-03-08 15:24:56,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:56,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:56,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:56,005 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-08 15:24:56,007 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-08 15:24:56,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-08 15:24:56,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-08 15:24:56,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:56,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:56,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 15:24:56,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3340 proven. 249 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2025-03-08 15:24:57,289 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 303 proven. 267 refuted. 0 times theorem prover too weak. 4330 trivial. 0 not checked. [2025-03-08 15:24:58,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187168268] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:58,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:58,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 30 [2025-03-08 15:24:58,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573158625] [2025-03-08 15:24:58,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:58,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 15:24:58,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:58,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 15:24:58,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2025-03-08 15:24:58,128 INFO L87 Difference]: Start difference. First operand 810 states and 1155 transitions. Second operand has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) [2025-03-08 15:24:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:58,968 INFO L93 Difference]: Finished difference Result 1618 states and 2247 transitions. [2025-03-08 15:24:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 15:24:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) Word has length 327 [2025-03-08 15:24:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:58,972 INFO L225 Difference]: With dead ends: 1618 [2025-03-08 15:24:58,973 INFO L226 Difference]: Without dead ends: 900 [2025-03-08 15:24:58,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=463, Invalid=1019, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 15:24:58,974 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 422 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:58,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 491 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:24:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-08 15:24:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 890. [2025-03-08 15:24:59,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 595 states have (on average 1.1915966386554622) internal successors, (709), 598 states have internal predecessors, (709), 245 states have call successors, (245), 49 states have call predecessors, (245), 49 states have return successors, (245), 242 states have call predecessors, (245), 245 states have call successors, (245) [2025-03-08 15:24:59,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1199 transitions. [2025-03-08 15:24:59,144 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1199 transitions. Word has length 327 [2025-03-08 15:24:59,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:59,145 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1199 transitions. [2025-03-08 15:24:59,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 7.37037037037037) internal successors, (199), 27 states have internal predecessors, (199), 13 states have call successors, (108), 5 states have call predecessors, (108), 12 states have return successors, (109), 12 states have call predecessors, (109), 13 states have call successors, (109) [2025-03-08 15:24:59,145 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1199 transitions. [2025-03-08 15:24:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 15:24:59,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:59,146 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:24:59,154 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-08 15:24:59,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 15:24:59,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:59,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash 967312837, now seen corresponding path program 1 times [2025-03-08 15:24:59,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:59,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424037327] [2025-03-08 15:24:59,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:59,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:59,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 15:24:59,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 15:24:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:59,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:24:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1950776866] [2025-03-08 15:24:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:59,596 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-08 15:24:59,598 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-08 15:24:59,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 15:25:00,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 15:25:00,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:00,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:00,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 15:25:00,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 3437 proven. 357 refuted. 0 times theorem prover too weak. 1106 trivial. 0 not checked. [2025-03-08 15:25:02,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:25:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424037327] [2025-03-08 15:25:03,077 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:25:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950776866] [2025-03-08 15:25:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950776866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:25:03,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:25:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2025-03-08 15:25:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975962560] [2025-03-08 15:25:03,077 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 15:25:03,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 15:25:03,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:03,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 15:25:03,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-03-08 15:25:03,079 INFO L87 Difference]: Start difference. First operand 890 states and 1199 transitions. Second operand has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-08 15:25:05,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:05,089 INFO L93 Difference]: Finished difference Result 2041 states and 2728 transitions. [2025-03-08 15:25:05,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 15:25:05,090 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) Word has length 329 [2025-03-08 15:25:05,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:05,095 INFO L225 Difference]: With dead ends: 2041 [2025-03-08 15:25:05,095 INFO L226 Difference]: Without dead ends: 1259 [2025-03-08 15:25:05,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=602, Invalid=2260, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 15:25:05,098 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 658 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1845 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:05,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1845 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1850 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 15:25:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2025-03-08 15:25:05,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1106. [2025-03-08 15:25:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 786 states have (on average 1.2035623409669212) internal successors, (946), 790 states have internal predecessors, (946), 260 states have call successors, (260), 59 states have call predecessors, (260), 59 states have return successors, (260), 256 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-08 15:25:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1466 transitions. [2025-03-08 15:25:05,298 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1466 transitions. Word has length 329 [2025-03-08 15:25:05,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:05,299 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1466 transitions. [2025-03-08 15:25:05,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.48) internal successors, (112), 22 states have internal predecessors, (112), 7 states have call successors, (50), 7 states have call predecessors, (50), 11 states have return successors, (50), 7 states have call predecessors, (50), 7 states have call successors, (50) [2025-03-08 15:25:05,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1466 transitions. [2025-03-08 15:25:05,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-08 15:25:05,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:05,300 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:25:05,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 15:25:05,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 15:25:05,501 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:05,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:05,503 INFO L85 PathProgramCache]: Analyzing trace with hash -733427642, now seen corresponding path program 1 times [2025-03-08 15:25:05,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:05,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115936703] [2025-03-08 15:25:05,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:05,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:05,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-08 15:25:05,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-08 15:25:05,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:05,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:25:05,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218171231] [2025-03-08 15:25:05,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:05,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:05,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:05,873 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-08 15:25:05,874 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-08 15:25:06,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes.