./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:51:54,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:51:55,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:51:55,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:51:55,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:51:55,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:51:55,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:51:55,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:51:55,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:51:55,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:51:55,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:51:55,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:51:55,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:51:55,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:51:55,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:51:55,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:51:55,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:55,049 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:51:55,050 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:51:55,050 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 -> 4b9308720d07799738d2bf3272bc150196623be74b0092d021bdb1b9cd368313 [2025-03-08 10:51:55,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:51:55,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:51:55,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:51:55,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:51:55,275 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:51:55,278 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-10_file-81.i [2025-03-08 10:51:56,391 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51830cc51/a1f5d288d80a45c28ede1e927344407a/FLAG1ffcda25a [2025-03-08 10:51:56,643 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:51:56,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2025-03-08 10:51:56,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51830cc51/a1f5d288d80a45c28ede1e927344407a/FLAG1ffcda25a [2025-03-08 10:51:56,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51830cc51/a1f5d288d80a45c28ede1e927344407a [2025-03-08 10:51:56,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:51:56,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:51:56,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:56,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:51:56,969 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:51:56,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:56" (1/1) ... [2025-03-08 10:51:56,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ad754f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:56, skipping insertion in model container [2025-03-08 10:51:56,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:56" (1/1) ... [2025-03-08 10:51:56,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:51:57,073 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-10_file-81.i[915,928] [2025-03-08 10:51:57,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:57,150 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:51:57,158 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-10_file-81.i[915,928] [2025-03-08 10:51:57,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:57,207 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:51:57,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57 WrapperNode [2025-03-08 10:51:57,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:57,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:57,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:51:57,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:51:57,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,265 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2025-03-08 10:51:57,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:57,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:51:57,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:51:57,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:51:57,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,303 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 10:51:57,304 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,322 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:51:57,327 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:51:57,327 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:51:57,327 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:51:57,328 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (1/1) ... [2025-03-08 10:51:57,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:57,354 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 10:51:57,356 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 10:51:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:51:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:51:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:51:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:51:57,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:51:57,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:51:57,442 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:51:57,444 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:51:57,741 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-08 10:51:57,773 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:51:57,775 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:51:57,790 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:51:57,790 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:51:57,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:57 BoogieIcfgContainer [2025-03-08 10:51:57,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:51:57,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:51:57,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:51:57,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:51:57,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:56" (1/3) ... [2025-03-08 10:51:57,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ec4773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:57, skipping insertion in model container [2025-03-08 10:51:57,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:57" (2/3) ... [2025-03-08 10:51:57,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ec4773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:57, skipping insertion in model container [2025-03-08 10:51:57,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:57" (3/3) ... [2025-03-08 10:51:57,797 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-81.i [2025-03-08 10:51:57,808 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:51:57,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-81.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:51:57,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:51:57,863 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;@61dc9c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:51:57,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:51:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:51:57,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:57,878 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:57,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:57,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1150102994, now seen corresponding path program 1 times [2025-03-08 10:51:57,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:57,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118759044] [2025-03-08 10:51:57,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:57,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:57,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:51:57,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:51:57,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:57,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:51:58,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118759044] [2025-03-08 10:51:58,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118759044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:51:58,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759662559] [2025-03-08 10:51:58,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:58,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:58,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:58,210 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 10:51:58,211 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 10:51:58,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:51:58,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:51:58,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:58,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:58,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:51:58,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-03-08 10:51:58,428 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:58,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759662559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:58,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:51:58,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:51:58,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011496647] [2025-03-08 10:51:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:58,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:51:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:51:58,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:58,450 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 54 states have internal predecessors, (71), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:51:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:58,484 INFO L93 Difference]: Finished difference Result 172 states and 302 transitions. [2025-03-08 10:51:58,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:51:58,486 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:51:58,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:58,492 INFO L225 Difference]: With dead ends: 172 [2025-03-08 10:51:58,492 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:51:58,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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 10:51:58,499 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:58,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:51:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:51:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 10:51:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2025-03-08 10:51:58,541 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 204 [2025-03-08 10:51:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:58,543 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2025-03-08 10:51:58,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:51:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2025-03-08 10:51:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:51:58,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:58,547 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:51:58,555 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 10:51:58,748 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 10:51:58,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:58,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1345673297, now seen corresponding path program 1 times [2025-03-08 10:51:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236132944] [2025-03-08 10:51:58,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:58,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:51:58,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:51:58,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:08,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236132944] [2025-03-08 10:52:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236132944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:08,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:52:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748866669] [2025-03-08 10:52:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:08,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:52:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:08,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:52:08,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:52:08,639 INFO L87 Difference]: Start difference. First operand 86 states and 132 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:10,318 INFO L93 Difference]: Finished difference Result 254 states and 381 transitions. [2025-03-08 10:52:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:52:10,320 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:52:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:10,322 INFO L225 Difference]: With dead ends: 254 [2025-03-08 10:52:10,322 INFO L226 Difference]: Without dead ends: 171 [2025-03-08 10:52:10,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-03-08 10:52:10,323 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 313 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:10,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 530 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 10:52:10,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-08 10:52:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 99. [2025-03-08 10:52:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.34375) internal successors, (86), 64 states have internal predecessors, (86), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:52:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 152 transitions. [2025-03-08 10:52:10,336 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 152 transitions. Word has length 204 [2025-03-08 10:52:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 152 transitions. [2025-03-08 10:52:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 152 transitions. [2025-03-08 10:52:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:52:10,339 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:10,339 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:10,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:52:10,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:10,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:10,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1542186802, now seen corresponding path program 1 times [2025-03-08 10:52:10,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:10,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145640451] [2025-03-08 10:52:10,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:10,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:52:10,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:52:10,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:10,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:10,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:10,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145640451] [2025-03-08 10:52:10,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145640451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:10,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:10,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:52:10,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534129416] [2025-03-08 10:52:10,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:52:10,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:10,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:52:10,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:52:10,517 INFO L87 Difference]: Start difference. First operand 99 states and 152 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:10,575 INFO L93 Difference]: Finished difference Result 227 states and 345 transitions. [2025-03-08 10:52:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:52:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:52:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:10,579 INFO L225 Difference]: With dead ends: 227 [2025-03-08 10:52:10,580 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 10:52:10,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:52:10,581 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 42 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:10,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 380 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:52:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 10:52:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-08 10:52:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 89 states have internal predecessors, (117), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-08 10:52:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2025-03-08 10:52:10,593 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 204 [2025-03-08 10:52:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:10,593 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2025-03-08 10:52:10,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2025-03-08 10:52:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:52:10,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:10,595 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:10,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:52:10,596 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:10,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1152342640, now seen corresponding path program 1 times [2025-03-08 10:52:10,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:10,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214111928] [2025-03-08 10:52:10,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:10,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:52:10,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:52:10,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:10,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214111928] [2025-03-08 10:52:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214111928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 10:52:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75667107] [2025-03-08 10:52:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:19,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 10:52:19,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:19,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 10:52:19,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:52:19,468 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:52:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:20,999 INFO L93 Difference]: Finished difference Result 441 states and 651 transitions. [2025-03-08 10:52:20,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:52:20,999 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 204 [2025-03-08 10:52:21,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:21,002 INFO L225 Difference]: With dead ends: 441 [2025-03-08 10:52:21,003 INFO L226 Difference]: Without dead ends: 316 [2025-03-08 10:52:21,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-03-08 10:52:21,005 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 436 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:21,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 702 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:52:21,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-08 10:52:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 191. [2025-03-08 10:52:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 118 states have internal predecessors, (151), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 291 transitions. [2025-03-08 10:52:21,051 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 291 transitions. Word has length 204 [2025-03-08 10:52:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:21,051 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 291 transitions. [2025-03-08 10:52:21,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:52:21,052 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 291 transitions. [2025-03-08 10:52:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:52:21,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:21,054 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:21,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:52:21,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1216590578, now seen corresponding path program 1 times [2025-03-08 10:52:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640761133] [2025-03-08 10:52:21,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:21,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:52:21,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:52:21,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:21,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:21,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640761133] [2025-03-08 10:52:21,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640761133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:21,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:21,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:52:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575408756] [2025-03-08 10:52:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:52:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:21,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:52:21,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:52:21,472 INFO L87 Difference]: Start difference. First operand 191 states and 291 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:21,864 INFO L93 Difference]: Finished difference Result 371 states and 558 transitions. [2025-03-08 10:52:21,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 10:52:21,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:52:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:21,866 INFO L225 Difference]: With dead ends: 371 [2025-03-08 10:52:21,866 INFO L226 Difference]: Without dead ends: 246 [2025-03-08 10:52:21,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:52:21,867 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 109 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:21,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 512 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:52:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-08 10:52:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 197. [2025-03-08 10:52:21,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 124 states have internal predecessors, (158), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 298 transitions. [2025-03-08 10:52:21,896 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 298 transitions. Word has length 204 [2025-03-08 10:52:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:21,897 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 298 transitions. [2025-03-08 10:52:21,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 298 transitions. [2025-03-08 10:52:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-08 10:52:21,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:21,900 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:21,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:52:21,901 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:21,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash 646784015, now seen corresponding path program 1 times [2025-03-08 10:52:21,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:21,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231481540] [2025-03-08 10:52:21,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:21,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 10:52:21,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 10:52:21,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:27,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:27,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231481540] [2025-03-08 10:52:27,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231481540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:27,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:27,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:52:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827244040] [2025-03-08 10:52:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:27,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:52:27,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:27,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:52:27,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:52:27,668 INFO L87 Difference]: Start difference. First operand 197 states and 298 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:29,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:29,056 INFO L93 Difference]: Finished difference Result 361 states and 537 transitions. [2025-03-08 10:52:29,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:52:29,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-03-08 10:52:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:29,059 INFO L225 Difference]: With dead ends: 361 [2025-03-08 10:52:29,059 INFO L226 Difference]: Without dead ends: 236 [2025-03-08 10:52:29,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:52:29,060 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:29,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 432 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:52:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-08 10:52:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 194. [2025-03-08 10:52:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 120 states have (on average 1.2833333333333334) internal successors, (154), 121 states have internal predecessors, (154), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 294 transitions. [2025-03-08 10:52:29,076 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 294 transitions. Word has length 204 [2025-03-08 10:52:29,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:29,076 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 294 transitions. [2025-03-08 10:52:29,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 294 transitions. [2025-03-08 10:52:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:29,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:29,078 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:52:29,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 946255936, now seen corresponding path program 1 times [2025-03-08 10:52:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723198731] [2025-03-08 10:52:29,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:29,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:29,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:29,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:29,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:33,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723198731] [2025-03-08 10:52:33,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723198731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:33,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:33,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:52:33,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634358582] [2025-03-08 10:52:33,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:33,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:52:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:33,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:52:33,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:52:33,073 INFO L87 Difference]: Start difference. First operand 194 states and 294 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:34,410 INFO L93 Difference]: Finished difference Result 519 states and 760 transitions. [2025-03-08 10:52:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 10:52:34,411 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:34,413 INFO L225 Difference]: With dead ends: 519 [2025-03-08 10:52:34,413 INFO L226 Difference]: Without dead ends: 394 [2025-03-08 10:52:34,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2025-03-08 10:52:34,414 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 498 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:34,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 650 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:52:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-08 10:52:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 199. [2025-03-08 10:52:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 125 states have (on average 1.296) internal successors, (162), 126 states have internal predecessors, (162), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 302 transitions. [2025-03-08 10:52:34,429 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 302 transitions. Word has length 205 [2025-03-08 10:52:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:34,430 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 302 transitions. [2025-03-08 10:52:34,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 302 transitions. [2025-03-08 10:52:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:34,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:34,431 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:34,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:52:34,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:34,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash 749742431, now seen corresponding path program 1 times [2025-03-08 10:52:34,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:34,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411895108] [2025-03-08 10:52:34,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:34,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:34,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:34,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:34,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411895108] [2025-03-08 10:52:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411895108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:52:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723670531] [2025-03-08 10:52:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:52:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:52:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:52:39,051 INFO L87 Difference]: Start difference. First operand 199 states and 302 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:39,693 INFO L93 Difference]: Finished difference Result 459 states and 679 transitions. [2025-03-08 10:52:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:52:39,694 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:39,696 INFO L225 Difference]: With dead ends: 459 [2025-03-08 10:52:39,696 INFO L226 Difference]: Without dead ends: 334 [2025-03-08 10:52:39,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:52:39,697 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 150 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:39,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 763 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:52:39,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-08 10:52:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 214. [2025-03-08 10:52:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 141 states have internal predecessors, (184), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 324 transitions. [2025-03-08 10:52:39,716 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 324 transitions. Word has length 205 [2025-03-08 10:52:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:39,716 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 324 transitions. [2025-03-08 10:52:39,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 324 transitions. [2025-03-08 10:52:39,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:39,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:39,718 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:39,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:52:39,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:39,718 INFO L85 PathProgramCache]: Analyzing trace with hash -850695423, now seen corresponding path program 1 times [2025-03-08 10:52:39,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:39,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217345258] [2025-03-08 10:52:39,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:39,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:39,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:39,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:39,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:39,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217345258] [2025-03-08 10:52:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217345258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:42,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:42,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:52:42,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128076144] [2025-03-08 10:52:42,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:42,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:52:42,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:42,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:52:42,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:52:42,752 INFO L87 Difference]: Start difference. First operand 214 states and 324 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:43,138 INFO L93 Difference]: Finished difference Result 440 states and 654 transitions. [2025-03-08 10:52:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:52:43,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:43,141 INFO L225 Difference]: With dead ends: 440 [2025-03-08 10:52:43,141 INFO L226 Difference]: Without dead ends: 302 [2025-03-08 10:52:43,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:52:43,142 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 186 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:43,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 379 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:52:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-08 10:52:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 211. [2025-03-08 10:52:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 137 states have (on average 1.313868613138686) internal successors, (180), 138 states have internal predecessors, (180), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:43,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 320 transitions. [2025-03-08 10:52:43,155 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 320 transitions. Word has length 205 [2025-03-08 10:52:43,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:43,156 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 320 transitions. [2025-03-08 10:52:43,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 320 transitions. [2025-03-08 10:52:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:43,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:43,157 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:43,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:52:43,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:43,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1047208928, now seen corresponding path program 1 times [2025-03-08 10:52:43,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:43,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489834483] [2025-03-08 10:52:43,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:43,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:43,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:43,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:46,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:46,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:46,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489834483] [2025-03-08 10:52:46,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489834483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:46,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:46,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:52:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25082041] [2025-03-08 10:52:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:52:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:46,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:52:46,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:52:46,235 INFO L87 Difference]: Start difference. First operand 211 states and 320 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:46,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:46,688 INFO L93 Difference]: Finished difference Result 433 states and 644 transitions. [2025-03-08 10:52:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:52:46,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:46,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:46,690 INFO L225 Difference]: With dead ends: 433 [2025-03-08 10:52:46,690 INFO L226 Difference]: Without dead ends: 294 [2025-03-08 10:52:46,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:52:46,691 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 143 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:46,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 604 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:52:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-03-08 10:52:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 210. [2025-03-08 10:52:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 136 states have (on average 1.3088235294117647) internal successors, (178), 137 states have internal predecessors, (178), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-08 10:52:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 318 transitions. [2025-03-08 10:52:46,704 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 318 transitions. Word has length 205 [2025-03-08 10:52:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:46,705 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 318 transitions. [2025-03-08 10:52:46,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 318 transitions. [2025-03-08 10:52:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:46,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:46,706 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:46,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:52:46,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1841159551, now seen corresponding path program 1 times [2025-03-08 10:52:46,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:46,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982715536] [2025-03-08 10:52:46,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:46,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:46,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:46,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:46,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:46,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:46,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982715536] [2025-03-08 10:52:46,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982715536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:52:46,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323637400] [2025-03-08 10:52:46,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:46,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:52:46,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:46,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:52:46,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:52:46,831 INFO L87 Difference]: Start difference. First operand 210 states and 318 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:46,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:46,891 INFO L93 Difference]: Finished difference Result 375 states and 558 transitions. [2025-03-08 10:52:46,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:52:46,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:46,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:46,893 INFO L225 Difference]: With dead ends: 375 [2025-03-08 10:52:46,893 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 10:52:46,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:52:46,894 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 61 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:46,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 385 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:52:46,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 10:52:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 197. [2025-03-08 10:52:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 126 states have internal predecessors, (164), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:52:46,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 296 transitions. [2025-03-08 10:52:46,908 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 296 transitions. Word has length 205 [2025-03-08 10:52:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:46,909 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 296 transitions. [2025-03-08 10:52:46,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:46,909 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 296 transitions. [2025-03-08 10:52:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:46,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:46,910 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:46,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:52:46,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:46,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:46,911 INFO L85 PathProgramCache]: Analyzing trace with hash -2037673056, now seen corresponding path program 1 times [2025-03-08 10:52:46,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:46,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439720716] [2025-03-08 10:52:46,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:46,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:46,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:46,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:46,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:46,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:50,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:50,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439720716] [2025-03-08 10:52:50,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439720716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:50,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:50,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:52:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913404803] [2025-03-08 10:52:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:50,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:52:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:50,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:52:50,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:52:50,828 INFO L87 Difference]: Start difference. First operand 197 states and 296 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:51,600 INFO L93 Difference]: Finished difference Result 378 states and 558 transitions. [2025-03-08 10:52:51,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:52:51,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-03-08 10:52:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:51,603 INFO L225 Difference]: With dead ends: 378 [2025-03-08 10:52:51,603 INFO L226 Difference]: Without dead ends: 257 [2025-03-08 10:52:51,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:52:51,603 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 158 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:51,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 563 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:52:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-08 10:52:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 199. [2025-03-08 10:52:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 128 states have (on average 1.3046875) internal successors, (167), 128 states have internal predecessors, (167), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:52:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 299 transitions. [2025-03-08 10:52:51,620 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 299 transitions. Word has length 205 [2025-03-08 10:52:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:51,620 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 299 transitions. [2025-03-08 10:52:51,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:52:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 299 transitions. [2025-03-08 10:52:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 10:52:51,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:51,621 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:51,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:52:51,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:51,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:51,622 INFO L85 PathProgramCache]: Analyzing trace with hash 460342881, now seen corresponding path program 1 times [2025-03-08 10:52:51,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:51,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096880987] [2025-03-08 10:52:51,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:51,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 10:52:51,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 10:52:51,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:51,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:57,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:52:57,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:52:57,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096880987] [2025-03-08 10:52:57,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096880987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:57,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:57,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 10:52:57,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854950319] [2025-03-08 10:52:57,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:57,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 10:52:57,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:52:57,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 10:52:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:52:57,324 INFO L87 Difference]: Start difference. First operand 199 states and 299 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:52:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:58,340 INFO L93 Difference]: Finished difference Result 381 states and 565 transitions. [2025-03-08 10:52:58,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 10:52:58,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2025-03-08 10:52:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:58,342 INFO L225 Difference]: With dead ends: 381 [2025-03-08 10:52:58,342 INFO L226 Difference]: Without dead ends: 258 [2025-03-08 10:52:58,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2025-03-08 10:52:58,343 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 143 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:58,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 719 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:52:58,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-08 10:52:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 200. [2025-03-08 10:52:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 129 states have (on average 1.310077519379845) internal successors, (169), 129 states have internal predecessors, (169), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:52:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 301 transitions. [2025-03-08 10:52:58,360 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 301 transitions. Word has length 205 [2025-03-08 10:52:58,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:58,361 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 301 transitions. [2025-03-08 10:52:58,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-03-08 10:52:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 301 transitions. [2025-03-08 10:52:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 10:52:58,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:58,362 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:52:58,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:52:58,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:58,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1233281555, now seen corresponding path program 1 times [2025-03-08 10:52:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:52:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636638577] [2025-03-08 10:52:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:52:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 10:52:58,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 10:52:58,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:58,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:53:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:53:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:53:16,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636638577] [2025-03-08 10:53:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636638577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:53:16,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:53:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:53:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006338710] [2025-03-08 10:53:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:53:16,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:53:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:53:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:53:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:53:16,458 INFO L87 Difference]: Start difference. First operand 200 states and 301 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:53:17,357 INFO L93 Difference]: Finished difference Result 250 states and 363 transitions. [2025-03-08 10:53:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:53:17,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-03-08 10:53:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:53:17,360 INFO L225 Difference]: With dead ends: 250 [2025-03-08 10:53:17,360 INFO L226 Difference]: Without dead ends: 248 [2025-03-08 10:53:17,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:53:17,361 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 106 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:53:17,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 641 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:53:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-08 10:53:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 217. [2025-03-08 10:53:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 145 states have (on average 1.3172413793103448) internal successors, (191), 145 states have internal predecessors, (191), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:53:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 323 transitions. [2025-03-08 10:53:17,380 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 323 transitions. Word has length 206 [2025-03-08 10:53:17,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:53:17,381 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 323 transitions. [2025-03-08 10:53:17,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 323 transitions. [2025-03-08 10:53:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 10:53:17,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:53:17,382 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:17,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:53:17,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:53:17,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:53:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1783452732, now seen corresponding path program 1 times [2025-03-08 10:53:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:53:17,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741471305] [2025-03-08 10:53:17,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:53:17,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:53:17,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 10:53:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 10:53:17,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:53:17,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:53:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:53:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:53:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741471305] [2025-03-08 10:53:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741471305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:53:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:53:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:53:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55280597] [2025-03-08 10:53:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:53:17,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:53:17,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:53:17,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:53:17,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:53:17,447 INFO L87 Difference]: Start difference. First operand 217 states and 323 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:53:17,495 INFO L93 Difference]: Finished difference Result 406 states and 588 transitions. [2025-03-08 10:53:17,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:53:17,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-08 10:53:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:53:17,497 INFO L225 Difference]: With dead ends: 406 [2025-03-08 10:53:17,498 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 10:53:17,499 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 10:53:17,500 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:53:17,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 243 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:53:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 10:53:17,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2025-03-08 10:53:17,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 177 states have (on average 1.271186440677966) internal successors, (225), 178 states have internal predecessors, (225), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 10:53:17,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 377 transitions. [2025-03-08 10:53:17,525 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 377 transitions. Word has length 207 [2025-03-08 10:53:17,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:53:17,525 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 377 transitions. [2025-03-08 10:53:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,525 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 377 transitions. [2025-03-08 10:53:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 10:53:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:53:17,526 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:17,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:53:17,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:53:17,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:53:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 623801723, now seen corresponding path program 1 times [2025-03-08 10:53:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:53:17,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501435868] [2025-03-08 10:53:17,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:53:17,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:53:17,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 10:53:17,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 10:53:17,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:53:17,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:53:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:53:17,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:53:17,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501435868] [2025-03-08 10:53:17,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501435868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:53:17,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:53:17,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:53:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80339506] [2025-03-08 10:53:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:53:17,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:53:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:53:17,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:53:17,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:53:17,580 INFO L87 Difference]: Start difference. First operand 263 states and 377 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:53:17,630 INFO L93 Difference]: Finished difference Result 452 states and 641 transitions. [2025-03-08 10:53:17,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:53:17,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-08 10:53:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:53:17,634 INFO L225 Difference]: With dead ends: 452 [2025-03-08 10:53:17,634 INFO L226 Difference]: Without dead ends: 270 [2025-03-08 10:53:17,635 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 10:53:17,636 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 41 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:53:17,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 266 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:53:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-08 10:53:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2025-03-08 10:53:17,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 160 states have (on average 1.28125) internal successors, (205), 160 states have internal predecessors, (205), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:53:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 337 transitions. [2025-03-08 10:53:17,655 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 337 transitions. Word has length 207 [2025-03-08 10:53:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:53:17,655 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 337 transitions. [2025-03-08 10:53:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 337 transitions. [2025-03-08 10:53:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-08 10:53:17,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:53:17,657 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:17,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 10:53:17,657 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:53:17,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:53:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1043606981, now seen corresponding path program 1 times [2025-03-08 10:53:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:53:17,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758192869] [2025-03-08 10:53:17,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:53:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:53:17,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 10:53:17,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 10:53:17,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:53:17,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:53:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-03-08 10:53:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:53:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758192869] [2025-03-08 10:53:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758192869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:53:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:53:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:53:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124436818] [2025-03-08 10:53:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:53:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:53:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:53:18,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:53:18,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:53:18,817 INFO L87 Difference]: Start difference. First operand 234 states and 337 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:19,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:53:19,020 INFO L93 Difference]: Finished difference Result 298 states and 411 transitions. [2025-03-08 10:53:19,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:53:19,021 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2025-03-08 10:53:19,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:53:19,022 INFO L225 Difference]: With dead ends: 298 [2025-03-08 10:53:19,022 INFO L226 Difference]: Without dead ends: 296 [2025-03-08 10:53:19,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-03-08 10:53:19,023 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 63 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:53:19,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 920 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:53:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-08 10:53:19,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 234. [2025-03-08 10:53:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 160 states have (on average 1.28125) internal successors, (205), 160 states have internal predecessors, (205), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-08 10:53:19,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 337 transitions. [2025-03-08 10:53:19,041 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 337 transitions. Word has length 207 [2025-03-08 10:53:19,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:53:19,042 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 337 transitions. [2025-03-08 10:53:19,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-03-08 10:53:19,042 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 337 transitions. [2025-03-08 10:53:19,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-08 10:53:19,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:53:19,043 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:53:19,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 10:53:19,043 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:53:19,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:53:19,044 INFO L85 PathProgramCache]: Analyzing trace with hash -346715892, now seen corresponding path program 1 times [2025-03-08 10:53:19,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:53:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3805806] [2025-03-08 10:53:19,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:53:19,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:53:19,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 10:53:19,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 10:53:19,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:53:19,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat