./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.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_fillercodesize_ps-cn-250_file-87.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 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:03:19,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:03:19,732 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:03:19,739 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:03:19,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:03:19,761 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:03:19,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:03:19,762 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:03:19,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:03:19,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:03:19,764 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:03:19,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:03:19,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:03:19,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:03:19,764 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:03:19,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:03:19,765 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:03:19,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:03:19,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:03:19,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:03:19,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:03:19,767 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 -> 6257c3f163e6ff273e80adb62a710763b7566e9519a02e63ef5b17a79923aac8 [2025-03-08 11:03:19,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:03:19,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:03:19,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:03:19,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:03:19,998 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:03:19,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-08 11:03:21,149 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe9de278/1f1f34b919c548bd9f4652abd47b4aed/FLAGdbf0cea5a [2025-03-08 11:03:21,408 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:03:21,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-08 11:03:21,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe9de278/1f1f34b919c548bd9f4652abd47b4aed/FLAGdbf0cea5a [2025-03-08 11:03:21,723 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe9de278/1f1f34b919c548bd9f4652abd47b4aed [2025-03-08 11:03:21,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:03:21,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:03:21,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:03:21,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:03:21,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:03:21,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:03:21" (1/1) ... [2025-03-08 11:03:21,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@778909ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:21, skipping insertion in model container [2025-03-08 11:03:21,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:03:21" (1/1) ... [2025-03-08 11:03:21,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:03:21,851 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-08 11:03:21,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:03:21,952 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:03:21,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-87.i[916,929] [2025-03-08 11:03:22,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:03:22,031 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:03:22,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22 WrapperNode [2025-03-08 11:03:22,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:03:22,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:03:22,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:03:22,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:03:22,038 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:03:22" (1/1) ... [2025-03-08 11:03:22,049 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:03:22" (1/1) ... [2025-03-08 11:03:22,086 INFO L138 Inliner]: procedures = 26, calls = 107, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 599 [2025-03-08 11:03:22,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:03:22,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:03:22,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:03:22,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:03:22,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,136 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:03:22,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,156 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:03:22,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:03:22,180 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:03:22,180 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:03:22,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (1/1) ... [2025-03-08 11:03:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:03:22,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:03:22,210 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:03:22,211 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:03:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:03:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:03:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:03:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:03:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:03:22,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:03:22,326 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:03:22,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:03:23,022 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 11:03:23,022 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:03:23,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:03:23,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:03:23,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:03:23 BoogieIcfgContainer [2025-03-08 11:03:23,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:03:23,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:03:23,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:03:23,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:03:23,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:03:21" (1/3) ... [2025-03-08 11:03:23,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7906937c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:03:23, skipping insertion in model container [2025-03-08 11:03:23,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:03:22" (2/3) ... [2025-03-08 11:03:23,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7906937c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:03:23, skipping insertion in model container [2025-03-08 11:03:23,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:03:23" (3/3) ... [2025-03-08 11:03:23,056 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i [2025-03-08 11:03:23,066 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:03:23,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-87.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:03:23,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:03:23,134 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;@4c3db61e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:03:23,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:03:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 11:03:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-03-08 11:03:23,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:23,162 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,162 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:23,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 893154587, now seen corresponding path program 1 times [2025-03-08 11:03:23,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:23,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779484108] [2025-03-08 11:03:23,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:23,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:23,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 11:03:23,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 11:03:23,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:23,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-08 11:03:23,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779484108] [2025-03-08 11:03:23,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779484108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:03:23,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303997843] [2025-03-08 11:03:23,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:23,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:03:23,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:03:23,657 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:03:23,659 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:03:23,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-03-08 11:03:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-03-08 11:03:23,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:23,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:23,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:03:23,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:03:24,003 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 17298 trivial. 0 not checked. [2025-03-08 11:03:24,004 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:03:24,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303997843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:24,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:03:24,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:03:24,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362570815] [2025-03-08 11:03:24,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:24,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:03:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:24,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:03:24,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:03:24,029 INFO L87 Difference]: Start difference. First operand has 256 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 160 states have internal predecessors, (239), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) Second operand has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-08 11:03:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:24,087 INFO L93 Difference]: Finished difference Result 506 states and 943 transitions. [2025-03-08 11:03:24,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:03:24,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) Word has length 577 [2025-03-08 11:03:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:24,097 INFO L225 Difference]: With dead ends: 506 [2025-03-08 11:03:24,097 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 11:03:24,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 578 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:03:24,104 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:24,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 412 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:03:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 11:03:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-03-08 11:03:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 157 states have (on average 1.4777070063694266) internal successors, (232), 157 states have internal predecessors, (232), 94 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 11:03:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 420 transitions. [2025-03-08 11:03:24,175 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 420 transitions. Word has length 577 [2025-03-08 11:03:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:24,177 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 420 transitions. [2025-03-08 11:03:24,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.0) internal successors, (112), 2 states have internal predecessors, (112), 2 states have call successors, (94), 2 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 2 states have call successors, (94) [2025-03-08 11:03:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 420 transitions. [2025-03-08 11:03:24,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2025-03-08 11:03:24,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:24,189 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:24,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:03:24,390 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:03:24,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:24,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:24,391 INFO L85 PathProgramCache]: Analyzing trace with hash -379263070, now seen corresponding path program 1 times [2025-03-08 11:03:24,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:24,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263026242] [2025-03-08 11:03:24,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:24,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 578 statements into 1 equivalence classes. [2025-03-08 11:03:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 578 of 578 statements. [2025-03-08 11:03:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:24,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:24,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263026242] [2025-03-08 11:03:24,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263026242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:24,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:03:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619097169] [2025-03-08 11:03:24,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:24,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:03:24,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:24,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:03:24,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:24,974 INFO L87 Difference]: Start difference. First operand 253 states and 420 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:25,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:25,070 INFO L93 Difference]: Finished difference Result 667 states and 1114 transitions. [2025-03-08 11:03:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:03:25,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 578 [2025-03-08 11:03:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:25,077 INFO L225 Difference]: With dead ends: 667 [2025-03-08 11:03:25,077 INFO L226 Difference]: Without dead ends: 417 [2025-03-08 11:03:25,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:25,081 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 265 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:25,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 913 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:03:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-08 11:03:25,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2025-03-08 11:03:25,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 275 states have (on average 1.5345454545454544) internal successors, (422), 276 states have internal predecessors, (422), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 135 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 11:03:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 694 transitions. [2025-03-08 11:03:25,137 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 694 transitions. Word has length 578 [2025-03-08 11:03:25,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:25,140 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 694 transitions. [2025-03-08 11:03:25,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:25,140 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 694 transitions. [2025-03-08 11:03:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:25,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:25,147 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:03:25,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:25,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:25,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1235912810, now seen corresponding path program 1 times [2025-03-08 11:03:25,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:25,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065381308] [2025-03-08 11:03:25,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:25,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:25,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:25,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:25,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:25,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065381308] [2025-03-08 11:03:25,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065381308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:25,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:25,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:03:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819121786] [2025-03-08 11:03:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:25,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:03:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:25,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:03:25,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:25,458 INFO L87 Difference]: Start difference. First operand 414 states and 694 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:25,547 INFO L93 Difference]: Finished difference Result 1113 states and 1867 transitions. [2025-03-08 11:03:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:03:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-08 11:03:25,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:25,557 INFO L225 Difference]: With dead ends: 1113 [2025-03-08 11:03:25,558 INFO L226 Difference]: Without dead ends: 702 [2025-03-08 11:03:25,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:25,561 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 253 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:25,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 914 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:03:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-08 11:03:25,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 699. [2025-03-08 11:03:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 467 states have (on average 1.5331905781584583) internal successors, (716), 470 states have internal predecessors, (716), 227 states have call successors, (227), 4 states have call predecessors, (227), 4 states have return successors, (227), 224 states have call predecessors, (227), 227 states have call successors, (227) [2025-03-08 11:03:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1170 transitions. [2025-03-08 11:03:25,630 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1170 transitions. Word has length 579 [2025-03-08 11:03:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:25,631 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 1170 transitions. [2025-03-08 11:03:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1170 transitions. [2025-03-08 11:03:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:25,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:25,651 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:03:25,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:25,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1204893003, now seen corresponding path program 1 times [2025-03-08 11:03:25,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:25,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811529629] [2025-03-08 11:03:25,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:25,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:25,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:25,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:25,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:25,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811529629] [2025-03-08 11:03:25,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811529629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:25,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:25,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:03:25,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064804257] [2025-03-08 11:03:25,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:25,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:03:25,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:25,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:03:25,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:25,834 INFO L87 Difference]: Start difference. First operand 699 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:25,924 INFO L93 Difference]: Finished difference Result 1983 states and 3322 transitions. [2025-03-08 11:03:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:03:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-08 11:03:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:25,934 INFO L225 Difference]: With dead ends: 1983 [2025-03-08 11:03:25,934 INFO L226 Difference]: Without dead ends: 1287 [2025-03-08 11:03:25,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:25,937 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 261 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:25,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 1032 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:03:25,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2025-03-08 11:03:26,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1284. [2025-03-08 11:03:26,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 860 states have (on average 1.533720930232558) internal successors, (1319), 867 states have internal predecessors, (1319), 415 states have call successors, (415), 8 states have call predecessors, (415), 8 states have return successors, (415), 408 states have call predecessors, (415), 415 states have call successors, (415) [2025-03-08 11:03:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 2149 transitions. [2025-03-08 11:03:26,042 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 2149 transitions. Word has length 579 [2025-03-08 11:03:26,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:26,043 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 2149 transitions. [2025-03-08 11:03:26,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 2149 transitions. [2025-03-08 11:03:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:26,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:26,050 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:26,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:03:26,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:26,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash 745407252, now seen corresponding path program 1 times [2025-03-08 11:03:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:26,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310893245] [2025-03-08 11:03:26,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:26,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:26,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:26,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:26,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:26,623 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:26,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:26,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310893245] [2025-03-08 11:03:26,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310893245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:26,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:26,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:03:26,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304675089] [2025-03-08 11:03:26,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:26,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:03:26,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:26,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:03:26,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:03:26,627 INFO L87 Difference]: Start difference. First operand 1284 states and 2149 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:27,434 INFO L93 Difference]: Finished difference Result 4278 states and 7089 transitions. [2025-03-08 11:03:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:03:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-08 11:03:27,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:27,451 INFO L225 Difference]: With dead ends: 4278 [2025-03-08 11:03:27,451 INFO L226 Difference]: Without dead ends: 2997 [2025-03-08 11:03:27,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:03:27,456 INFO L435 NwaCegarLoop]: 668 mSDtfsCounter, 942 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:27,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 2278 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:03:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-03-08 11:03:27,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2563. [2025-03-08 11:03:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2563 states, 1787 states have (on average 1.5540011191941803) internal successors, (2777), 1802 states have internal predecessors, (2777), 751 states have call successors, (751), 24 states have call predecessors, (751), 24 states have return successors, (751), 736 states have call predecessors, (751), 751 states have call successors, (751) [2025-03-08 11:03:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4279 transitions. [2025-03-08 11:03:27,676 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4279 transitions. Word has length 579 [2025-03-08 11:03:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:27,679 INFO L471 AbstractCegarLoop]: Abstraction has 2563 states and 4279 transitions. [2025-03-08 11:03:27,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4279 transitions. [2025-03-08 11:03:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:27,685 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:27,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:03:27,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash 71513268, now seen corresponding path program 1 times [2025-03-08 11:03:27,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:27,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641443309] [2025-03-08 11:03:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:27,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:27,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:27,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:28,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641443309] [2025-03-08 11:03:28,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641443309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:28,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:28,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:03:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743044269] [2025-03-08 11:03:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:28,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:03:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:28,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:03:28,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:03:28,254 INFO L87 Difference]: Start difference. First operand 2563 states and 4279 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:29,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:29,386 INFO L93 Difference]: Finished difference Result 7559 states and 12595 transitions. [2025-03-08 11:03:29,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:03:29,387 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-08 11:03:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:29,416 INFO L225 Difference]: With dead ends: 7559 [2025-03-08 11:03:29,416 INFO L226 Difference]: Without dead ends: 4999 [2025-03-08 11:03:29,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 11:03:29,425 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 917 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:29,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1990 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 11:03:29,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4999 states. [2025-03-08 11:03:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4999 to 4985. [2025-03-08 11:03:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4985 states, 3434 states have (on average 1.539895165987187) internal successors, (5288), 3464 states have internal predecessors, (5288), 1502 states have call successors, (1502), 48 states have call predecessors, (1502), 48 states have return successors, (1502), 1472 states have call predecessors, (1502), 1502 states have call successors, (1502) [2025-03-08 11:03:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4985 states to 4985 states and 8292 transitions. [2025-03-08 11:03:29,701 INFO L78 Accepts]: Start accepts. Automaton has 4985 states and 8292 transitions. Word has length 579 [2025-03-08 11:03:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:29,702 INFO L471 AbstractCegarLoop]: Abstraction has 4985 states and 8292 transitions. [2025-03-08 11:03:29,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:29,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4985 states and 8292 transitions. [2025-03-08 11:03:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:29,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:29,708 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:29,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:03:29,709 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:29,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash 2005576786, now seen corresponding path program 1 times [2025-03-08 11:03:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709923136] [2025-03-08 11:03:29,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:29,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:29,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:29,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:29,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709923136] [2025-03-08 11:03:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709923136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:03:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454151644] [2025-03-08 11:03:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:03:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:30,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:03:30,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:03:30,209 INFO L87 Difference]: Start difference. First operand 4985 states and 8292 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:31,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:31,013 INFO L93 Difference]: Finished difference Result 24085 states and 39980 transitions. [2025-03-08 11:03:31,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:03:31,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 579 [2025-03-08 11:03:31,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:31,118 INFO L225 Difference]: With dead ends: 24085 [2025-03-08 11:03:31,118 INFO L226 Difference]: Without dead ends: 19103 [2025-03-08 11:03:31,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:03:31,144 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 899 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:31,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1910 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 11:03:31,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19103 states. [2025-03-08 11:03:32,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19103 to 19089. [2025-03-08 11:03:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19089 states, 13060 states have (on average 1.5188361408882083) internal successors, (19836), 13184 states have internal predecessors, (19836), 5836 states have call successors, (5836), 192 states have call predecessors, (5836), 192 states have return successors, (5836), 5712 states have call predecessors, (5836), 5836 states have call successors, (5836) [2025-03-08 11:03:32,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19089 states to 19089 states and 31508 transitions. [2025-03-08 11:03:32,355 INFO L78 Accepts]: Start accepts. Automaton has 19089 states and 31508 transitions. Word has length 579 [2025-03-08 11:03:32,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:32,356 INFO L471 AbstractCegarLoop]: Abstraction has 19089 states and 31508 transitions. [2025-03-08 11:03:32,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:03:32,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19089 states and 31508 transitions. [2025-03-08 11:03:32,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2025-03-08 11:03:32,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:32,372 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:32,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:03:32,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:32,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:32,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1500018161, now seen corresponding path program 1 times [2025-03-08 11:03:32,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:32,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644651080] [2025-03-08 11:03:32,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:32,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:32,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:32,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:32,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:32,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 42 proven. 237 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-08 11:03:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644651080] [2025-03-08 11:03:33,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644651080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:03:33,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536456138] [2025-03-08 11:03:33,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:33,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:03:33,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:03:33,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:03:33,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:03:33,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 579 statements into 1 equivalence classes. [2025-03-08 11:03:33,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 579 of 579 statements. [2025-03-08 11:03:33,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:33,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:33,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 11:03:33,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:03:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 4545 proven. 237 refuted. 0 times theorem prover too weak. 12702 trivial. 0 not checked. [2025-03-08 11:03:35,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:03:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 42 proven. 237 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-08 11:03:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536456138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:03:35,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:03:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2025-03-08 11:03:35,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795723740] [2025-03-08 11:03:35,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:03:35,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 11:03:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:35,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 11:03:35,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-08 11:03:35,812 INFO L87 Difference]: Start difference. First operand 19089 states and 31508 transitions. Second operand has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) [2025-03-08 11:03:38,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:38,660 INFO L93 Difference]: Finished difference Result 55188 states and 90385 transitions. [2025-03-08 11:03:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 11:03:38,665 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) Word has length 579 [2025-03-08 11:03:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:38,816 INFO L225 Difference]: With dead ends: 55188 [2025-03-08 11:03:38,816 INFO L226 Difference]: Without dead ends: 36102 [2025-03-08 11:03:38,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1185 GetRequests, 1148 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=916, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 11:03:38,892 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 1888 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:38,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 1497 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 11:03:38,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2025-03-08 11:03:40,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 32447. [2025-03-08 11:03:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32447 states, 24355 states have (on average 1.538205707246972) internal successors, (37463), 24608 states have internal predecessors, (37463), 7642 states have call successors, (7642), 449 states have call predecessors, (7642), 449 states have return successors, (7642), 7389 states have call predecessors, (7642), 7642 states have call successors, (7642) [2025-03-08 11:03:40,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32447 states to 32447 states and 52747 transitions. [2025-03-08 11:03:40,487 INFO L78 Accepts]: Start accepts. Automaton has 32447 states and 52747 transitions. Word has length 579 [2025-03-08 11:03:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 32447 states and 52747 transitions. [2025-03-08 11:03:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.5) internal successors, (261), 18 states have internal predecessors, (261), 4 states have call successors, (188), 3 states have call predecessors, (188), 6 states have return successors, (189), 4 states have call predecessors, (189), 4 states have call successors, (189) [2025-03-08 11:03:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32447 states and 52747 transitions. [2025-03-08 11:03:40,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2025-03-08 11:03:40,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:40,509 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:40,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:03:40,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 11:03:40,714 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:40,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:40,715 INFO L85 PathProgramCache]: Analyzing trace with hash 313870904, now seen corresponding path program 1 times [2025-03-08 11:03:40,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:40,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999676583] [2025-03-08 11:03:40,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:40,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:40,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 11:03:40,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 11:03:40,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 147 proven. 132 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-08 11:03:41,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999676583] [2025-03-08 11:03:41,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999676583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:03:41,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610679751] [2025-03-08 11:03:41,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:41,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:03:41,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:03:41,047 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:03:41,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:03:41,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 580 statements into 1 equivalence classes. [2025-03-08 11:03:41,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 580 of 580 statements. [2025-03-08 11:03:41,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:41,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 11:03:41,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:03:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 5643 proven. 54 refuted. 0 times theorem prover too weak. 11787 trivial. 0 not checked. [2025-03-08 11:03:42,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:03:42,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 225 proven. 54 refuted. 0 times theorem prover too weak. 17205 trivial. 0 not checked. [2025-03-08 11:03:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610679751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:03:42,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:03:42,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 17 [2025-03-08 11:03:42,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224156875] [2025-03-08 11:03:42,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:03:42,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 11:03:42,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:42,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 11:03:42,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-08 11:03:42,942 INFO L87 Difference]: Start difference. First operand 32447 states and 52747 transitions. Second operand has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) [2025-03-08 11:03:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:03:50,697 INFO L93 Difference]: Finished difference Result 115169 states and 183193 transitions. [2025-03-08 11:03:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 11:03:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) Word has length 580 [2025-03-08 11:03:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:03:51,010 INFO L225 Difference]: With dead ends: 115169 [2025-03-08 11:03:51,010 INFO L226 Difference]: Without dead ends: 82751 [2025-03-08 11:03:51,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1160 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1045, Invalid=3245, Unknown=0, NotChecked=0, Total=4290 [2025-03-08 11:03:51,084 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 2945 mSDsluCounter, 3699 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 1745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2997 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 5751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1745 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-08 11:03:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2997 Valid, 4115 Invalid, 5751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1745 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-08 11:03:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82751 states. [2025-03-08 11:03:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82751 to 52926. [2025-03-08 11:03:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52926 states, 38373 states have (on average 1.4816407369765199) internal successors, (56855), 38775 states have internal predecessors, (56855), 13617 states have call successors, (13617), 935 states have call predecessors, (13617), 935 states have return successors, (13617), 13215 states have call predecessors, (13617), 13617 states have call successors, (13617) [2025-03-08 11:03:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52926 states to 52926 states and 84089 transitions. [2025-03-08 11:03:55,777 INFO L78 Accepts]: Start accepts. Automaton has 52926 states and 84089 transitions. Word has length 580 [2025-03-08 11:03:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:03:55,777 INFO L471 AbstractCegarLoop]: Abstraction has 52926 states and 84089 transitions. [2025-03-08 11:03:55,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.352941176470587) internal successors, (312), 17 states have internal predecessors, (312), 6 states have call successors, (282), 3 states have call predecessors, (282), 6 states have return successors, (282), 6 states have call predecessors, (282), 6 states have call successors, (282) [2025-03-08 11:03:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 52926 states and 84089 transitions. [2025-03-08 11:03:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 11:03:55,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:03:55,801 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:55,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:03:56,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:03:56,003 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:03:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:03:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 718063083, now seen corresponding path program 1 times [2025-03-08 11:03:56,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:03:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869131872] [2025-03-08 11:03:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:03:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:03:56,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 11:03:56,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 11:03:56,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:03:56,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:03:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:03:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:03:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869131872] [2025-03-08 11:03:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869131872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:03:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:03:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:03:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058172142] [2025-03-08 11:03:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:03:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:03:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:03:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:03:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:03:56,310 INFO L87 Difference]: Start difference. First operand 52926 states and 84089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:04:01,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:01,095 INFO L93 Difference]: Finished difference Result 98790 states and 155795 transitions. [2025-03-08 11:04:01,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:04:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 581 [2025-03-08 11:04:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:01,351 INFO L225 Difference]: With dead ends: 98790 [2025-03-08 11:04:01,351 INFO L226 Difference]: Without dead ends: 62980 [2025-03-08 11:04:01,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:04:01,453 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 407 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 777 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:04:01,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 777 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:04:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62980 states. [2025-03-08 11:04:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62980 to 62978. [2025-03-08 11:04:05,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62978 states, 42929 states have (on average 1.4308043513708681) internal successors, (61423), 43327 states have internal predecessors, (61423), 18681 states have call successors, (18681), 1367 states have call predecessors, (18681), 1367 states have return successors, (18681), 18283 states have call predecessors, (18681), 18681 states have call successors, (18681) [2025-03-08 11:04:06,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62978 states to 62978 states and 98785 transitions. [2025-03-08 11:04:06,150 INFO L78 Accepts]: Start accepts. Automaton has 62978 states and 98785 transitions. Word has length 581 [2025-03-08 11:04:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:04:06,151 INFO L471 AbstractCegarLoop]: Abstraction has 62978 states and 98785 transitions. [2025-03-08 11:04:06,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:04:06,151 INFO L276 IsEmpty]: Start isEmpty. Operand 62978 states and 98785 transitions. [2025-03-08 11:04:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2025-03-08 11:04:06,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:04:06,169 INFO L218 NwaCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:06,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:04:06,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:04:06,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:04:06,170 INFO L85 PathProgramCache]: Analyzing trace with hash -465284214, now seen corresponding path program 1 times [2025-03-08 11:04:06,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:04:06,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549029869] [2025-03-08 11:04:06,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:04:06,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:04:06,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 581 statements into 1 equivalence classes. [2025-03-08 11:04:06,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 581 of 581 statements. [2025-03-08 11:04:06,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:04:06,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:04:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17484 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17484 trivial. 0 not checked. [2025-03-08 11:04:07,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:04:07,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549029869] [2025-03-08 11:04:07,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549029869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:04:07,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:04:07,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:04:07,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076476017] [2025-03-08 11:04:07,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:04:07,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:04:07,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:04:07,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:04:07,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:04:07,506 INFO L87 Difference]: Start difference. First operand 62978 states and 98785 transitions. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) [2025-03-08 11:04:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:04:23,840 INFO L93 Difference]: Finished difference Result 217915 states and 341985 transitions. [2025-03-08 11:04:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:04:23,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 1 states have call successors, (94), 1 states have call predecessors, (94), 1 states have return successors, (94), 1 states have call predecessors, (94), 1 states have call successors, (94) Word has length 581 [2025-03-08 11:04:23,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:04:24,484 INFO L225 Difference]: With dead ends: 217915 [2025-03-08 11:04:24,485 INFO L226 Difference]: Without dead ends: 189991 [2025-03-08 11:04:24,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:04:24,603 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 2061 mSDsluCounter, 1770 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 894 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2061 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 894 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:04:24,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2061 Valid, 2406 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [894 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 11:04:24,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189991 states. [2025-03-08 11:04:37,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189991 to 134026. [2025-03-08 11:04:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134026 states, 93961 states have (on average 1.4618299081533828) internal successors, (137355), 94755 states have internal predecessors, (137355), 37333 states have call successors, (37333), 2731 states have call predecessors, (37333), 2731 states have return successors, (37333), 36539 states have call predecessors, (37333), 37333 states have call successors, (37333)