./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 ddb079fdd3784496be289fc7e9dce8b5519454d886eda78b14b11167cae45c0d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:06:53,155 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:06:53,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:06:53,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:06:53,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:06:53,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:06:53,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:06:53,257 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:06:53,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:06:53,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:06:53,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:06:53,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:06:53,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:06:53,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:06:53,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:06:53,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:06:53,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:53,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:53,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:06:53,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:06:53,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:06:53,262 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-jdk21/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 -> ddb079fdd3784496be289fc7e9dce8b5519454d886eda78b14b11167cae45c0d [2025-01-09 10:06:53,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:06:53,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:06:53,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:06:53,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:06:53,565 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:06:53,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i [2025-01-09 10:06:54,971 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05944731/e7b609a35c77458fa43c7ff77227a740/FLAG7d3206060 [2025-01-09 10:06:55,288 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:06:55,289 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i [2025-01-09 10:06:55,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05944731/e7b609a35c77458fa43c7ff77227a740/FLAG7d3206060 [2025-01-09 10:06:55,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f05944731/e7b609a35c77458fa43c7ff77227a740 [2025-01-09 10:06:55,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:06:55,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:06:55,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:55,338 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:06:55,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:06:55,343 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:55,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55, skipping insertion in model container [2025-01-09 10:06:55,344 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:55,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:06:55,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i[916,929] [2025-01-09 10:06:55,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:55,743 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:06:55,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-63.i[916,929] [2025-01-09 10:06:55,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:55,868 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:06:55,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55 WrapperNode [2025-01-09 10:06:55,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:55,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:55,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:06:55,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:06:55,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:55,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:55,987 INFO L138 Inliner]: procedures = 26, calls = 109, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 914 [2025-01-09 10:06:55,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:55,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:06:55,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:06:55,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:06:55,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:55,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,066 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-01-09 10:06:56,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:06:56,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:06:56,164 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:06:56,164 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:06:56,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (1/1) ... [2025-01-09 10:06:56,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:56,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:56,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:06:56,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:06:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:06:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:06:56,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:06:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:06:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:06:56,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:06:56,404 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:06:56,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:06:57,921 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-01-09 10:06:57,922 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:06:57,942 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:06:57,946 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:06:57,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:57 BoogieIcfgContainer [2025-01-09 10:06:57,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:06:57,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:06:57,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:06:57,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:06:57,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:06:55" (1/3) ... [2025-01-09 10:06:57,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33357ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:57, skipping insertion in model container [2025-01-09 10:06:57,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:55" (2/3) ... [2025-01-09 10:06:57,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33357ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:57, skipping insertion in model container [2025-01-09 10:06:57,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:57" (3/3) ... [2025-01-09 10:06:57,957 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-63.i [2025-01-09 10:06:57,970 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:06:57,975 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-63.i that has 2 procedures, 367 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:06:58,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:06:58,061 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;@5d245a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:06:58,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:06:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 367 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 269 states have internal predecessors, (427), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 10:06:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:06:58,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:58,106 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:06:58,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:58,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:58,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1523759988, now seen corresponding path program 1 times [2025-01-09 10:06:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304626328] [2025-01-09 10:06:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:58,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:58,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:06:58,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:06:58,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:58,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:58,876 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-01-09 10:06:58,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:58,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304626328] [2025-01-09 10:06:58,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304626328] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:06:58,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763243428] [2025-01-09 10:06:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:58,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:06:58,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:58,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:06:58,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:06:59,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:06:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:06:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:59,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:06:59,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:06:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-01-09 10:06:59,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:06:59,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763243428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:59,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:06:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:06:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133985002] [2025-01-09 10:06:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:59,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:06:59,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:59,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:06:59,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:06:59,562 INFO L87 Difference]: Start difference. First operand has 367 states, 268 states have (on average 1.5932835820895523) internal successors, (427), 269 states have internal predecessors, (427), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-01-09 10:06:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:59,645 INFO L93 Difference]: Finished difference Result 727 states and 1327 transitions. [2025-01-09 10:06:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:06:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) Word has length 641 [2025-01-09 10:06:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:59,656 INFO L225 Difference]: With dead ends: 727 [2025-01-09 10:06:59,656 INFO L226 Difference]: Without dead ends: 363 [2025-01-09 10:06:59,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 642 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-01-09 10:06:59,664 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:59,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-01-09 10:06:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-01-09 10:06:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 265 states have (on average 1.5660377358490567) internal successors, (415), 265 states have internal predecessors, (415), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-01-09 10:06:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 607 transitions. [2025-01-09 10:06:59,775 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 607 transitions. Word has length 641 [2025-01-09 10:06:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:59,776 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 607 transitions. [2025-01-09 10:06:59,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-01-09 10:06:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 607 transitions. [2025-01-09 10:06:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:06:59,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:59,799 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:06:59,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:07:00,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:07:00,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:00,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:00,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1323043408, now seen corresponding path program 1 times [2025-01-09 10:07:00,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:00,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356435464] [2025-01-09 10:07:00,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:00,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:00,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:00,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:00,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:00,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356435464] [2025-01-09 10:07:00,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356435464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:00,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182577336] [2025-01-09 10:07:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:00,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:00,951 INFO L87 Difference]: Start difference. First operand 363 states and 607 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:01,069 INFO L93 Difference]: Finished difference Result 965 states and 1616 transitions. [2025-01-09 10:07:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:01,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:01,085 INFO L225 Difference]: With dead ends: 965 [2025-01-09 10:07:01,085 INFO L226 Difference]: Without dead ends: 605 [2025-01-09 10:07:01,087 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-01-09 10:07:01,088 INFO L435 NwaCegarLoop]: 880 mSDtfsCounter, 396 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:01,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1468 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-01-09 10:07:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 602. [2025-01-09 10:07:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 465 states have (on average 1.5870967741935484) internal successors, (738), 466 states have internal predecessors, (738), 134 states have call successors, (134), 2 states have call predecessors, (134), 2 states have return successors, (134), 133 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 10:07:01,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 1006 transitions. [2025-01-09 10:07:01,165 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 1006 transitions. Word has length 641 [2025-01-09 10:07:01,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:01,167 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 1006 transitions. [2025-01-09 10:07:01,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 1006 transitions. [2025-01-09 10:07:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:01,181 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:01,182 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:01,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:07:01,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:01,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:01,183 INFO L85 PathProgramCache]: Analyzing trace with hash 328349710, now seen corresponding path program 1 times [2025-01-09 10:07:01,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018045994] [2025-01-09 10:07:01,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:01,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:01,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:01,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:01,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:01,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018045994] [2025-01-09 10:07:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018045994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:01,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:01,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190562439] [2025-01-09 10:07:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:01,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:01,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:01,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:01,648 INFO L87 Difference]: Start difference. First operand 602 states and 1006 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:01,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:01,763 INFO L93 Difference]: Finished difference Result 1685 states and 2817 transitions. [2025-01-09 10:07:01,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:01,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:01,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:01,777 INFO L225 Difference]: With dead ends: 1685 [2025-01-09 10:07:01,779 INFO L226 Difference]: Without dead ends: 1086 [2025-01-09 10:07:01,781 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-01-09 10:07:01,782 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 389 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:01,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1188 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-01-09 10:07:01,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1083. [2025-01-09 10:07:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 864 states have (on average 1.599537037037037) internal successors, (1382), 867 states have internal predecessors, (1382), 214 states have call successors, (214), 4 states have call predecessors, (214), 4 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-01-09 10:07:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1810 transitions. [2025-01-09 10:07:01,883 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1810 transitions. Word has length 641 [2025-01-09 10:07:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:01,889 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1810 transitions. [2025-01-09 10:07:01,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1810 transitions. [2025-01-09 10:07:01,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:01,906 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:01,907 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:01,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:07:01,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:01,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:01,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1007621964, now seen corresponding path program 1 times [2025-01-09 10:07:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:01,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057566963] [2025-01-09 10:07:01,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:01,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:02,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:02,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:02,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:02,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:02,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057566963] [2025-01-09 10:07:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057566963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306323781] [2025-01-09 10:07:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:02,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:02,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:02,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:02,269 INFO L87 Difference]: Start difference. First operand 1083 states and 1810 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:02,397 INFO L93 Difference]: Finished difference Result 2175 states and 3626 transitions. [2025-01-09 10:07:02,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:02,409 INFO L225 Difference]: With dead ends: 2175 [2025-01-09 10:07:02,409 INFO L226 Difference]: Without dead ends: 1095 [2025-01-09 10:07:02,412 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-01-09 10:07:02,413 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 358 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:02,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1210 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-01-09 10:07:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2025-01-09 10:07:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 694 states have (on average 1.6282420749279538) internal successors, (1130), 695 states have internal predecessors, (1130), 138 states have call successors, (138), 4 states have call predecessors, (138), 4 states have return successors, (138), 137 states have call predecessors, (138), 138 states have call successors, (138) [2025-01-09 10:07:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1406 transitions. [2025-01-09 10:07:02,479 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1406 transitions. Word has length 641 [2025-01-09 10:07:02,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:02,482 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1406 transitions. [2025-01-09 10:07:02,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1406 transitions. [2025-01-09 10:07:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:02,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:02,490 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:02,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:07:02,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:02,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1255768458, now seen corresponding path program 1 times [2025-01-09 10:07:02,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:02,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541547528] [2025-01-09 10:07:02,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:02,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:02,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:02,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:02,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541547528] [2025-01-09 10:07:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541547528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:02,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:02,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244070443] [2025-01-09 10:07:02,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:02,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:02,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:02,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:02,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:02,814 INFO L87 Difference]: Start difference. First operand 837 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:02,901 INFO L93 Difference]: Finished difference Result 2501 states and 4204 transitions. [2025-01-09 10:07:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:02,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:02,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:02,917 INFO L225 Difference]: With dead ends: 2501 [2025-01-09 10:07:02,918 INFO L226 Difference]: Without dead ends: 1667 [2025-01-09 10:07:02,921 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-01-09 10:07:02,923 INFO L435 NwaCegarLoop]: 1027 mSDtfsCounter, 572 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:02,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1628 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2025-01-09 10:07:03,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1665. [2025-01-09 10:07:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1380 states have (on average 1.6246376811594203) internal successors, (2242), 1382 states have internal predecessors, (2242), 276 states have call successors, (276), 8 states have call predecessors, (276), 8 states have return successors, (276), 274 states have call predecessors, (276), 276 states have call successors, (276) [2025-01-09 10:07:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2794 transitions. [2025-01-09 10:07:03,073 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2794 transitions. Word has length 641 [2025-01-09 10:07:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:03,075 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2794 transitions. [2025-01-09 10:07:03,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2794 transitions. [2025-01-09 10:07:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:03,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:03,088 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:07:03,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:03,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash -988214840, now seen corresponding path program 1 times [2025-01-09 10:07:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:03,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539783096] [2025-01-09 10:07:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:03,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:03,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:03,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:03,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539783096] [2025-01-09 10:07:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539783096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:03,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271557141] [2025-01-09 10:07:03,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:03,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:03,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:03,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:03,401 INFO L87 Difference]: Start difference. First operand 1665 states and 2794 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:03,558 INFO L93 Difference]: Finished difference Result 4973 states and 8348 transitions. [2025-01-09 10:07:03,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:03,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:03,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:03,580 INFO L225 Difference]: With dead ends: 4973 [2025-01-09 10:07:03,580 INFO L226 Difference]: Without dead ends: 3311 [2025-01-09 10:07:03,585 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-01-09 10:07:03,586 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 582 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 1760 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:03,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 1760 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:03,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3311 states. [2025-01-09 10:07:03,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3311 to 3269. [2025-01-09 10:07:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3269 states, 2700 states have (on average 1.614814814814815) internal successors, (4360), 2704 states have internal predecessors, (4360), 552 states have call successors, (552), 16 states have call predecessors, (552), 16 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2025-01-09 10:07:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 5464 transitions. [2025-01-09 10:07:03,829 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 5464 transitions. Word has length 641 [2025-01-09 10:07:03,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:03,830 INFO L471 AbstractCegarLoop]: Abstraction has 3269 states and 5464 transitions. [2025-01-09 10:07:03,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 5464 transitions. [2025-01-09 10:07:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:03,837 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:03,837 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:03,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:07:03,837 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:03,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1955770950, now seen corresponding path program 1 times [2025-01-09 10:07:03,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:03,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851225248] [2025-01-09 10:07:03,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:03,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:03,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:03,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:03,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851225248] [2025-01-09 10:07:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851225248] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512406612] [2025-01-09 10:07:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:04,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:04,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:04,109 INFO L87 Difference]: Start difference. First operand 3269 states and 5464 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:04,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:04,255 INFO L93 Difference]: Finished difference Result 6761 states and 11262 transitions. [2025-01-09 10:07:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:04,310 INFO L225 Difference]: With dead ends: 6761 [2025-01-09 10:07:04,310 INFO L226 Difference]: Without dead ends: 3495 [2025-01-09 10:07:04,316 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-01-09 10:07:04,317 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 33 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:04,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1215 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-01-09 10:07:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3373. [2025-01-09 10:07:04,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3373 states, 2804 states have (on average 1.6091298145506419) internal successors, (4512), 2808 states have internal predecessors, (4512), 552 states have call successors, (552), 16 states have call predecessors, (552), 16 states have return successors, (552), 548 states have call predecessors, (552), 552 states have call successors, (552) [2025-01-09 10:07:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3373 states to 3373 states and 5616 transitions. [2025-01-09 10:07:04,506 INFO L78 Accepts]: Start accepts. Automaton has 3373 states and 5616 transitions. Word has length 641 [2025-01-09 10:07:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:04,507 INFO L471 AbstractCegarLoop]: Abstraction has 3373 states and 5616 transitions. [2025-01-09 10:07:04,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3373 states and 5616 transitions. [2025-01-09 10:07:04,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:04,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:04,514 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:04,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:07:04,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:04,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:04,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1626721658, now seen corresponding path program 1 times [2025-01-09 10:07:04,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:04,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963984286] [2025-01-09 10:07:04,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:04,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:04,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:04,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:04,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:04,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:04,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963984286] [2025-01-09 10:07:04,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963984286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:04,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:04,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:07:04,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58371330] [2025-01-09 10:07:04,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:04,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:07:04,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:04,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:07:04,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:07:04,977 INFO L87 Difference]: Start difference. First operand 3373 states and 5616 transitions. Second operand has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:05,400 INFO L93 Difference]: Finished difference Result 13057 states and 21752 transitions. [2025-01-09 10:07:05,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:05,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:05,456 INFO L225 Difference]: With dead ends: 13057 [2025-01-09 10:07:05,457 INFO L226 Difference]: Without dead ends: 9687 [2025-01-09 10:07:05,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:05,473 INFO L435 NwaCegarLoop]: 655 mSDtfsCounter, 1227 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:05,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 2088 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:07:05,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9687 states. [2025-01-09 10:07:05,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9687 to 9657. [2025-01-09 10:07:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 8648 states have (on average 1.6313598519888992) internal successors, (14108), 8676 states have internal predecessors, (14108), 968 states have call successors, (968), 40 states have call predecessors, (968), 40 states have return successors, (968), 940 states have call predecessors, (968), 968 states have call successors, (968) [2025-01-09 10:07:06,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 16044 transitions. [2025-01-09 10:07:06,048 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 16044 transitions. Word has length 641 [2025-01-09 10:07:06,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:06,049 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 16044 transitions. [2025-01-09 10:07:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.0) internal successors, (164), 4 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 16044 transitions. [2025-01-09 10:07:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 10:07:06,074 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:06,074 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:06,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:07:06,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:06,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:06,076 INFO L85 PathProgramCache]: Analyzing trace with hash 107382792, now seen corresponding path program 1 times [2025-01-09 10:07:06,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:06,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670134960] [2025-01-09 10:07:06,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:06,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:06,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 10:07:06,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 10:07:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:06,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:06,872 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:06,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:06,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670134960] [2025-01-09 10:07:06,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670134960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:06,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:06,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:06,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275168295] [2025-01-09 10:07:06,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:06,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:06,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:06,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:06,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:06,875 INFO L87 Difference]: Start difference. First operand 9657 states and 16044 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:07,400 INFO L93 Difference]: Finished difference Result 28965 states and 48126 transitions. [2025-01-09 10:07:07,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 641 [2025-01-09 10:07:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:07,493 INFO L225 Difference]: With dead ends: 28965 [2025-01-09 10:07:07,494 INFO L226 Difference]: Without dead ends: 19311 [2025-01-09 10:07:07,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 10:07:07,528 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 435 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:07,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 1199 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:07,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19311 states. [2025-01-09 10:07:08,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19311 to 19277. [2025-01-09 10:07:08,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19277 states, 17260 states have (on average 1.6275782155272307) internal successors, (28092), 17316 states have internal predecessors, (28092), 1936 states have call successors, (1936), 80 states have call predecessors, (1936), 80 states have return successors, (1936), 1880 states have call predecessors, (1936), 1936 states have call successors, (1936) [2025-01-09 10:07:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19277 states to 19277 states and 31964 transitions. [2025-01-09 10:07:08,509 INFO L78 Accepts]: Start accepts. Automaton has 19277 states and 31964 transitions. Word has length 641 [2025-01-09 10:07:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:08,510 INFO L471 AbstractCegarLoop]: Abstraction has 19277 states and 31964 transitions. [2025-01-09 10:07:08,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19277 states and 31964 transitions. [2025-01-09 10:07:08,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-01-09 10:07:08,534 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:08,535 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:07:08,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash -910954987, now seen corresponding path program 1 times [2025-01-09 10:07:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147035945] [2025-01-09 10:07:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:08,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-01-09 10:07:08,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-01-09 10:07:08,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:08,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:09,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:09,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147035945] [2025-01-09 10:07:09,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147035945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:09,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:09,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:09,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018392443] [2025-01-09 10:07:09,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:09,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:09,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:09,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:09,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:09,108 INFO L87 Difference]: Start difference. First operand 19277 states and 31964 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:10,426 INFO L93 Difference]: Finished difference Result 57825 states and 95886 transitions. [2025-01-09 10:07:10,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:10,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 642 [2025-01-09 10:07:10,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:10,575 INFO L225 Difference]: With dead ends: 57825 [2025-01-09 10:07:10,575 INFO L226 Difference]: Without dead ends: 38551 [2025-01-09 10:07:10,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-01-09 10:07:10,644 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 418 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:10,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1204 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:07:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38551 states. [2025-01-09 10:07:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38551 to 38549. [2025-01-09 10:07:12,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38549 states, 34516 states have (on average 1.6248696256808437) internal successors, (56084), 34628 states have internal predecessors, (56084), 3872 states have call successors, (3872), 160 states have call predecessors, (3872), 160 states have return successors, (3872), 3760 states have call predecessors, (3872), 3872 states have call successors, (3872) [2025-01-09 10:07:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38549 states to 38549 states and 63828 transitions. [2025-01-09 10:07:12,389 INFO L78 Accepts]: Start accepts. Automaton has 38549 states and 63828 transitions. Word has length 642 [2025-01-09 10:07:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:12,391 INFO L471 AbstractCegarLoop]: Abstraction has 38549 states and 63828 transitions. [2025-01-09 10:07:12,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 38549 states and 63828 transitions. [2025-01-09 10:07:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 10:07:12,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:12,427 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:07:12,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:12,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1831103811, now seen corresponding path program 1 times [2025-01-09 10:07:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275673487] [2025-01-09 10:07:12,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:12,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 10:07:12,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 10:07:12,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:12,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:12,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:12,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275673487] [2025-01-09 10:07:12,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275673487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:12,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:12,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:12,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765932462] [2025-01-09 10:07:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:12,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:12,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:12,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:12,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:12,916 INFO L87 Difference]: Start difference. First operand 38549 states and 63828 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:14,526 INFO L93 Difference]: Finished difference Result 96417 states and 159742 transitions. [2025-01-09 10:07:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-01-09 10:07:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:14,781 INFO L225 Difference]: With dead ends: 96417 [2025-01-09 10:07:14,782 INFO L226 Difference]: Without dead ends: 57871 [2025-01-09 10:07:14,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 10:07:14,885 INFO L435 NwaCegarLoop]: 782 mSDtfsCounter, 406 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:14,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 1381 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57871 states. [2025-01-09 10:07:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57871 to 57869. [2025-01-09 10:07:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57869 states, 51820 states have (on average 1.6236974141258202) internal successors, (84140), 51988 states have internal predecessors, (84140), 5808 states have call successors, (5808), 240 states have call predecessors, (5808), 240 states have return successors, (5808), 5640 states have call predecessors, (5808), 5808 states have call successors, (5808) [2025-01-09 10:07:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57869 states to 57869 states and 95756 transitions. [2025-01-09 10:07:17,446 INFO L78 Accepts]: Start accepts. Automaton has 57869 states and 95756 transitions. Word has length 643 [2025-01-09 10:07:17,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:17,447 INFO L471 AbstractCegarLoop]: Abstraction has 57869 states and 95756 transitions. [2025-01-09 10:07:17,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57869 states and 95756 transitions. [2025-01-09 10:07:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 10:07:17,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:17,494 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:17,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:07:17,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:17,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:17,495 INFO L85 PathProgramCache]: Analyzing trace with hash -939157043, now seen corresponding path program 1 times [2025-01-09 10:07:17,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:17,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202583285] [2025-01-09 10:07:17,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:17,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:17,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 10:07:17,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 10:07:17,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:17,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:18,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202583285] [2025-01-09 10:07:18,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202583285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:18,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:18,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:18,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348121011] [2025-01-09 10:07:18,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:18,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:18,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:18,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:18,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:18,147 INFO L87 Difference]: Start difference. First operand 57869 states and 95756 transitions. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:20,627 INFO L93 Difference]: Finished difference Result 173601 states and 287262 transitions. [2025-01-09 10:07:20,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:07:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-01-09 10:07:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:21,101 INFO L225 Difference]: With dead ends: 173601 [2025-01-09 10:07:21,102 INFO L226 Difference]: Without dead ends: 115735 [2025-01-09 10:07:21,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-01-09 10:07:21,208 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 394 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:21,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1202 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:07:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115735 states. [2025-01-09 10:07:25,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115735 to 112565. [2025-01-09 10:07:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112565 states, 100468 states have (on average 1.616156388103675) internal successors, (162372), 100804 states have internal predecessors, (162372), 11616 states have call successors, (11616), 480 states have call predecessors, (11616), 480 states have return successors, (11616), 11280 states have call predecessors, (11616), 11616 states have call successors, (11616) [2025-01-09 10:07:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112565 states to 112565 states and 185604 transitions. [2025-01-09 10:07:25,657 INFO L78 Accepts]: Start accepts. Automaton has 112565 states and 185604 transitions. Word has length 643 [2025-01-09 10:07:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:25,659 INFO L471 AbstractCegarLoop]: Abstraction has 112565 states and 185604 transitions. [2025-01-09 10:07:25,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 112565 states and 185604 transitions. [2025-01-09 10:07:25,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-01-09 10:07:25,719 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:25,719 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:25,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:07:25,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:25,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:25,721 INFO L85 PathProgramCache]: Analyzing trace with hash 429830865, now seen corresponding path program 1 times [2025-01-09 10:07:25,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:25,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869299594] [2025-01-09 10:07:25,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-01-09 10:07:26,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-01-09 10:07:26,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:26,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:27,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869299594] [2025-01-09 10:07:27,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869299594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:27,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:27,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:07:27,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023192134] [2025-01-09 10:07:27,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:27,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:07:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:27,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:07:27,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:27,176 INFO L87 Difference]: Start difference. First operand 112565 states and 185604 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:33,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:07:33,450 INFO L93 Difference]: Finished difference Result 365360 states and 603689 transitions. [2025-01-09 10:07:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:07:33,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 643 [2025-01-09 10:07:33,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:07:34,669 INFO L225 Difference]: With dead ends: 365360 [2025-01-09 10:07:34,669 INFO L226 Difference]: Without dead ends: 252798 [2025-01-09 10:07:34,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:07:34,857 INFO L435 NwaCegarLoop]: 1724 mSDtfsCounter, 1629 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:07:34,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 2671 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:07:35,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252798 states. [2025-01-09 10:07:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252798 to 120411. [2025-01-09 10:07:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120411 states, 108215 states have (on average 1.5968858291364414) internal successors, (172807), 108552 states have internal predecessors, (172807), 11712 states have call successors, (11712), 483 states have call predecessors, (11712), 483 states have return successors, (11712), 11375 states have call predecessors, (11712), 11712 states have call successors, (11712) [2025-01-09 10:07:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120411 states to 120411 states and 196231 transitions. [2025-01-09 10:07:41,242 INFO L78 Accepts]: Start accepts. Automaton has 120411 states and 196231 transitions. Word has length 643 [2025-01-09 10:07:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:07:41,243 INFO L471 AbstractCegarLoop]: Abstraction has 120411 states and 196231 transitions. [2025-01-09 10:07:41,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-01-09 10:07:41,244 INFO L276 IsEmpty]: Start isEmpty. Operand 120411 states and 196231 transitions. [2025-01-09 10:07:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-01-09 10:07:41,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:07:41,330 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 10:07:41,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:07:41,331 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:07:41,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:07:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1994875009, now seen corresponding path program 1 times [2025-01-09 10:07:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:07:41,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376444771] [2025-01-09 10:07:41,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:07:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:07:41,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-01-09 10:07:41,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-01-09 10:07:41,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:07:41,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:07:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-01-09 10:07:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:07:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376444771] [2025-01-09 10:07:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376444771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:07:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:07:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:07:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366281826] [2025-01-09 10:07:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:07:42,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:07:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:07:42,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:07:42,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:07:42,392 INFO L87 Difference]: Start difference. First operand 120411 states and 196231 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96)