./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bfbf8f6b1ea318b377c7ec3dac9bd2d1bbf868456f133ef2b462cef256459a4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:08:44,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:08:44,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:08:44,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:08:44,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:08:44,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:08:44,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:08:44,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:08:44,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:08:44,585 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:08:44,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:08:44,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:08:44,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:08:44,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:08:44,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:08:44,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:44,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:44,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:44,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:08:44,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:08:44,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:08:44,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:08:44,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:08:44,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:08:44,589 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bfbf8f6b1ea318b377c7ec3dac9bd2d1bbf868456f133ef2b462cef256459a4f [2025-01-09 10:08:44,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:08:44,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:08:44,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:08:44,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:08:44,807 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:08:44,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i [2025-01-09 10:08:46,011 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a90bf603/d9fc8e9e992f414fa1c98faa1713db07/FLAG9764541cf [2025-01-09 10:08:46,385 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:08:46,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i [2025-01-09 10:08:46,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a90bf603/d9fc8e9e992f414fa1c98faa1713db07/FLAG9764541cf [2025-01-09 10:08:46,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7a90bf603/d9fc8e9e992f414fa1c98faa1713db07 [2025-01-09 10:08:46,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:08:46,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:08:46,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:46,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:08:46,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:08:46,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be0aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46, skipping insertion in model container [2025-01-09 10:08:46,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:08:46,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i[916,929] [2025-01-09 10:08:46,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:46,859 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:08:46,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-82.i[916,929] [2025-01-09 10:08:46,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:08:46,946 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:08:46,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46 WrapperNode [2025-01-09 10:08:46,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:08:46,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:46,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:08:46,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:08:46,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:46,964 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,016 INFO L138 Inliner]: procedures = 26, calls = 106, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 831 [2025-01-09 10:08:47,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:08:47,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:08:47,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:08:47,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:08:47,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:08:47,051 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:08:47,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:08:47,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:08:47,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:08:47,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (1/1) ... [2025-01-09 10:08:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:08:47,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:47,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:08:47,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:08:47,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:08:47,155 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:08:47,155 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:08:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:08:47,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:08:47,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:08:47,265 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:08:47,266 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:08:48,294 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 10:08:48,294 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:08:48,309 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:08:48,310 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:08:48,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:48 BoogieIcfgContainer [2025-01-09 10:08:48,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:08:48,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:08:48,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:08:48,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:08:48,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:08:46" (1/3) ... [2025-01-09 10:08:48,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f510e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:48, skipping insertion in model container [2025-01-09 10:08:48,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:08:46" (2/3) ... [2025-01-09 10:08:48,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f510e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:08:48, skipping insertion in model container [2025-01-09 10:08:48,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:08:48" (3/3) ... [2025-01-09 10:08:48,320 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-82.i [2025-01-09 10:08:48,332 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:08:48,335 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-82.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:08:48,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:08:48,415 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;@5ec62996, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:08:48,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:08:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 250 states have (on average 1.632) internal successors, (408), 251 states have internal predecessors, (408), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:08:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-01-09 10:08:48,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:48,445 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:48,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:48,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2037730288, now seen corresponding path program 1 times [2025-01-09 10:08:48,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:48,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380872130] [2025-01-09 10:08:48,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:48,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:48,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-01-09 10:08:48,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-01-09 10:08:48,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:48,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-01-09 10:08:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380872130] [2025-01-09 10:08:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380872130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:08:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041334650] [2025-01-09 10:08:48,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:08:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:08:48,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:08:48,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:08:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-01-09 10:08:49,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-01-09 10:08:49,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:49,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:49,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:08:49,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:08:49,359 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 16928 trivial. 0 not checked. [2025-01-09 10:08:49,359 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:08:49,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041334650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:49,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:08:49,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:08:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820238838] [2025-01-09 10:08:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:49,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:08:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:49,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:08:49,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:49,387 INFO L87 Difference]: Start difference. First operand has 346 states, 250 states have (on average 1.632) internal successors, (408), 251 states have internal predecessors, (408), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-01-09 10:08:49,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:49,449 INFO L93 Difference]: Finished difference Result 682 states and 1269 transitions. [2025-01-09 10:08:49,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:08:49,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) Word has length 605 [2025-01-09 10:08:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:49,457 INFO L225 Difference]: With dead ends: 682 [2025-01-09 10:08:49,457 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 10:08:49,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:08:49,464 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:49,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 10:08:49,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-01-09 10:08:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 244 states have (on average 1.6147540983606556) internal successors, (394), 244 states have internal predecessors, (394), 93 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:08:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 580 transitions. [2025-01-09 10:08:49,541 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 580 transitions. Word has length 605 [2025-01-09 10:08:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:49,542 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 580 transitions. [2025-01-09 10:08:49,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (93), 2 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 2 states have call successors, (93) [2025-01-09 10:08:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 580 transitions. [2025-01-09 10:08:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-01-09 10:08:49,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:49,556 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:49,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:08:49,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:08:49,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:49,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:49,758 INFO L85 PathProgramCache]: Analyzing trace with hash -419187753, now seen corresponding path program 1 times [2025-01-09 10:08:49,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:49,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686427484] [2025-01-09 10:08:49,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:49,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:49,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-01-09 10:08:49,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-01-09 10:08:49,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:49,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:50,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686427484] [2025-01-09 10:08:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686427484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:50,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:50,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:50,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839890925] [2025-01-09 10:08:50,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:50,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:50,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:50,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:50,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:50,260 INFO L87 Difference]: Start difference. First operand 339 states and 580 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:50,384 INFO L93 Difference]: Finished difference Result 1010 states and 1732 transitions. [2025-01-09 10:08:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:50,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 606 [2025-01-09 10:08:50,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:50,395 INFO L225 Difference]: With dead ends: 1010 [2025-01-09 10:08:50,395 INFO L226 Difference]: Without dead ends: 674 [2025-01-09 10:08:50,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:50,399 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 561 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:50,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1138 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-01-09 10:08:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 672. [2025-01-09 10:08:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 483 states have (on average 1.6066252587991718) internal successors, (776), 483 states have internal predecessors, (776), 186 states have call successors, (186), 2 states have call predecessors, (186), 2 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 10:08:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1148 transitions. [2025-01-09 10:08:50,494 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1148 transitions. Word has length 606 [2025-01-09 10:08:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:50,497 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1148 transitions. [2025-01-09 10:08:50,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1148 transitions. [2025-01-09 10:08:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-01-09 10:08:50,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:50,512 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:50,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:08:50,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:50,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:50,515 INFO L85 PathProgramCache]: Analyzing trace with hash -349574309, now seen corresponding path program 1 times [2025-01-09 10:08:50,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:50,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671004960] [2025-01-09 10:08:50,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:50,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:50,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-01-09 10:08:50,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-01-09 10:08:50,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:50,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671004960] [2025-01-09 10:08:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671004960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:50,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74719583] [2025-01-09 10:08:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:50,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:50,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:50,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:50,878 INFO L87 Difference]: Start difference. First operand 672 states and 1148 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:51,008 INFO L93 Difference]: Finished difference Result 1998 states and 3417 transitions. [2025-01-09 10:08:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 606 [2025-01-09 10:08:51,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:51,023 INFO L225 Difference]: With dead ends: 1998 [2025-01-09 10:08:51,024 INFO L226 Difference]: Without dead ends: 1329 [2025-01-09 10:08:51,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,028 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 570 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:51,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1149 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:08:51,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-01-09 10:08:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1325. [2025-01-09 10:08:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1325 states, 948 states have (on average 1.5981012658227849) internal successors, (1515), 948 states have internal predecessors, (1515), 372 states have call successors, (372), 4 states have call predecessors, (372), 4 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 10:08:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1325 states to 1325 states and 2259 transitions. [2025-01-09 10:08:51,187 INFO L78 Accepts]: Start accepts. Automaton has 1325 states and 2259 transitions. Word has length 606 [2025-01-09 10:08:51,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:51,189 INFO L471 AbstractCegarLoop]: Abstraction has 1325 states and 2259 transitions. [2025-01-09 10:08:51,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:51,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1325 states and 2259 transitions. [2025-01-09 10:08:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:51,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:51,198 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:51,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:08:51,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:51,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1503967863, now seen corresponding path program 1 times [2025-01-09 10:08:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556945621] [2025-01-09 10:08:51,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:51,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:51,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:51,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556945621] [2025-01-09 10:08:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556945621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059457242] [2025-01-09 10:08:51,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:51,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:51,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:51,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,451 INFO L87 Difference]: Start difference. First operand 1325 states and 2259 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:51,541 INFO L93 Difference]: Finished difference Result 2743 states and 4686 transitions. [2025-01-09 10:08:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:51,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:51,552 INFO L225 Difference]: With dead ends: 2743 [2025-01-09 10:08:51,552 INFO L226 Difference]: Without dead ends: 1421 [2025-01-09 10:08:51,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,557 INFO L435 NwaCegarLoop]: 1064 mSDtfsCounter, 552 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:51,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1631 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2025-01-09 10:08:51,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1417. [2025-01-09 10:08:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1040 states have (on average 1.6067307692307693) internal successors, (1671), 1040 states have internal predecessors, (1671), 372 states have call successors, (372), 4 states have call predecessors, (372), 4 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 10:08:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2415 transitions. [2025-01-09 10:08:51,689 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2415 transitions. Word has length 607 [2025-01-09 10:08:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2415 transitions. [2025-01-09 10:08:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2415 transitions. [2025-01-09 10:08:51,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:51,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:51,697 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:51,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:08:51,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:51,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:51,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1644516473, now seen corresponding path program 1 times [2025-01-09 10:08:51,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:51,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057127300] [2025-01-09 10:08:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:51,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:51,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:51,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:51,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057127300] [2025-01-09 10:08:51,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057127300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:51,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:51,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:51,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842988089] [2025-01-09 10:08:51,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:51,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:51,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:51,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:51,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:51,903 INFO L87 Difference]: Start difference. First operand 1417 states and 2415 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:52,048 INFO L93 Difference]: Finished difference Result 4161 states and 7095 transitions. [2025-01-09 10:08:52,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:52,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:52,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:52,064 INFO L225 Difference]: With dead ends: 4161 [2025-01-09 10:08:52,064 INFO L226 Difference]: Without dead ends: 2747 [2025-01-09 10:08:52,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:52,069 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 533 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:52,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1580 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2025-01-09 10:08:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 1615. [2025-01-09 10:08:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1238 states have (on average 1.635702746365105) internal successors, (2025), 1238 states have internal predecessors, (2025), 372 states have call successors, (372), 4 states have call predecessors, (372), 4 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 10:08:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2769 transitions. [2025-01-09 10:08:52,229 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2769 transitions. Word has length 607 [2025-01-09 10:08:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:52,231 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2769 transitions. [2025-01-09 10:08:52,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:52,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2769 transitions. [2025-01-09 10:08:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:52,236 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:52,236 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:08:52,237 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1863371191, now seen corresponding path program 1 times [2025-01-09 10:08:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208669015] [2025-01-09 10:08:52,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:52,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:52,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:52,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:52,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:52,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208669015] [2025-01-09 10:08:52,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208669015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:52,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:52,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:52,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126693406] [2025-01-09 10:08:52,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:52,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:52,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:52,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:52,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:52,505 INFO L87 Difference]: Start difference. First operand 1615 states and 2769 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:52,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:52,670 INFO L93 Difference]: Finished difference Result 4379 states and 7533 transitions. [2025-01-09 10:08:52,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:52,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:52,687 INFO L225 Difference]: With dead ends: 4379 [2025-01-09 10:08:52,687 INFO L226 Difference]: Without dead ends: 2767 [2025-01-09 10:08:52,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:52,693 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 326 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:52,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1132 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:52,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2767 states. [2025-01-09 10:08:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2767 to 2761. [2025-01-09 10:08:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2256 states have (on average 1.6586879432624113) internal successors, (3742), 2260 states have internal predecessors, (3742), 496 states have call successors, (496), 8 states have call predecessors, (496), 8 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-01-09 10:08:52,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 4734 transitions. [2025-01-09 10:08:52,907 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 4734 transitions. Word has length 607 [2025-01-09 10:08:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:52,908 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 4734 transitions. [2025-01-09 10:08:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 4734 transitions. [2025-01-09 10:08:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:52,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:52,913 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:52,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:08:52,914 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:52,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1045722741, now seen corresponding path program 1 times [2025-01-09 10:08:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047568002] [2025-01-09 10:08:52,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:52,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:52,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:52,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:52,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047568002] [2025-01-09 10:08:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047568002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:53,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:53,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:53,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141569163] [2025-01-09 10:08:53,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:53,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,143 INFO L87 Difference]: Start difference. First operand 2761 states and 4734 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:53,324 INFO L93 Difference]: Finished difference Result 7569 states and 12944 transitions. [2025-01-09 10:08:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:53,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:53,349 INFO L225 Difference]: With dead ends: 7569 [2025-01-09 10:08:53,350 INFO L226 Difference]: Without dead ends: 4811 [2025-01-09 10:08:53,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,359 INFO L435 NwaCegarLoop]: 766 mSDtfsCounter, 335 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:53,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1337 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2025-01-09 10:08:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4805. [2025-01-09 10:08:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4805 states, 3884 states have (on average 1.643666323377961) internal successors, (6384), 3896 states have internal predecessors, (6384), 904 states have call successors, (904), 16 states have call predecessors, (904), 16 states have return successors, (904), 892 states have call predecessors, (904), 904 states have call successors, (904) [2025-01-09 10:08:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4805 states to 4805 states and 8192 transitions. [2025-01-09 10:08:53,647 INFO L78 Accepts]: Start accepts. Automaton has 4805 states and 8192 transitions. Word has length 607 [2025-01-09 10:08:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 4805 states and 8192 transitions. [2025-01-09 10:08:53,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4805 states and 8192 transitions. [2025-01-09 10:08:53,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:53,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:53,654 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:53,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:08:53,655 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1664289355, now seen corresponding path program 1 times [2025-01-09 10:08:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211374740] [2025-01-09 10:08:53,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:53,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:53,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:53,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:53,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211374740] [2025-01-09 10:08:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211374740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:53,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:53,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:53,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392225572] [2025-01-09 10:08:53,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:53,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:53,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:53,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:53,836 INFO L87 Difference]: Start difference. First operand 4805 states and 8192 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:54,151 INFO L93 Difference]: Finished difference Result 12837 states and 21736 transitions. [2025-01-09 10:08:54,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:54,191 INFO L225 Difference]: With dead ends: 12837 [2025-01-09 10:08:54,191 INFO L226 Difference]: Without dead ends: 8035 [2025-01-09 10:08:54,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:54,203 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 361 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:54,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1456 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:08:54,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8035 states. [2025-01-09 10:08:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8035 to 8029. [2025-01-09 10:08:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8029 states, 6268 states have (on average 1.5976388002552648) internal successors, (10014), 6296 states have internal predecessors, (10014), 1728 states have call successors, (1728), 32 states have call predecessors, (1728), 32 states have return successors, (1728), 1700 states have call predecessors, (1728), 1728 states have call successors, (1728) [2025-01-09 10:08:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8029 states to 8029 states and 13470 transitions. [2025-01-09 10:08:54,833 INFO L78 Accepts]: Start accepts. Automaton has 8029 states and 13470 transitions. Word has length 607 [2025-01-09 10:08:54,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:54,834 INFO L471 AbstractCegarLoop]: Abstraction has 8029 states and 13470 transitions. [2025-01-09 10:08:54,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 8029 states and 13470 transitions. [2025-01-09 10:08:54,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:54,850 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:54,850 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:54,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:08:54,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:54,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:54,852 INFO L85 PathProgramCache]: Analyzing trace with hash -75941453, now seen corresponding path program 1 times [2025-01-09 10:08:54,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:54,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108263577] [2025-01-09 10:08:54,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:54,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:54,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:54,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:54,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:54,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108263577] [2025-01-09 10:08:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108263577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:08:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620421580] [2025-01-09 10:08:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:55,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:08:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:55,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:08:55,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:55,506 INFO L87 Difference]: Start difference. First operand 8029 states and 13470 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:56,885 INFO L93 Difference]: Finished difference Result 27729 states and 45950 transitions. [2025-01-09 10:08:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:08:56,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:56,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:56,956 INFO L225 Difference]: With dead ends: 27729 [2025-01-09 10:08:56,956 INFO L226 Difference]: Without dead ends: 19703 [2025-01-09 10:08:56,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:08:56,979 INFO L435 NwaCegarLoop]: 996 mSDtfsCounter, 1055 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2362 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:08:56,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 2362 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:08:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19703 states. [2025-01-09 10:08:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19703 to 19657. [2025-01-09 10:08:58,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19657 states, 14496 states have (on average 1.5369757174392935) internal successors, (22280), 14604 states have internal predecessors, (22280), 5048 states have call successors, (5048), 112 states have call predecessors, (5048), 112 states have return successors, (5048), 4940 states have call predecessors, (5048), 5048 states have call successors, (5048) [2025-01-09 10:08:58,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19657 states to 19657 states and 32376 transitions. [2025-01-09 10:08:58,636 INFO L78 Accepts]: Start accepts. Automaton has 19657 states and 32376 transitions. Word has length 607 [2025-01-09 10:08:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:08:58,637 INFO L471 AbstractCegarLoop]: Abstraction has 19657 states and 32376 transitions. [2025-01-09 10:08:58,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19657 states and 32376 transitions. [2025-01-09 10:08:58,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:08:58,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:08:58,653 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:08:58,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:08:58,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:08:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:08:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1087058703, now seen corresponding path program 1 times [2025-01-09 10:08:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:08:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608960890] [2025-01-09 10:08:58,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:08:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:08:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:08:58,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:08:58,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:08:58,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:08:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17112 trivial. 0 not checked. [2025-01-09 10:08:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:08:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608960890] [2025-01-09 10:08:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608960890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:08:59,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:08:59,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:08:59,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32803714] [2025-01-09 10:08:59,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:08:59,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:08:59,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:08:59,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:08:59,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:59,153 INFO L87 Difference]: Start difference. First operand 19657 states and 32376 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:08:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:08:59,849 INFO L93 Difference]: Finished difference Result 39319 states and 64765 transitions. [2025-01-09 10:08:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:08:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) Word has length 607 [2025-01-09 10:08:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:08:59,938 INFO L225 Difference]: With dead ends: 39319 [2025-01-09 10:08:59,938 INFO L226 Difference]: Without dead ends: 19665 [2025-01-09 10:08:59,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:08:59,996 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 0 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1152 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-01-09 10:08:59,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:00,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19665 states. [2025-01-09 10:09:01,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19665 to 19665. [2025-01-09 10:09:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19665 states, 14504 states have (on average 1.5366795366795367) internal successors, (22288), 14612 states have internal predecessors, (22288), 5048 states have call successors, (5048), 112 states have call predecessors, (5048), 112 states have return successors, (5048), 4940 states have call predecessors, (5048), 5048 states have call successors, (5048) [2025-01-09 10:09:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19665 states to 19665 states and 32384 transitions. [2025-01-09 10:09:01,504 INFO L78 Accepts]: Start accepts. Automaton has 19665 states and 32384 transitions. Word has length 607 [2025-01-09 10:09:01,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:01,506 INFO L471 AbstractCegarLoop]: Abstraction has 19665 states and 32384 transitions. [2025-01-09 10:09:01,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (93), 1 states have call predecessors, (93), 1 states have return successors, (93), 1 states have call predecessors, (93), 1 states have call successors, (93) [2025-01-09 10:09:01,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19665 states and 32384 transitions. [2025-01-09 10:09:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-09 10:09:01,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:01,524 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:01,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:09:01,524 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:01,525 INFO L85 PathProgramCache]: Analyzing trace with hash -355091277, now seen corresponding path program 1 times [2025-01-09 10:09:01,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:01,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878859321] [2025-01-09 10:09:01,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:01,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:09:01,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:09:01,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:01,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 87 proven. 189 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878859321] [2025-01-09 10:09:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878859321] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:02,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772556687] [2025-01-09 10:09:02,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:02,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:02,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:02,325 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:09:02,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:09:02,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-09 10:09:02,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-09 10:09:02,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:02,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:02,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 10:09:02,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 8592 proven. 126 refuted. 0 times theorem prover too weak. 8394 trivial. 0 not checked. [2025-01-09 10:09:04,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 150 proven. 126 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772556687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:05,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:05,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2025-01-09 10:09:05,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191414239] [2025-01-09 10:09:05,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:05,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 10:09:05,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:05,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 10:09:05,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 10:09:05,064 INFO L87 Difference]: Start difference. First operand 19665 states and 32384 transitions. Second operand has 15 states, 15 states have (on average 25.0) internal successors, (375), 15 states have internal predecessors, (375), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (250), 5 states have call predecessors, (250), 5 states have call successors, (250) [2025-01-09 10:09:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:10,739 INFO L93 Difference]: Finished difference Result 71939 states and 117228 transitions. [2025-01-09 10:09:10,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 10:09:10,740 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 25.0) internal successors, (375), 15 states have internal predecessors, (375), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (250), 5 states have call predecessors, (250), 5 states have call successors, (250) Word has length 607 [2025-01-09 10:09:10,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:10,941 INFO L225 Difference]: With dead ends: 71939 [2025-01-09 10:09:10,942 INFO L226 Difference]: Without dead ends: 52277 [2025-01-09 10:09:10,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1259 GetRequests, 1209 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=572, Invalid=2080, Unknown=0, NotChecked=0, Total=2652 [2025-01-09 10:09:10,989 INFO L435 NwaCegarLoop]: 946 mSDtfsCounter, 4532 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 2195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4535 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 4981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2195 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:10,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4535 Valid, 4333 Invalid, 4981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2195 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 10:09:11,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52277 states. [2025-01-09 10:09:14,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52277 to 46333. [2025-01-09 10:09:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46333 states, 34548 states have (on average 1.5216799814750492) internal successors, (52571), 34788 states have internal predecessors, (52571), 11246 states have call successors, (11246), 538 states have call predecessors, (11246), 538 states have return successors, (11246), 11006 states have call predecessors, (11246), 11246 states have call successors, (11246) [2025-01-09 10:09:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46333 states to 46333 states and 75063 transitions. [2025-01-09 10:09:15,080 INFO L78 Accepts]: Start accepts. Automaton has 46333 states and 75063 transitions. Word has length 607 [2025-01-09 10:09:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 46333 states and 75063 transitions. [2025-01-09 10:09:15,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 25.0) internal successors, (375), 15 states have internal predecessors, (375), 5 states have call successors, (249), 3 states have call predecessors, (249), 6 states have return successors, (250), 5 states have call predecessors, (250), 5 states have call successors, (250) [2025-01-09 10:09:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 46333 states and 75063 transitions. [2025-01-09 10:09:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-01-09 10:09:15,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:15,094 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:15,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 10:09:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:15,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1401104896, now seen corresponding path program 1 times [2025-01-09 10:09:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667136101] [2025-01-09 10:09:15,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:15,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 10:09:15,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 10:09:15,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:15,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 204 proven. 72 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:16,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667136101] [2025-01-09 10:09:16,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667136101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:16,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048766930] [2025-01-09 10:09:16,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:16,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:16,050 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:09:16,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:09:16,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 10:09:16,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 10:09:16,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:16,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:16,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 10:09:16,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 6756 proven. 72 refuted. 0 times theorem prover too weak. 10284 trivial. 0 not checked. [2025-01-09 10:09:17,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 204 proven. 72 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:18,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048766930] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:18,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2025-01-09 10:09:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037382029] [2025-01-09 10:09:18,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:18,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 10:09:18,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:18,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 10:09:18,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:09:18,240 INFO L87 Difference]: Start difference. First operand 46333 states and 75063 transitions. Second operand has 19 states, 19 states have (on average 19.789473684210527) internal successors, (376), 19 states have internal predecessors, (376), 5 states have call successors, (210), 3 states have call predecessors, (210), 6 states have return successors, (211), 5 states have call predecessors, (211), 5 states have call successors, (211) [2025-01-09 10:09:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:33,542 INFO L93 Difference]: Finished difference Result 193388 states and 310739 transitions. [2025-01-09 10:09:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-01-09 10:09:33,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 19.789473684210527) internal successors, (376), 19 states have internal predecessors, (376), 5 states have call successors, (210), 3 states have call predecessors, (210), 6 states have return successors, (211), 5 states have call predecessors, (211), 5 states have call successors, (211) Word has length 609 [2025-01-09 10:09:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:34,167 INFO L225 Difference]: With dead ends: 193388 [2025-01-09 10:09:34,168 INFO L226 Difference]: Without dead ends: 147147 [2025-01-09 10:09:34,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1340 GetRequests, 1226 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2452, Invalid=10888, Unknown=0, NotChecked=0, Total=13340 [2025-01-09 10:09:34,331 INFO L435 NwaCegarLoop]: 747 mSDtfsCounter, 11299 mSDsluCounter, 5019 mSDsCounter, 0 mSdLazyCounter, 2979 mSolverCounterSat, 5653 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11380 SdHoareTripleChecker+Valid, 5766 SdHoareTripleChecker+Invalid, 8632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5653 IncrementalHoareTripleChecker+Valid, 2979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:34,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11380 Valid, 5766 Invalid, 8632 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5653 Valid, 2979 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 10:09:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147147 states. [2025-01-09 10:09:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147147 to 110796. [2025-01-09 10:09:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110796 states, 87420 states have (on average 1.550217341569435) internal successors, (135520), 87883 states have internal predecessors, (135520), 22171 states have call successors, (22171), 1204 states have call predecessors, (22171), 1204 states have return successors, (22171), 21708 states have call predecessors, (22171), 22171 states have call successors, (22171) [2025-01-09 10:09:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110796 states to 110796 states and 179862 transitions. [2025-01-09 10:09:43,077 INFO L78 Accepts]: Start accepts. Automaton has 110796 states and 179862 transitions. Word has length 609 [2025-01-09 10:09:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:43,078 INFO L471 AbstractCegarLoop]: Abstraction has 110796 states and 179862 transitions. [2025-01-09 10:09:43,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 19.789473684210527) internal successors, (376), 19 states have internal predecessors, (376), 5 states have call successors, (210), 3 states have call predecessors, (210), 6 states have return successors, (211), 5 states have call predecessors, (211), 5 states have call successors, (211) [2025-01-09 10:09:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 110796 states and 179862 transitions. [2025-01-09 10:09:43,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-01-09 10:09:43,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:43,097 INFO L218 NwaCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:09:43,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 10:09:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:43,298 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:43,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1415450688, now seen corresponding path program 1 times [2025-01-09 10:09:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387903767] [2025-01-09 10:09:43,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:43,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:43,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 10:09:43,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 10:09:43,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 165 proven. 111 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387903767] [2025-01-09 10:09:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387903767] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357951377] [2025-01-09 10:09:43,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:43,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:43,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:43,870 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:09:43,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 10:09:44,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 10:09:44,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 10:09:44,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:44,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:44,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 1403 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:09:44,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:44,597 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 8342 proven. 111 refuted. 0 times theorem prover too weak. 8659 trivial. 0 not checked. [2025-01-09 10:09:44,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17112 backedges. 165 proven. 111 refuted. 0 times theorem prover too weak. 16836 trivial. 0 not checked. [2025-01-09 10:09:45,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357951377] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:45,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:45,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:09:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083607609] [2025-01-09 10:09:45,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:45,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:09:45,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:45,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:09:45,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:45,089 INFO L87 Difference]: Start difference. First operand 110796 states and 179862 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-01-09 10:09:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:49,652 INFO L93 Difference]: Finished difference Result 179115 states and 290366 transitions. [2025-01-09 10:09:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 10:09:49,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 609 [2025-01-09 10:09:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:49,903 INFO L225 Difference]: With dead ends: 179115 [2025-01-09 10:09:49,903 INFO L226 Difference]: Without dead ends: 60651 [2025-01-09 10:09:50,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1215 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:09:50,083 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 870 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:50,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1347 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:09:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60651 states.