./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_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-pe-ci_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 6b77a3b8187af54765a505f7649175cf18add0380d30145d0f26a5ac8cc02bbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:45:11,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:45:11,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:45:11,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:45:11,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:45:11,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:45:11,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:45:11,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:45:11,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:45:11,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:45:11,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:45:11,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:45:11,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:45:11,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:45:11,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:45:11,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:45:11,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:11,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:45:11,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:45:11,975 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 -> 6b77a3b8187af54765a505f7649175cf18add0380d30145d0f26a5ac8cc02bbd [2025-03-08 11:45:12,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:45:12,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:45:12,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:45:12,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:45:12,202 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:45:12,203 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-pe-ci_file-81.i [2025-03-08 11:45:13,395 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7dd70/726a8ff24a134b60b9a5780410754283/FLAG10b0c2ed6 [2025-03-08 11:45:13,649 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:45:13,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i [2025-03-08 11:45:13,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7dd70/726a8ff24a134b60b9a5780410754283/FLAG10b0c2ed6 [2025-03-08 11:45:13,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7dd70/726a8ff24a134b60b9a5780410754283 [2025-03-08 11:45:13,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:45:13,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:45:13,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:13,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:45:13,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:45:13,954 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a50adbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:13, skipping insertion in model container [2025-03-08 11:45:13,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:45:13" (1/1) ... [2025-03-08 11:45:13,971 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:45:14,066 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-pe-ci_file-81.i[919,932] [2025-03-08 11:45:14,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:14,159 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:45:14,170 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-pe-ci_file-81.i[919,932] [2025-03-08 11:45:14,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:45:14,221 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:45:14,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14 WrapperNode [2025-03-08 11:45:14,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:45:14,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:14,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:45:14,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:45:14,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,263 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 247 [2025-03-08 11:45:14,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:45:14,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:45:14,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:45:14,263 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:45:14,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,292 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 11:45:14,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,314 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:45:14,324 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:45:14,324 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:45:14,324 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:45:14,325 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (1/1) ... [2025-03-08 11:45:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:45:14,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:14,350 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 11:45:14,353 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 11:45:14,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:45:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:45:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:45:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:45:14,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:45:14,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:45:14,427 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:45:14,428 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:45:14,785 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L187: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2025-03-08 11:45:14,816 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 11:45:14,816 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:45:14,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:45:14,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:45:14,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:14 BoogieIcfgContainer [2025-03-08 11:45:14,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:45:14,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:45:14,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:45:14,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:45:14,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:45:13" (1/3) ... [2025-03-08 11:45:14,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a058f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:14, skipping insertion in model container [2025-03-08 11:45:14,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:45:14" (2/3) ... [2025-03-08 11:45:14,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40a058f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:45:14, skipping insertion in model container [2025-03-08 11:45:14,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:45:14" (3/3) ... [2025-03-08 11:45:14,842 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i [2025-03-08 11:45:14,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:45:14,855 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-81.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:45:14,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:45:14,909 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;@7e32eac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:45:14,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:45:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 11:45:14,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:14,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:14,940 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:14,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:14,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -297039671, now seen corresponding path program 1 times [2025-03-08 11:45:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:14,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152576946] [2025-03-08 11:45:14,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:14,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:15,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:15,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:15,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:15,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 11:45:15,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:15,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152576946] [2025-03-08 11:45:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152576946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:45:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684401250] [2025-03-08 11:45:15,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:15,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:45:15,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:45:15,272 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 11:45:15,273 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 11:45:15,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:15,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:15,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:15,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:45:15,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:45:15,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-08 11:45:15,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:45:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684401250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:45:15,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:45:15,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214942687] [2025-03-08 11:45:15,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:45:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:15,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:45:15,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:45:15,488 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:15,514 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2025-03-08 11:45:15,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:45:15,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-08 11:45:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:15,521 INFO L225 Difference]: With dead ends: 204 [2025-03-08 11:45:15,522 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 11:45:15,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 203 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 11:45:15,528 INFO L435 NwaCegarLoop]: 157 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, 157 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 11:45:15,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:45:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 11:45:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-08 11:45:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 11:45:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 161 transitions. [2025-03-08 11:45:15,556 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 161 transitions. Word has length 202 [2025-03-08 11:45:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 161 transitions. [2025-03-08 11:45:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 161 transitions. [2025-03-08 11:45:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:15,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:15,559 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:15,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:45:15,764 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 11:45:15,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:15,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1148047228, now seen corresponding path program 1 times [2025-03-08 11:45:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535572465] [2025-03-08 11:45:15,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:15,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:15,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:15,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:15,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535572465] [2025-03-08 11:45:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535572465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549230284] [2025-03-08 11:45:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:16,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:16,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:16,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:16,039 INFO L87 Difference]: Start difference. First operand 102 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:16,185 INFO L93 Difference]: Finished difference Result 300 states and 470 transitions. [2025-03-08 11:45:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:45:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-08 11:45:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:16,189 INFO L225 Difference]: With dead ends: 300 [2025-03-08 11:45:16,189 INFO L226 Difference]: Without dead ends: 201 [2025-03-08 11:45:16,190 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 11:45:16,191 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 148 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:16,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 412 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:45:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-08 11:45:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2025-03-08 11:45:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.4666666666666666) internal successors, (220), 152 states have internal predecessors, (220), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2025-03-08 11:45:16,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2025-03-08 11:45:16,220 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 202 [2025-03-08 11:45:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:16,221 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2025-03-08 11:45:16,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2025-03-08 11:45:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:16,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:16,223 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:16,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:45:16,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:16,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:16,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1992519099, now seen corresponding path program 1 times [2025-03-08 11:45:16,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:16,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010784461] [2025-03-08 11:45:16,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:16,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:16,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:16,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:16,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:16,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:16,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:16,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:16,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010784461] [2025-03-08 11:45:16,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010784461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:16,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:16,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:45:16,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714255779] [2025-03-08 11:45:16,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:16,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:45:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:16,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:45:16,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:45:16,643 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:16,743 INFO L93 Difference]: Finished difference Result 462 states and 712 transitions. [2025-03-08 11:45:16,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:45:16,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-08 11:45:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:16,748 INFO L225 Difference]: With dead ends: 462 [2025-03-08 11:45:16,750 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 11:45:16,751 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 11:45:16,753 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 74 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:16,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 438 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:45:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 11:45:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 245. [2025-03-08 11:45:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 195 states have (on average 1.471794871794872) internal successors, (287), 198 states have internal predecessors, (287), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 42 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-08 11:45:16,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 377 transitions. [2025-03-08 11:45:16,780 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 377 transitions. Word has length 202 [2025-03-08 11:45:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:16,781 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 377 transitions. [2025-03-08 11:45:16,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 377 transitions. [2025-03-08 11:45:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:16,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:16,785 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:16,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:45:16,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1556871453, now seen corresponding path program 1 times [2025-03-08 11:45:16,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:16,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627188395] [2025-03-08 11:45:16,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:16,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:16,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:16,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:16,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:16,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627188395] [2025-03-08 11:45:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627188395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:27,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:45:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910964730] [2025-03-08 11:45:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:27,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:45:27,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:27,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:45:27,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:45:27,961 INFO L87 Difference]: Start difference. First operand 245 states and 377 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:31,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:31,289 INFO L93 Difference]: Finished difference Result 929 states and 1425 transitions. [2025-03-08 11:45:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:45:31,290 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2025-03-08 11:45:31,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:31,293 INFO L225 Difference]: With dead ends: 929 [2025-03-08 11:45:31,293 INFO L226 Difference]: Without dead ends: 687 [2025-03-08 11:45:31,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:45:31,297 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 751 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:31,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 701 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 11:45:31,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-08 11:45:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 362. [2025-03-08 11:45:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 280 states have (on average 1.45) internal successors, (406), 283 states have internal predecessors, (406), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:45:31,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 558 transitions. [2025-03-08 11:45:31,341 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 558 transitions. Word has length 202 [2025-03-08 11:45:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:31,341 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 558 transitions. [2025-03-08 11:45:31,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 558 transitions. [2025-03-08 11:45:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:31,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:31,343 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:31,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:45:31,343 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:31,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1345520540, now seen corresponding path program 1 times [2025-03-08 11:45:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917976038] [2025-03-08 11:45:31,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:31,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:31,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:31,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:31,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917976038] [2025-03-08 11:45:32,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917976038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:32,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:32,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:45:32,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309656421] [2025-03-08 11:45:32,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:32,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:45:32,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:32,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:45:32,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:45:32,438 INFO L87 Difference]: Start difference. First operand 362 states and 558 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 11:45:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:33,462 INFO L93 Difference]: Finished difference Result 1344 states and 2101 transitions. [2025-03-08 11:45:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:45:33,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 202 [2025-03-08 11:45:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:33,467 INFO L225 Difference]: With dead ends: 1344 [2025-03-08 11:45:33,467 INFO L226 Difference]: Without dead ends: 1102 [2025-03-08 11:45:33,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2025-03-08 11:45:33,468 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 768 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:33,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 985 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:45:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-03-08 11:45:33,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 461. [2025-03-08 11:45:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 379 states have (on average 1.5039577836411608) internal successors, (570), 382 states have internal predecessors, (570), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:45:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 722 transitions. [2025-03-08 11:45:33,496 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 722 transitions. Word has length 202 [2025-03-08 11:45:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:33,496 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 722 transitions. [2025-03-08 11:45:33,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-08 11:45:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 722 transitions. [2025-03-08 11:45:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-08 11:45:33,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:33,498 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:33,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:45:33,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:33,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash -100756059, now seen corresponding path program 1 times [2025-03-08 11:45:33,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:33,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035821199] [2025-03-08 11:45:33,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:33,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:33,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 11:45:33,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 11:45:33,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:33,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:33,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:33,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:33,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035821199] [2025-03-08 11:45:33,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035821199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:33,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:33,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:45:33,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91317453] [2025-03-08 11:45:33,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:33,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:45:33,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:33,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:45:33,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:45:33,908 INFO L87 Difference]: Start difference. First operand 461 states and 722 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:34,275 INFO L93 Difference]: Finished difference Result 862 states and 1346 transitions. [2025-03-08 11:45:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:45:34,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2025-03-08 11:45:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:34,278 INFO L225 Difference]: With dead ends: 862 [2025-03-08 11:45:34,278 INFO L226 Difference]: Without dead ends: 515 [2025-03-08 11:45:34,279 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 11:45:34,280 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 243 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:34,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 592 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 11:45:34,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-08 11:45:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 366. [2025-03-08 11:45:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 284 states have (on average 1.4471830985915493) internal successors, (411), 287 states have internal predecessors, (411), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:45:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2025-03-08 11:45:34,304 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 202 [2025-03-08 11:45:34,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:34,305 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2025-03-08 11:45:34,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2025-03-08 11:45:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:45:34,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:34,306 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:34,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:45:34,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:34,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:34,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1694098160, now seen corresponding path program 1 times [2025-03-08 11:45:34,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:34,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572791510] [2025-03-08 11:45:34,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:34,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:34,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:45:34,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:45:34,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:34,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:43,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572791510] [2025-03-08 11:45:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572791510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:43,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:43,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 11:45:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150387423] [2025-03-08 11:45:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:43,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 11:45:43,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:43,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 11:45:43,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:45:43,476 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:46,198 INFO L93 Difference]: Finished difference Result 831 states and 1274 transitions. [2025-03-08 11:45:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 11:45:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-08 11:45:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:46,204 INFO L225 Difference]: With dead ends: 831 [2025-03-08 11:45:46,205 INFO L226 Difference]: Without dead ends: 589 [2025-03-08 11:45:46,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2025-03-08 11:45:46,206 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 431 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:46,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 670 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:45:46,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-08 11:45:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 436. [2025-03-08 11:45:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 354 states have (on average 1.4774011299435028) internal successors, (523), 357 states have internal predecessors, (523), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:45:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 675 transitions. [2025-03-08 11:45:46,230 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 675 transitions. Word has length 203 [2025-03-08 11:45:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 675 transitions. [2025-03-08 11:45:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:45:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 675 transitions. [2025-03-08 11:45:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:45:46,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:46,233 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:46,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:45:46,233 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:46,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1043330469, now seen corresponding path program 1 times [2025-03-08 11:45:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:46,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240038683] [2025-03-08 11:45:46,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:46,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:46,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:45:46,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:45:46,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:46,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:51,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:51,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240038683] [2025-03-08 11:45:51,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240038683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:51,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:51,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:45:51,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122283683] [2025-03-08 11:45:51,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:51,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:45:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:51,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:45:51,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:45:51,089 INFO L87 Difference]: Start difference. First operand 436 states and 675 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:45:52,624 INFO L93 Difference]: Finished difference Result 1532 states and 2386 transitions. [2025-03-08 11:45:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 11:45:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-08 11:45:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:45:52,629 INFO L225 Difference]: With dead ends: 1532 [2025-03-08 11:45:52,629 INFO L226 Difference]: Without dead ends: 1240 [2025-03-08 11:45:52,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:45:52,630 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1192 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:45:52,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 1154 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 11:45:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2025-03-08 11:45:52,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 510. [2025-03-08 11:45:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 428 states have (on average 1.5093457943925233) internal successors, (646), 431 states have internal predecessors, (646), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:45:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 798 transitions. [2025-03-08 11:45:52,662 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 798 transitions. Word has length 203 [2025-03-08 11:45:52,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:45:52,662 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 798 transitions. [2025-03-08 11:45:52,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:45:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 798 transitions. [2025-03-08 11:45:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:45:52,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:45:52,666 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:45:52,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:45:52,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:45:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:45:52,667 INFO L85 PathProgramCache]: Analyzing trace with hash -607682823, now seen corresponding path program 1 times [2025-03-08 11:45:52,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:45:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146481739] [2025-03-08 11:45:52,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:45:52,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:45:52,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:45:52,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:45:52,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:45:52,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:45:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:45:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:45:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146481739] [2025-03-08 11:45:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146481739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:45:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:45:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 11:45:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595657138] [2025-03-08 11:45:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:45:59,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 11:45:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:45:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 11:45:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 11:45:59,098 INFO L87 Difference]: Start difference. First operand 510 states and 798 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:00,636 INFO L93 Difference]: Finished difference Result 1287 states and 1992 transitions. [2025-03-08 11:46:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:46:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-08 11:46:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:00,640 INFO L225 Difference]: With dead ends: 1287 [2025-03-08 11:46:00,640 INFO L226 Difference]: Without dead ends: 995 [2025-03-08 11:46:00,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2025-03-08 11:46:00,644 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 1082 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:00,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 805 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:46:00,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-08 11:46:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 554. [2025-03-08 11:46:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 472 states have (on average 1.521186440677966) internal successors, (718), 475 states have internal predecessors, (718), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:46:00,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 870 transitions. [2025-03-08 11:46:00,673 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 870 transitions. Word has length 203 [2025-03-08 11:46:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 870 transitions. [2025-03-08 11:46:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 870 transitions. [2025-03-08 11:46:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:46:00,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:00,675 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:46:00,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:00,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1452154694, now seen corresponding path program 1 times [2025-03-08 11:46:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908436572] [2025-03-08 11:46:00,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:00,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:46:00,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:46:00,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:00,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:08,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:08,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908436572] [2025-03-08 11:46:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908436572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:46:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449709753] [2025-03-08 11:46:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:08,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:46:08,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:08,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:46:08,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:46:08,920 INFO L87 Difference]: Start difference. First operand 554 states and 870 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:12,043 INFO L93 Difference]: Finished difference Result 1570 states and 2418 transitions. [2025-03-08 11:46:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 11:46:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-08 11:46:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:12,047 INFO L225 Difference]: With dead ends: 1570 [2025-03-08 11:46:12,047 INFO L226 Difference]: Without dead ends: 1278 [2025-03-08 11:46:12,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2025-03-08 11:46:12,049 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1143 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:12,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1134 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 11:46:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-03-08 11:46:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 570. [2025-03-08 11:46:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 488 states have (on average 1.5225409836065573) internal successors, (743), 491 states have internal predecessors, (743), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:46:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 895 transitions. [2025-03-08 11:46:12,078 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 895 transitions. Word has length 203 [2025-03-08 11:46:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 895 transitions. [2025-03-08 11:46:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:12,079 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 895 transitions. [2025-03-08 11:46:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:46:12,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:12,080 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:12,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:46:12,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:12,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 201434012, now seen corresponding path program 1 times [2025-03-08 11:46:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105442776] [2025-03-08 11:46:12,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:12,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:46:12,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:46:12,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:12,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:12,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:12,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105442776] [2025-03-08 11:46:12,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105442776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 11:46:12,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392162985] [2025-03-08 11:46:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:12,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 11:46:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:12,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 11:46:12,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:46:12,624 INFO L87 Difference]: Start difference. First operand 570 states and 895 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:13,727 INFO L93 Difference]: Finished difference Result 1497 states and 2309 transitions. [2025-03-08 11:46:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 11:46:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-08 11:46:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:13,732 INFO L225 Difference]: With dead ends: 1497 [2025-03-08 11:46:13,732 INFO L226 Difference]: Without dead ends: 1205 [2025-03-08 11:46:13,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2025-03-08 11:46:13,733 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 880 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:13,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 1065 Invalid, 957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:46:13,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2025-03-08 11:46:13,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 639. [2025-03-08 11:46:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 557 states have (on average 1.5421903052064632) internal successors, (859), 560 states have internal predecessors, (859), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:46:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1011 transitions. [2025-03-08 11:46:13,772 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1011 transitions. Word has length 203 [2025-03-08 11:46:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:13,773 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 1011 transitions. [2025-03-08 11:46:13,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1011 transitions. [2025-03-08 11:46:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:46:13,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:13,774 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:13,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:46:13,775 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:13,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:13,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1110337222, now seen corresponding path program 1 times [2025-03-08 11:46:13,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:13,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254598673] [2025-03-08 11:46:13,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:13,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:13,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:46:13,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:46:13,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:13,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254598673] [2025-03-08 11:46:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254598673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:20,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:46:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074636676] [2025-03-08 11:46:20,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:20,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:46:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:20,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:46:20,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:46:20,590 INFO L87 Difference]: Start difference. First operand 639 states and 1011 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:24,342 INFO L93 Difference]: Finished difference Result 1480 states and 2273 transitions. [2025-03-08 11:46:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 11:46:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-08 11:46:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:24,346 INFO L225 Difference]: With dead ends: 1480 [2025-03-08 11:46:24,346 INFO L226 Difference]: Without dead ends: 1188 [2025-03-08 11:46:24,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=244, Invalid=686, Unknown=0, NotChecked=0, Total=930 [2025-03-08 11:46:24,347 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 780 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:24,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1304 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 11:46:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2025-03-08 11:46:24,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 641. [2025-03-08 11:46:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 559 states have (on average 1.5438282647584973) internal successors, (863), 562 states have internal predecessors, (863), 76 states have call successors, (76), 5 states have call predecessors, (76), 5 states have return successors, (76), 73 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 11:46:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1015 transitions. [2025-03-08 11:46:24,381 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1015 transitions. Word has length 203 [2025-03-08 11:46:24,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:24,381 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 1015 transitions. [2025-03-08 11:46:24,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1015 transitions. [2025-03-08 11:46:24,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:46:24,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:24,383 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:24,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:46:24,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:24,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:24,384 INFO L85 PathProgramCache]: Analyzing trace with hash -674689576, now seen corresponding path program 1 times [2025-03-08 11:46:24,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:24,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160132757] [2025-03-08 11:46:24,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:24,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:24,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:46:24,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:46:24,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:24,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:24,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:24,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160132757] [2025-03-08 11:46:24,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160132757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:24,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:24,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:46:24,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665682880] [2025-03-08 11:46:24,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:24,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:46:24,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:24,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:46:24,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:46:24,509 INFO L87 Difference]: Start difference. First operand 641 states and 1015 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:24,589 INFO L93 Difference]: Finished difference Result 1008 states and 1572 transitions. [2025-03-08 11:46:24,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:46:24,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-03-08 11:46:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:24,592 INFO L225 Difference]: With dead ends: 1008 [2025-03-08 11:46:24,592 INFO L226 Difference]: Without dead ends: 685 [2025-03-08 11:46:24,593 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 11:46:24,594 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 122 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:24,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 467 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:46:24,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-08 11:46:24,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 540. [2025-03-08 11:46:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 465 states have (on average 1.5182795698924731) internal successors, (706), 466 states have internal predecessors, (706), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:46:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 842 transitions. [2025-03-08 11:46:24,619 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 842 transitions. Word has length 203 [2025-03-08 11:46:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:24,620 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 842 transitions. [2025-03-08 11:46:24,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 842 transitions. [2025-03-08 11:46:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-08 11:46:24,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:24,621 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:24,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:46:24,622 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:24,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:24,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1519161447, now seen corresponding path program 1 times [2025-03-08 11:46:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:24,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533319293] [2025-03-08 11:46:24,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:24,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:24,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 11:46:24,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 11:46:24,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:24,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:31,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533319293] [2025-03-08 11:46:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533319293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:31,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:31,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 11:46:31,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590666035] [2025-03-08 11:46:31,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:31,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 11:46:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:31,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 11:46:31,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-08 11:46:31,990 INFO L87 Difference]: Start difference. First operand 540 states and 842 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:34,585 INFO L93 Difference]: Finished difference Result 1099 states and 1704 transitions. [2025-03-08 11:46:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 11:46:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 203 [2025-03-08 11:46:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:34,589 INFO L225 Difference]: With dead ends: 1099 [2025-03-08 11:46:34,589 INFO L226 Difference]: Without dead ends: 835 [2025-03-08 11:46:34,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2025-03-08 11:46:34,590 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 515 mSDsluCounter, 949 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:34,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1124 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 11:46:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-03-08 11:46:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 589. [2025-03-08 11:46:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 514 states have (on average 1.5291828793774318) internal successors, (786), 515 states have internal predecessors, (786), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:46:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 922 transitions. [2025-03-08 11:46:34,619 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 922 transitions. Word has length 203 [2025-03-08 11:46:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:34,619 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 922 transitions. [2025-03-08 11:46:34,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-08 11:46:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 922 transitions. [2025-03-08 11:46:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:46:34,620 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:34,621 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:34,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:46:34,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:34,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:34,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1008074225, now seen corresponding path program 1 times [2025-03-08 11:46:34,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:34,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777472078] [2025-03-08 11:46:34,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:34,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:34,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:46:34,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:46:34,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:34,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:46:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-08 11:46:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:46:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777472078] [2025-03-08 11:46:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777472078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:46:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:46:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:46:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146618299] [2025-03-08 11:46:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:46:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:46:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:46:34,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:46:34,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:46:34,687 INFO L87 Difference]: Start difference. First operand 589 states and 922 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:46:34,749 INFO L93 Difference]: Finished difference Result 1268 states and 1988 transitions. [2025-03-08 11:46:34,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:46:34,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-03-08 11:46:34,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:46:34,752 INFO L225 Difference]: With dead ends: 1268 [2025-03-08 11:46:34,753 INFO L226 Difference]: Without dead ends: 878 [2025-03-08 11:46:34,754 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 11:46:34,754 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 133 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 526 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.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:46:34,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 526 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:46:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-08 11:46:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 696. [2025-03-08 11:46:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 621 states have (on average 1.500805152979066) internal successors, (932), 622 states have internal predecessors, (932), 68 states have call successors, (68), 6 states have call predecessors, (68), 6 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 11:46:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1068 transitions. [2025-03-08 11:46:34,782 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1068 transitions. Word has length 204 [2025-03-08 11:46:34,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:46:34,782 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 1068 transitions. [2025-03-08 11:46:34,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-08 11:46:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1068 transitions. [2025-03-08 11:46:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 11:46:34,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:46:34,784 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:46:34,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 11:46:34,784 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:46:34,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:46:34,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1111239412, now seen corresponding path program 1 times [2025-03-08 11:46:34,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:46:34,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008859656] [2025-03-08 11:46:34,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:46:34,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:46:34,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 11:46:34,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 11:46:34,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:46:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat