./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.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_fillercode_fillercodestructure_filler-ps-co_file-81.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 efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:17:55,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:17:55,882 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:17:55,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:17:55,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:17:55,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:17:55,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:17:55,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:17:55,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:17:55,906 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:17:55,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:17:55,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:17:55,907 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:17:55,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:17:55,907 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:17:55,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:17:55,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:17:55,909 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:17:55,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:17:55,909 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:17:55,910 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:17:55,910 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 -> efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 [2025-03-08 13:17:56,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:17:56,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:17:56,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:17:56,151 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:17:56,151 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:17:56,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2025-03-08 13:17:57,341 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c3ad98f/94056b0d272346e7a480d085df9b80c3/FLAGde08b442e [2025-03-08 13:17:57,625 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:17:57,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2025-03-08 13:17:57,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c3ad98f/94056b0d272346e7a480d085df9b80c3/FLAGde08b442e [2025-03-08 13:17:57,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6c3ad98f/94056b0d272346e7a480d085df9b80c3 [2025-03-08 13:17:57,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:17:57,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:17:57,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:17:57,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:17:57,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:17:57,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:57" (1/1) ... [2025-03-08 13:17:57,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bd34262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:57, skipping insertion in model container [2025-03-08 13:17:57,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:17:57" (1/1) ... [2025-03-08 13:17:57,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:17:58,068 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i[919,932] [2025-03-08 13:17:58,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:17:58,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:17:58,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i[919,932] [2025-03-08 13:17:58,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:17:58,180 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:17:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58 WrapperNode [2025-03-08 13:17:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:17:58,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:17:58,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:17:58,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:17:58,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,223 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-03-08 13:17:58,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:17:58,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:17:58,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:17:58,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:17:58,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,239 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,260 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 13:17:58,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:17:58,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:17:58,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:17:58,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:17:58,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (1/1) ... [2025-03-08 13:17:58,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:17:58,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:17:58,311 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 13:17:58,316 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 13:17:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:17:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:17:58,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:17:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:17:58,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:17:58,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:17:58,410 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:17:58,411 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:17:58,740 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-03-08 13:17:58,779 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 13:17:58,779 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:17:58,799 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:17:58,799 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:17:58,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:58 BoogieIcfgContainer [2025-03-08 13:17:58,800 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:17:58,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:17:58,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:17:58,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:17:58,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:17:57" (1/3) ... [2025-03-08 13:17:58,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b07fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:58, skipping insertion in model container [2025-03-08 13:17:58,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:17:58" (2/3) ... [2025-03-08 13:17:58,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f2b07fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:17:58, skipping insertion in model container [2025-03-08 13:17:58,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:17:58" (3/3) ... [2025-03-08 13:17:58,807 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2025-03-08 13:17:58,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:17:58,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:17:58,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:17:58,866 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;@6afeb18a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:17:58,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:17:58,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 13:17:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 13:17:58,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:58,882 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:58,882 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:58,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:58,886 INFO L85 PathProgramCache]: Analyzing trace with hash 971413070, now seen corresponding path program 1 times [2025-03-08 13:17:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:17:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853742869] [2025-03-08 13:17:58,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:17:58,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 13:17:59,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 13:17:59,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:59,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-08 13:17:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:17:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853742869] [2025-03-08 13:17:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853742869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:17:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37892555] [2025-03-08 13:17:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:17:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:17:59,252 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 13:17:59,253 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 13:17:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 13:17:59,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 13:17:59,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:59,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:17:59,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:17:59,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:17:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-03-08 13:17:59,490 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:17:59,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37892555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:17:59,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:17:59,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:17:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945816035] [2025-03-08 13:17:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:17:59,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:17:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:17:59,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:17:59,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:17:59,511 INFO L87 Difference]: Start difference. First operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 13:17:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:17:59,541 INFO L93 Difference]: Finished difference Result 254 states and 459 transitions. [2025-03-08 13:17:59,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:17:59,544 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-03-08 13:17:59,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:17:59,551 INFO L225 Difference]: With dead ends: 254 [2025-03-08 13:17:59,551 INFO L226 Difference]: Without dead ends: 127 [2025-03-08 13:17:59,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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 13:17:59,555 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:17:59,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:17:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-08 13:17:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-08 13:17:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 13:17:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2025-03-08 13:17:59,592 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2025-03-08 13:17:59,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:17:59,592 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2025-03-08 13:17:59,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 13:17:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2025-03-08 13:17:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-03-08 13:17:59,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:17:59,597 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:17:59,605 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 13:17:59,797 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 13:17:59,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:17:59,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:17:59,798 INFO L85 PathProgramCache]: Analyzing trace with hash -179814710, now seen corresponding path program 1 times [2025-03-08 13:17:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:17:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431163677] [2025-03-08 13:17:59,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:17:59,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:17:59,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-03-08 13:17:59,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-03-08 13:17:59,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:17:59,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:00,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:00,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431163677] [2025-03-08 13:18:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431163677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:18:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563032426] [2025-03-08 13:18:00,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:00,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:18:00,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:00,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:18:00,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:18:00,138 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:00,200 INFO L93 Difference]: Finished difference Result 358 states and 579 transitions. [2025-03-08 13:18:00,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:18:00,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-03-08 13:18:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:00,205 INFO L225 Difference]: With dead ends: 358 [2025-03-08 13:18:00,205 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 13:18:00,206 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 13:18:00,206 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 92 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:00,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:18:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 13:18:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 219. [2025-03-08 13:18:00,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:18:00,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 351 transitions. [2025-03-08 13:18:00,241 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 351 transitions. Word has length 295 [2025-03-08 13:18:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 351 transitions. [2025-03-08 13:18:00,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:00,244 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2025-03-08 13:18:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-08 13:18:00,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:00,249 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:00,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:18:00,249 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash 849300518, now seen corresponding path program 1 times [2025-03-08 13:18:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774727620] [2025-03-08 13:18:00,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:00,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-08 13:18:00,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-08 13:18:00,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:00,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:00,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:00,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774727620] [2025-03-08 13:18:00,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774727620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:00,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:00,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:18:00,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273772020] [2025-03-08 13:18:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:00,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:18:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:00,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:18:00,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:00,894 INFO L87 Difference]: Start difference. First operand 219 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:01,155 INFO L93 Difference]: Finished difference Result 357 states and 575 transitions. [2025-03-08 13:18:01,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:18:01,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-03-08 13:18:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:01,158 INFO L225 Difference]: With dead ends: 357 [2025-03-08 13:18:01,158 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 13:18:01,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:01,159 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 85 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:01,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 442 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:18:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 13:18:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 220. [2025-03-08 13:18:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 121 states have (on average 1.322314049586777) internal successors, (160), 121 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:18:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2025-03-08 13:18:01,208 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 296 [2025-03-08 13:18:01,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:01,210 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2025-03-08 13:18:01,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2025-03-08 13:18:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 13:18:01,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:01,213 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:01,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:18:01,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1050365645, now seen corresponding path program 1 times [2025-03-08 13:18:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173324801] [2025-03-08 13:18:01,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:01,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:01,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 13:18:01,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 13:18:01,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:01,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:11,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:11,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173324801] [2025-03-08 13:18:11,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173324801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:11,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:11,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:18:11,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132879233] [2025-03-08 13:18:11,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:11,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:18:11,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:11,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:18:11,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:18:11,216 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:13,425 INFO L93 Difference]: Finished difference Result 428 states and 671 transitions. [2025-03-08 13:18:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:18:13,426 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-03-08 13:18:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:13,429 INFO L225 Difference]: With dead ends: 428 [2025-03-08 13:18:13,429 INFO L226 Difference]: Without dead ends: 304 [2025-03-08 13:18:13,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:18:13,433 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 259 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:13,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1235 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 13:18:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-08 13:18:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 233. [2025-03-08 13:18:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:18:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 372 transitions. [2025-03-08 13:18:13,466 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 372 transitions. Word has length 297 [2025-03-08 13:18:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:13,466 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 372 transitions. [2025-03-08 13:18:13,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 372 transitions. [2025-03-08 13:18:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 13:18:13,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:13,469 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:18:13,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash 853852140, now seen corresponding path program 1 times [2025-03-08 13:18:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131212562] [2025-03-08 13:18:13,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:13,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 13:18:13,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 13:18:13,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:13,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131212562] [2025-03-08 13:18:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131212562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:13,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:13,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:18:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708088278] [2025-03-08 13:18:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:18:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:13,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:18:13,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:13,744 INFO L87 Difference]: Start difference. First operand 233 states and 372 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:13,811 INFO L93 Difference]: Finished difference Result 402 states and 636 transitions. [2025-03-08 13:18:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:18:13,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-03-08 13:18:13,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:13,813 INFO L225 Difference]: With dead ends: 402 [2025-03-08 13:18:13,813 INFO L226 Difference]: Without dead ends: 265 [2025-03-08 13:18:13,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:13,814 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 42 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:13,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 587 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:18:13,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-08 13:18:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2025-03-08 13:18:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 158 states have (on average 1.3354430379746836) internal successors, (211), 159 states have internal predecessors, (211), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 411 transitions. [2025-03-08 13:18:13,839 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 411 transitions. Word has length 297 [2025-03-08 13:18:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:13,840 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 411 transitions. [2025-03-08 13:18:13,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 411 transitions. [2025-03-08 13:18:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 13:18:13,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:13,843 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:13,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 13:18:13,843 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:13,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash -746585714, now seen corresponding path program 1 times [2025-03-08 13:18:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:13,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328188569] [2025-03-08 13:18:13,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:13,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 13:18:13,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 13:18:13,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:13,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328188569] [2025-03-08 13:18:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328188569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:19,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:18:19,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693243528] [2025-03-08 13:18:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:19,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:18:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:19,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:18:19,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:19,126 INFO L87 Difference]: Start difference. First operand 262 states and 411 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:21,605 INFO L93 Difference]: Finished difference Result 565 states and 863 transitions. [2025-03-08 13:18:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:18:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-03-08 13:18:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:21,608 INFO L225 Difference]: With dead ends: 565 [2025-03-08 13:18:21,608 INFO L226 Difference]: Without dead ends: 399 [2025-03-08 13:18:21,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-08 13:18:21,610 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 468 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:21,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 989 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 13:18:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-08 13:18:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 274. [2025-03-08 13:18:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 171 states have internal predecessors, (232), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 432 transitions. [2025-03-08 13:18:21,632 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 432 transitions. Word has length 297 [2025-03-08 13:18:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 432 transitions. [2025-03-08 13:18:21,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 432 transitions. [2025-03-08 13:18:21,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 13:18:21,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:21,635 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:21,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 13:18:21,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1179448364, now seen corresponding path program 1 times [2025-03-08 13:18:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261990307] [2025-03-08 13:18:21,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:21,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 13:18:21,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 13:18:21,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:21,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:22,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:22,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261990307] [2025-03-08 13:18:22,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261990307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:22,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:22,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 13:18:22,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977287842] [2025-03-08 13:18:22,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:22,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:18:22,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:22,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:18:22,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:18:22,123 INFO L87 Difference]: Start difference. First operand 274 states and 432 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:22,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:22,693 INFO L93 Difference]: Finished difference Result 495 states and 770 transitions. [2025-03-08 13:18:22,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 13:18:22,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-03-08 13:18:22,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:22,697 INFO L225 Difference]: With dead ends: 495 [2025-03-08 13:18:22,698 INFO L226 Difference]: Without dead ends: 329 [2025-03-08 13:18:22,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:22,701 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 169 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:22,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 796 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 13:18:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-08 13:18:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2025-03-08 13:18:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 177 states have internal predecessors, (239), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:22,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 439 transitions. [2025-03-08 13:18:22,727 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 439 transitions. Word has length 297 [2025-03-08 13:18:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:22,728 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 439 transitions. [2025-03-08 13:18:22,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 439 transitions. [2025-03-08 13:18:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 13:18:22,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:22,731 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:22,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 13:18:22,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:22,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:22,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1252144339, now seen corresponding path program 1 times [2025-03-08 13:18:22,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:22,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334512641] [2025-03-08 13:18:22,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:22,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:22,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 13:18:22,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 13:18:22,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:22,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334512641] [2025-03-08 13:18:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334512641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:29,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:29,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:18:29,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283752080] [2025-03-08 13:18:29,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:29,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:18:29,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:29,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:18:29,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:29,053 INFO L87 Difference]: Start difference. First operand 280 states and 439 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:29,972 INFO L93 Difference]: Finished difference Result 514 states and 792 transitions. [2025-03-08 13:18:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:18:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-03-08 13:18:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:29,975 INFO L225 Difference]: With dead ends: 514 [2025-03-08 13:18:29,976 INFO L226 Difference]: Without dead ends: 348 [2025-03-08 13:18:29,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-08 13:18:29,977 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 228 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:29,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 901 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:18:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-08 13:18:29,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 278. [2025-03-08 13:18:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:30,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 437 transitions. [2025-03-08 13:18:30,003 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 437 transitions. Word has length 297 [2025-03-08 13:18:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:30,003 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 437 transitions. [2025-03-08 13:18:30,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 437 transitions. [2025-03-08 13:18:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:30,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:30,006 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 13:18:30,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2085948190, now seen corresponding path program 1 times [2025-03-08 13:18:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095715283] [2025-03-08 13:18:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:30,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:30,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:30,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:30,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095715283] [2025-03-08 13:18:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095715283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:18:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101846718] [2025-03-08 13:18:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:33,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:18:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:33,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:18:33,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:18:33,727 INFO L87 Difference]: Start difference. First operand 278 states and 437 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:34,154 INFO L93 Difference]: Finished difference Result 586 states and 894 transitions. [2025-03-08 13:18:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 13:18:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:18:34,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:34,157 INFO L225 Difference]: With dead ends: 586 [2025-03-08 13:18:34,158 INFO L226 Difference]: Without dead ends: 420 [2025-03-08 13:18:34,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:18:34,159 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 199 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:34,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 872 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:18:34,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-08 13:18:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 286. [2025-03-08 13:18:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 183 states have internal predecessors, (250), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 450 transitions. [2025-03-08 13:18:34,180 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 450 transitions. Word has length 298 [2025-03-08 13:18:34,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:34,180 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 450 transitions. [2025-03-08 13:18:34,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:34,180 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 450 transitions. [2025-03-08 13:18:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:34,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:34,182 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:34,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 13:18:34,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2012505601, now seen corresponding path program 1 times [2025-03-08 13:18:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106618342] [2025-03-08 13:18:34,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:34,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:34,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:34,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:34,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:34,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:38,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:38,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106618342] [2025-03-08 13:18:38,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106618342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:38,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:38,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:18:38,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922626074] [2025-03-08 13:18:38,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:38,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:18:38,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:38,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:18:38,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:38,096 INFO L87 Difference]: Start difference. First operand 286 states and 450 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:39,555 INFO L93 Difference]: Finished difference Result 581 states and 890 transitions. [2025-03-08 13:18:39,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:18:39,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:18:39,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:39,558 INFO L225 Difference]: With dead ends: 581 [2025-03-08 13:18:39,558 INFO L226 Difference]: Without dead ends: 410 [2025-03-08 13:18:39,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-03-08 13:18:39,560 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 323 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:39,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 982 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:18:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-03-08 13:18:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 296. [2025-03-08 13:18:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 193 states have internal predecessors, (265), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 465 transitions. [2025-03-08 13:18:39,585 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 465 transitions. Word has length 298 [2025-03-08 13:18:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:39,586 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 465 transitions. [2025-03-08 13:18:39,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 465 transitions. [2025-03-08 13:18:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:39,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:39,588 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:39,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 13:18:39,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash 412067747, now seen corresponding path program 1 times [2025-03-08 13:18:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754813038] [2025-03-08 13:18:39,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:39,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:39,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:39,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:39,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:39,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:43,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:43,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754813038] [2025-03-08 13:18:43,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754813038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:43,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:43,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:18:43,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658502434] [2025-03-08 13:18:43,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:43,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:18:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:43,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:18:43,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:43,326 INFO L87 Difference]: Start difference. First operand 296 states and 465 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:44,412 INFO L93 Difference]: Finished difference Result 625 states and 952 transitions. [2025-03-08 13:18:44,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 13:18:44,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:18:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:44,416 INFO L225 Difference]: With dead ends: 625 [2025-03-08 13:18:44,416 INFO L226 Difference]: Without dead ends: 454 [2025-03-08 13:18:44,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-03-08 13:18:44,418 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 462 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:44,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1003 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:18:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-08 13:18:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 299. [2025-03-08 13:18:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 195 states have (on average 1.3794871794871795) internal successors, (269), 196 states have internal predecessors, (269), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 469 transitions. [2025-03-08 13:18:44,444 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 469 transitions. Word has length 298 [2025-03-08 13:18:44,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:44,445 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 469 transitions. [2025-03-08 13:18:44,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:44,445 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 469 transitions. [2025-03-08 13:18:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:44,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:44,459 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:44,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 13:18:44,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:44,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 215554242, now seen corresponding path program 1 times [2025-03-08 13:18:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352437402] [2025-03-08 13:18:44,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:44,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:44,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:48,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:48,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352437402] [2025-03-08 13:18:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352437402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:48,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 13:18:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309371206] [2025-03-08 13:18:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:48,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 13:18:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:48,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 13:18:48,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-03-08 13:18:48,461 INFO L87 Difference]: Start difference. First operand 299 states and 469 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 13:18:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:50,097 INFO L93 Difference]: Finished difference Result 566 states and 870 transitions. [2025-03-08 13:18:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:18:50,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 298 [2025-03-08 13:18:50,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:50,099 INFO L225 Difference]: With dead ends: 566 [2025-03-08 13:18:50,099 INFO L226 Difference]: Without dead ends: 395 [2025-03-08 13:18:50,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-03-08 13:18:50,100 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 404 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:50,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 935 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 13:18:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-08 13:18:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 300. [2025-03-08 13:18:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 196 states have (on average 1.3826530612244898) internal successors, (271), 197 states have internal predecessors, (271), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 471 transitions. [2025-03-08 13:18:50,124 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 471 transitions. Word has length 298 [2025-03-08 13:18:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:50,124 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 471 transitions. [2025-03-08 13:18:50,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-03-08 13:18:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 471 transitions. [2025-03-08 13:18:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:50,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:50,126 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:50,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 13:18:50,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:50,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:50,127 INFO L85 PathProgramCache]: Analyzing trace with hash -93490878, now seen corresponding path program 1 times [2025-03-08 13:18:50,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:50,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531694179] [2025-03-08 13:18:50,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:50,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:50,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:50,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:50,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:50,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531694179] [2025-03-08 13:18:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531694179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:18:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485504100] [2025-03-08 13:18:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:18:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:18:54,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:18:54,549 INFO L87 Difference]: Start difference. First operand 300 states and 471 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:55,773 INFO L93 Difference]: Finished difference Result 548 states and 843 transitions. [2025-03-08 13:18:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 13:18:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:18:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:55,776 INFO L225 Difference]: With dead ends: 548 [2025-03-08 13:18:55,776 INFO L226 Difference]: Without dead ends: 377 [2025-03-08 13:18:55,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:18:55,777 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 279 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:55,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 927 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 13:18:55,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-08 13:18:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 296. [2025-03-08 13:18:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 193 states have internal predecessors, (265), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 13:18:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 465 transitions. [2025-03-08 13:18:55,805 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 465 transitions. Word has length 298 [2025-03-08 13:18:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:55,806 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 465 transitions. [2025-03-08 13:18:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:55,807 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 465 transitions. [2025-03-08 13:18:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:55,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:55,808 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:55,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 13:18:55,808 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:55,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:55,809 INFO L85 PathProgramCache]: Analyzing trace with hash -578396381, now seen corresponding path program 1 times [2025-03-08 13:18:55,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:55,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449127774] [2025-03-08 13:18:55,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:55,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:55,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:55,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:18:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:18:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:18:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449127774] [2025-03-08 13:18:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449127774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:18:55,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:18:55,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:18:55,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812546702] [2025-03-08 13:18:55,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:18:55,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:18:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:18:55,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:18:55,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:55,977 INFO L87 Difference]: Start difference. First operand 296 states and 465 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:18:56,048 INFO L93 Difference]: Finished difference Result 494 states and 765 transitions. [2025-03-08 13:18:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:18:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:18:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:18:56,050 INFO L225 Difference]: With dead ends: 494 [2025-03-08 13:18:56,050 INFO L226 Difference]: Without dead ends: 323 [2025-03-08 13:18:56,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:18:56,051 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:18:56,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 592 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:18:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-08 13:18:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 283. [2025-03-08 13:18:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:18:56,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 443 transitions. [2025-03-08 13:18:56,076 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 443 transitions. Word has length 298 [2025-03-08 13:18:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:18:56,076 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 443 transitions. [2025-03-08 13:18:56,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:18:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 443 transitions. [2025-03-08 13:18:56,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:18:56,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:18:56,078 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:18:56,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 13:18:56,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:18:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:18:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -774909886, now seen corresponding path program 1 times [2025-03-08 13:18:56,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:18:56,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254630528] [2025-03-08 13:18:56,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:18:56,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:18:56,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:18:56,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:18:56,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:18:56,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:19:01,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254630528] [2025-03-08 13:19:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254630528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:19:01,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740063339] [2025-03-08 13:19:01,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:01,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:19:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:01,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:19:01,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:19:01,638 INFO L87 Difference]: Start difference. First operand 283 states and 443 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:19:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:02,028 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2025-03-08 13:19:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:19:02,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:19:02,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:02,030 INFO L225 Difference]: With dead ends: 499 [2025-03-08 13:19:02,031 INFO L226 Difference]: Without dead ends: 343 [2025-03-08 13:19:02,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:19:02,032 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 199 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:02,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 752 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 13:19:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-08 13:19:02,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 285. [2025-03-08 13:19:02,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:19:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 446 transitions. [2025-03-08 13:19:02,055 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 446 transitions. Word has length 298 [2025-03-08 13:19:02,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:02,064 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 446 transitions. [2025-03-08 13:19:02,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:19:02,064 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 446 transitions. [2025-03-08 13:19:02,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-03-08 13:19:02,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:02,065 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:02,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 13:19:02,066 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:02,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:02,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1723106051, now seen corresponding path program 1 times [2025-03-08 13:19:02,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127374710] [2025-03-08 13:19:02,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:02,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-03-08 13:19:02,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-03-08 13:19:02,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:02,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:19:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-03-08 13:19:08,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:19:08,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127374710] [2025-03-08 13:19:08,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127374710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:19:08,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:19:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:19:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839084431] [2025-03-08 13:19:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:19:08,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:19:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:19:08,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:19:08,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:19:08,050 INFO L87 Difference]: Start difference. First operand 285 states and 446 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:19:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:19:08,527 INFO L93 Difference]: Finished difference Result 496 states and 765 transitions. [2025-03-08 13:19:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 13:19:08,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-03-08 13:19:08,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:19:08,530 INFO L225 Difference]: With dead ends: 496 [2025-03-08 13:19:08,530 INFO L226 Difference]: Without dead ends: 332 [2025-03-08 13:19:08,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:19:08,531 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 125 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:19:08,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 869 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 13:19:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-08 13:19:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 285. [2025-03-08 13:19:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 184 states have (on average 1.3804347826086956) internal successors, (254), 184 states have internal predecessors, (254), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 13:19:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 446 transitions. [2025-03-08 13:19:08,553 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 446 transitions. Word has length 298 [2025-03-08 13:19:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:19:08,553 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 446 transitions. [2025-03-08 13:19:08,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-03-08 13:19:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 446 transitions. [2025-03-08 13:19:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-03-08 13:19:08,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:19:08,555 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:19:08,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 13:19:08,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:19:08,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:19:08,556 INFO L85 PathProgramCache]: Analyzing trace with hash -742328949, now seen corresponding path program 1 times [2025-03-08 13:19:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:19:08,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678928102] [2025-03-08 13:19:08,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:19:08,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:19:08,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-03-08 13:19:08,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-03-08 13:19:08,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:19:08,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat