./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:08:42,184 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:08:42,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:08:42,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:08:42,283 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:08:42,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:08:42,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:08:42,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:08:42,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:08:42,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:08:42,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:08:42,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:08:42,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:08:42,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:08:42,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:08:42,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:08:42,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:08:42,329 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:08:42,329 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16ff97a558b757e7503fa9deac406f5ee96ecd7ac74bc40e1b185d8532e8df37 [2025-03-17 00:08:42,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:08:42,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:08:42,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:08:42,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:08:42,721 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:08:42,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-17 00:08:44,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d71b95b/73c6055b1e0e4ac4b9ba2803ae8f6adc/FLAG98978ebaa [2025-03-17 00:08:45,317 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:08:45,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-17 00:08:45,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d71b95b/73c6055b1e0e4ac4b9ba2803ae8f6adc/FLAG98978ebaa [2025-03-17 00:08:45,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7d71b95b/73c6055b1e0e4ac4b9ba2803ae8f6adc [2025-03-17 00:08:45,822 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:08:45,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:08:45,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:08:45,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:08:45,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:08:45,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:45" (1/1) ... [2025-03-17 00:08:45,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@357a5dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:45, skipping insertion in model container [2025-03-17 00:08:45,832 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:08:45" (1/1) ... [2025-03-17 00:08:45,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:08:46,091 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i[916,929] [2025-03-17 00:08:46,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:08:46,316 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:08:46,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-66.i[916,929] [2025-03-17 00:08:46,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:08:46,453 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:08:46,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46 WrapperNode [2025-03-17 00:08:46,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:08:46,455 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:08:46,455 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:08:46,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:08:46,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,602 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 539 [2025-03-17 00:08:46,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:08:46,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:08:46,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:08:46,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:08:46,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,696 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 00:08:46,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,737 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:08:46,755 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:08:46,755 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:08:46,755 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:08:46,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (1/1) ... [2025-03-17 00:08:46,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:08:46,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:46,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 00:08:46,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 00:08:46,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:08:46,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:08:46,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:08:46,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:08:46,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:08:46,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:08:47,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:08:47,067 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:08:48,280 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-17 00:08:48,280 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:08:48,331 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:08:48,331 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:08:48,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:48 BoogieIcfgContainer [2025-03-17 00:08:48,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:08:48,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:08:48,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:08:48,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:08:48,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:08:45" (1/3) ... [2025-03-17 00:08:48,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9658f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:48, skipping insertion in model container [2025-03-17 00:08:48,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:08:46" (2/3) ... [2025-03-17 00:08:48,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e9658f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:08:48, skipping insertion in model container [2025-03-17 00:08:48,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:08:48" (3/3) ... [2025-03-17 00:08:48,355 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i [2025-03-17 00:08:48,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:08:48,402 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-66.i that has 2 procedures, 220 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:08:48,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:08:48,491 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;@68728dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:08:48,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:08:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand has 220 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 144 states have internal predecessors, (221), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 00:08:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-17 00:08:48,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:48,524 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:48,525 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:48,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash -286340506, now seen corresponding path program 1 times [2025-03-17 00:08:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007219673] [2025-03-17 00:08:48,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:48,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:48,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:08:48,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:08:48,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:48,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-17 00:08:49,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:49,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007219673] [2025-03-17 00:08:49,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007219673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:08:49,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110551988] [2025-03-17 00:08:49,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:49,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:08:49,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:08:49,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:08:49,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 00:08:49,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:08:49,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:08:49,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:49,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:49,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:08:49,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:08:49,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-03-17 00:08:49,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:08:49,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110551988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:49,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:08:49,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:08:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197597148] [2025-03-17 00:08:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:08:49,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:49,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:08:49,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:08:49,958 INFO L87 Difference]: Start difference. First operand has 220 states, 143 states have (on average 1.5454545454545454) internal successors, (221), 144 states have internal predecessors, (221), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-17 00:08:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:50,065 INFO L93 Difference]: Finished difference Result 437 states and 810 transitions. [2025-03-17 00:08:50,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:08:50,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 472 [2025-03-17 00:08:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:50,078 INFO L225 Difference]: With dead ends: 437 [2025-03-17 00:08:50,079 INFO L226 Difference]: Without dead ends: 218 [2025-03-17 00:08:50,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 473 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:08:50,089 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:50,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:08:50,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-17 00:08:50,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-17 00:08:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-17 00:08:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 365 transitions. [2025-03-17 00:08:50,212 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 365 transitions. Word has length 472 [2025-03-17 00:08:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 365 transitions. [2025-03-17 00:08:50,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-03-17 00:08:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 365 transitions. [2025-03-17 00:08:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-17 00:08:50,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:50,239 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:50,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 00:08:50,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 00:08:50,441 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -300453468, now seen corresponding path program 1 times [2025-03-17 00:08:50,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984192540] [2025-03-17 00:08:50,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:50,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:08:50,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:08:50,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:08:51,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:51,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984192540] [2025-03-17 00:08:51,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984192540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:51,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:51,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:08:51,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588817429] [2025-03-17 00:08:51,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:51,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:08:51,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:51,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:08:51,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:08:51,105 INFO L87 Difference]: Start difference. First operand 218 states and 365 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:51,207 INFO L93 Difference]: Finished difference Result 571 states and 954 transitions. [2025-03-17 00:08:51,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:08:51,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 472 [2025-03-17 00:08:51,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:51,212 INFO L225 Difference]: With dead ends: 571 [2025-03-17 00:08:51,212 INFO L226 Difference]: Without dead ends: 354 [2025-03-17 00:08:51,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:08:51,214 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 201 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:51,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 703 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:08:51,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-17 00:08:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2025-03-17 00:08:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 236 states have (on average 1.5338983050847457) internal successors, (362), 237 states have internal predecessors, (362), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-17 00:08:51,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 586 transitions. [2025-03-17 00:08:51,287 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 586 transitions. Word has length 472 [2025-03-17 00:08:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:51,288 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 586 transitions. [2025-03-17 00:08:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 586 transitions. [2025-03-17 00:08:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-17 00:08:51,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:51,296 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:51,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:08:51,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:51,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:51,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1144925339, now seen corresponding path program 1 times [2025-03-17 00:08:51,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:51,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165997118] [2025-03-17 00:08:51,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:51,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:51,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-17 00:08:51,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-17 00:08:51,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:51,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:08:52,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165997118] [2025-03-17 00:08:52,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165997118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:52,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:52,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:08:52,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569252847] [2025-03-17 00:08:52,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:52,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:08:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:52,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:08:52,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:08:52,021 INFO L87 Difference]: Start difference. First operand 351 states and 586 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:52,662 INFO L93 Difference]: Finished difference Result 935 states and 1556 transitions. [2025-03-17 00:08:52,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:08:52,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 472 [2025-03-17 00:08:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:52,677 INFO L225 Difference]: With dead ends: 935 [2025-03-17 00:08:52,678 INFO L226 Difference]: Without dead ends: 585 [2025-03-17 00:08:52,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:08:52,682 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 196 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:52,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 900 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:08:52,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-17 00:08:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 581. [2025-03-17 00:08:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 394 states have (on average 1.5279187817258884) internal successors, (602), 397 states have internal predecessors, (602), 182 states have call successors, (182), 4 states have call predecessors, (182), 4 states have return successors, (182), 179 states have call predecessors, (182), 182 states have call successors, (182) [2025-03-17 00:08:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 966 transitions. [2025-03-17 00:08:52,781 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 966 transitions. Word has length 472 [2025-03-17 00:08:52,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:52,783 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 966 transitions. [2025-03-17 00:08:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 966 transitions. [2025-03-17 00:08:52,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:08:52,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:52,787 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:52,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:08:52,788 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1188855505, now seen corresponding path program 1 times [2025-03-17 00:08:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:52,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978309910] [2025-03-17 00:08:52,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:52,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:52,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:08:52,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:08:52,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:52,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:08:53,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:53,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978309910] [2025-03-17 00:08:53,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978309910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:53,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:53,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:08:53,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588413802] [2025-03-17 00:08:53,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:53,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:08:53,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:53,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:08:53,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:08:53,315 INFO L87 Difference]: Start difference. First operand 581 states and 966 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:53,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:53,652 INFO L93 Difference]: Finished difference Result 1466 states and 2426 transitions. [2025-03-17 00:08:53,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:08:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 473 [2025-03-17 00:08:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:53,674 INFO L225 Difference]: With dead ends: 1466 [2025-03-17 00:08:53,682 INFO L226 Difference]: Without dead ends: 886 [2025-03-17 00:08:53,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:08:53,684 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 280 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:53,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1394 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:08:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-17 00:08:53,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 883. [2025-03-17 00:08:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 589 states have (on average 1.502546689303905) internal successors, (885), 594 states have internal predecessors, (885), 285 states have call successors, (285), 8 states have call predecessors, (285), 8 states have return successors, (285), 280 states have call predecessors, (285), 285 states have call successors, (285) [2025-03-17 00:08:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1455 transitions. [2025-03-17 00:08:53,797 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1455 transitions. Word has length 473 [2025-03-17 00:08:53,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:53,802 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1455 transitions. [2025-03-17 00:08:53,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:53,802 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1455 transitions. [2025-03-17 00:08:53,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:08:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:53,808 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:53,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:08:53,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:53,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1121423656, now seen corresponding path program 1 times [2025-03-17 00:08:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:53,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047417025] [2025-03-17 00:08:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:53,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:08:53,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:08:53,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:53,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:08:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:55,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047417025] [2025-03-17 00:08:55,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047417025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:55,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:55,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 00:08:55,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205825153] [2025-03-17 00:08:55,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:55,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 00:08:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:55,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 00:08:55,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-17 00:08:55,434 INFO L87 Difference]: Start difference. First operand 883 states and 1455 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:57,904 INFO L93 Difference]: Finished difference Result 4959 states and 8142 transitions. [2025-03-17 00:08:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 00:08:57,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 473 [2025-03-17 00:08:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:57,939 INFO L225 Difference]: With dead ends: 4959 [2025-03-17 00:08:57,939 INFO L226 Difference]: Without dead ends: 4077 [2025-03-17 00:08:57,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 00:08:57,947 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 1467 mSDsluCounter, 1582 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:57,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2143 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 00:08:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2025-03-17 00:08:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 2088. [2025-03-17 00:08:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1502 states have (on average 1.540612516644474) internal successors, (2314), 1514 states have internal predecessors, (2314), 557 states have call successors, (557), 28 states have call predecessors, (557), 28 states have return successors, (557), 545 states have call predecessors, (557), 557 states have call successors, (557) [2025-03-17 00:08:58,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3428 transitions. [2025-03-17 00:08:58,233 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3428 transitions. Word has length 473 [2025-03-17 00:08:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:58,238 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 3428 transitions. [2025-03-17 00:08:58,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3428 transitions. [2025-03-17 00:08:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:08:58,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:58,244 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:58,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:08:58,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:58,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:58,248 INFO L85 PathProgramCache]: Analyzing trace with hash 266171922, now seen corresponding path program 1 times [2025-03-17 00:08:58,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:58,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741283499] [2025-03-17 00:08:58,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:58,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:58,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:08:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:08:58,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:08:58,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:08:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:08:58,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:08:58,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741283499] [2025-03-17 00:08:58,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741283499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:08:58,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:08:58,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:08:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725090590] [2025-03-17 00:08:58,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:08:58,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:08:58,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:08:58,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:08:58,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:08:58,753 INFO L87 Difference]: Start difference. First operand 2088 states and 3428 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:08:59,406 INFO L93 Difference]: Finished difference Result 6609 states and 10686 transitions. [2025-03-17 00:08:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:08:59,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 473 [2025-03-17 00:08:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:08:59,437 INFO L225 Difference]: With dead ends: 6609 [2025-03-17 00:08:59,437 INFO L226 Difference]: Without dead ends: 4566 [2025-03-17 00:08:59,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:08:59,447 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 627 mSDsluCounter, 1103 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:08:59,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 1531 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:08:59,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2025-03-17 00:08:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4115. [2025-03-17 00:08:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 2821 states have (on average 1.489542715349167) internal successors, (4202), 2852 states have internal predecessors, (4202), 1220 states have call successors, (1220), 73 states have call predecessors, (1220), 73 states have return successors, (1220), 1189 states have call predecessors, (1220), 1220 states have call successors, (1220) [2025-03-17 00:08:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 6642 transitions. [2025-03-17 00:08:59,959 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 6642 transitions. Word has length 473 [2025-03-17 00:08:59,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:08:59,961 INFO L471 AbstractCegarLoop]: Abstraction has 4115 states and 6642 transitions. [2025-03-17 00:08:59,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:08:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 6642 transitions. [2025-03-17 00:08:59,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-17 00:08:59,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:08:59,968 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:08:59,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 00:08:59,968 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:08:59,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:08:59,969 INFO L85 PathProgramCache]: Analyzing trace with hash 198740073, now seen corresponding path program 1 times [2025-03-17 00:08:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:08:59,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570667862] [2025-03-17 00:08:59,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:08:59,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:08:59,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-17 00:09:00,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-17 00:09:00,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:00,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:09:00,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570667862] [2025-03-17 00:09:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570667862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:09:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077250964] [2025-03-17 00:09:00,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:09:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:00,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:09:00,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:09:00,569 INFO L87 Difference]: Start difference. First operand 4115 states and 6642 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:09:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:02,114 INFO L93 Difference]: Finished difference Result 11078 states and 17870 transitions. [2025-03-17 00:09:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:09:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 473 [2025-03-17 00:09:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:02,158 INFO L225 Difference]: With dead ends: 11078 [2025-03-17 00:09:02,158 INFO L226 Difference]: Without dead ends: 7017 [2025-03-17 00:09:02,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:09:02,175 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 939 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:02,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2138 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 00:09:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7017 states. [2025-03-17 00:09:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7017 to 6802. [2025-03-17 00:09:02,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6802 states, 4650 states have (on average 1.4888172043010752) internal successors, (6923), 4700 states have internal predecessors, (6923), 2030 states have call successors, (2030), 121 states have call predecessors, (2030), 121 states have return successors, (2030), 1980 states have call predecessors, (2030), 2030 states have call successors, (2030) [2025-03-17 00:09:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 10983 transitions. [2025-03-17 00:09:02,947 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 10983 transitions. Word has length 473 [2025-03-17 00:09:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:02,948 INFO L471 AbstractCegarLoop]: Abstraction has 6802 states and 10983 transitions. [2025-03-17 00:09:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:09:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 10983 transitions. [2025-03-17 00:09:02,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:09:02,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:02,961 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:09:02,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:09:02,961 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:02,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2066385524, now seen corresponding path program 1 times [2025-03-17 00:09:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632466068] [2025-03-17 00:09:02,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:09:03,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:09:03,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:03,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:09:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-03-17 00:09:41,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:09:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632466068] [2025-03-17 00:09:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632466068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:09:41,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:09:41,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 00:09:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414488926] [2025-03-17 00:09:41,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:09:41,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 00:09:41,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:09:41,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 00:09:41,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-17 00:09:41,034 INFO L87 Difference]: Start difference. First operand 6802 states and 10983 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:09:42,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:09:42,843 INFO L93 Difference]: Finished difference Result 17079 states and 27494 transitions. [2025-03-17 00:09:42,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 00:09:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 474 [2025-03-17 00:09:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:09:42,915 INFO L225 Difference]: With dead ends: 17079 [2025-03-17 00:09:42,916 INFO L226 Difference]: Without dead ends: 10331 [2025-03-17 00:09:42,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2025-03-17 00:09:42,941 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 130 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 00:09:42,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1659 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 00:09:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10331 states. [2025-03-17 00:09:43,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10331 to 7771. [2025-03-17 00:09:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7771 states, 5619 states have (on average 1.4771311621284926) internal successors, (8300), 5669 states have internal predecessors, (8300), 2030 states have call successors, (2030), 121 states have call predecessors, (2030), 121 states have return successors, (2030), 1980 states have call predecessors, (2030), 2030 states have call successors, (2030) [2025-03-17 00:09:43,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7771 states to 7771 states and 12360 transitions. [2025-03-17 00:09:43,539 INFO L78 Accepts]: Start accepts. Automaton has 7771 states and 12360 transitions. Word has length 474 [2025-03-17 00:09:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:09:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 7771 states and 12360 transitions. [2025-03-17 00:09:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-03-17 00:09:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 7771 states and 12360 transitions. [2025-03-17 00:09:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-17 00:09:43,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:09:43,549 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 00:09:43,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:09:43,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:09:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:09:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2066355733, now seen corresponding path program 1 times [2025-03-17 00:09:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:09:43,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851000472] [2025-03-17 00:09:43,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:09:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:09:43,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-17 00:09:43,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-17 00:09:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:09:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat