./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.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-88.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 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:09:13,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:09:13,966 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:09:13,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:09:13,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:09:13,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:09:13,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:09:13,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:09:13,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:09:13,983 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:09:13,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:09:13,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:09:13,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:09:13,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:09:13,983 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:09:13,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:09:13,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:09:13,984 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:09:13,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:13,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:09:13,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:13,985 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:09:13,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:09:13,986 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 -> 1648b8247576116efcc38ecc57a34288105aaaa4b64d600c2638d97bcecc6c8c [2025-01-09 10:09:14,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:09:14,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:09:14,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:09:14,297 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:09:14,297 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:09:14,298 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-88.i [2025-01-09 10:09:15,578 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/663b4f320/b2875628998447ceb0de1a51f3f45e58/FLAGef7ba6c1e [2025-01-09 10:09:15,916 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:09:15,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-01-09 10:09:15,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/663b4f320/b2875628998447ceb0de1a51f3f45e58/FLAGef7ba6c1e [2025-01-09 10:09:16,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/663b4f320/b2875628998447ceb0de1a51f3f45e58 [2025-01-09 10:09:16,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:09:16,172 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:09:16,173 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:16,173 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:09:16,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:09:16,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34bd3d7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16, skipping insertion in model container [2025-01-09 10:09:16,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:09:16,276 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-88.i[916,929] [2025-01-09 10:09:16,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:16,455 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:09:16,465 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-88.i[916,929] [2025-01-09 10:09:16,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:09:16,580 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:09:16,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16 WrapperNode [2025-01-09 10:09:16,583 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:09:16,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:16,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:09:16,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:09:16,588 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:09:16" (1/1) ... [2025-01-09 10:09:16,602 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:09:16" (1/1) ... [2025-01-09 10:09:16,662 INFO L138 Inliner]: procedures = 26, calls = 128, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 877 [2025-01-09 10:09:16,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:09:16,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:09:16,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:09:16,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:09:16,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,712 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:09:16,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:09:16,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:09:16,784 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:09:16,784 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:09:16,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (1/1) ... [2025-01-09 10:09:16,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:09:16,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:16,813 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:09:16,819 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:09:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:09:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:09:16,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:09:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:09:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:09:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:09:16,968 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:09:16,969 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:09:17,998 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2025-01-09 10:09:17,998 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:09:18,012 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:09:18,013 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:09:18,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:18 BoogieIcfgContainer [2025-01-09 10:09:18,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:09:18,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:09:18,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:09:18,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:09:18,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:09:16" (1/3) ... [2025-01-09 10:09:18,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b8389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:18, skipping insertion in model container [2025-01-09 10:09:18,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:09:16" (2/3) ... [2025-01-09 10:09:18,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484b8389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:09:18, skipping insertion in model container [2025-01-09 10:09:18,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:09:18" (3/3) ... [2025-01-09 10:09:18,020 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i [2025-01-09 10:09:18,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:09:18,032 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-88.i that has 2 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:09:18,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:09:18,095 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;@5b701641, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:09:18,095 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:09:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 10:09:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2025-01-09 10:09:18,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:18,122 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:18,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash -253394709, now seen corresponding path program 1 times [2025-01-09 10:09:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:18,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064615198] [2025-01-09 10:09:18,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:18,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 10:09:18,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 10:09:18,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:18,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 228 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-01-09 10:09:18,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064615198] [2025-01-09 10:09:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064615198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94407298] [2025-01-09 10:09:18,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:18,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:18,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:18,682 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:09:18,687 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:09:18,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 727 statements into 1 equivalence classes. [2025-01-09 10:09:19,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 727 of 727 statements. [2025-01-09 10:09:19,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:19,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:19,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:09:19,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:19,129 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 25992 trivial. 0 not checked. [2025-01-09 10:09:19,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:09:19,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94407298] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:19,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:09:19,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:09:19,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027023107] [2025-01-09 10:09:19,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:19,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:09:19,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:19,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:09:19,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:09:19,159 INFO L87 Difference]: Start difference. First operand has 368 states, 250 states have (on average 1.568) internal successors, (392), 251 states have internal predecessors, (392), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-01-09 10:09:19,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:19,214 INFO L93 Difference]: Finished difference Result 727 states and 1350 transitions. [2025-01-09 10:09:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:09:19,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) Word has length 727 [2025-01-09 10:09:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:19,229 INFO L225 Difference]: With dead ends: 727 [2025-01-09 10:09:19,230 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 10:09:19,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 728 GetRequests, 728 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:09:19,243 INFO L435 NwaCegarLoop]: 611 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, 611 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:09:19,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:19,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 10:09:19,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-01-09 10:09:19,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.5551020408163265) internal successors, (381), 245 states have internal predecessors, (381), 115 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2025-01-09 10:09:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 611 transitions. [2025-01-09 10:09:19,365 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 611 transitions. Word has length 727 [2025-01-09 10:09:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:19,369 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 611 transitions. [2025-01-09 10:09:19,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (115), 2 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 2 states have call successors, (115) [2025-01-09 10:09:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 611 transitions. [2025-01-09 10:09:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:19,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:19,385 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,394 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:09:19,590 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:09:19,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1654065129, now seen corresponding path program 1 times [2025-01-09 10:09:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:19,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571360688] [2025-01-09 10:09:19,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:19,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:19,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:19,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:19,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:20,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:20,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571360688] [2025-01-09 10:09:20,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571360688] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:20,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:20,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:20,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896556437] [2025-01-09 10:09:20,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:20,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:20,371 INFO L87 Difference]: Start difference. First operand 362 states and 611 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:20,464 INFO L93 Difference]: Finished difference Result 973 states and 1648 transitions. [2025-01-09 10:09:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:20,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:20,472 INFO L225 Difference]: With dead ends: 973 [2025-01-09 10:09:20,474 INFO L226 Difference]: Without dead ends: 614 [2025-01-09 10:09:20,475 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:09:20,476 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 415 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1369 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:09:20,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 1369 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-01-09 10:09:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 611. [2025-01-09 10:09:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 431 states have (on average 1.580046403712297) internal successors, (681), 432 states have internal predecessors, (681), 177 states have call successors, (177), 2 states have call predecessors, (177), 2 states have return successors, (177), 176 states have call predecessors, (177), 177 states have call successors, (177) [2025-01-09 10:09:20,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1035 transitions. [2025-01-09 10:09:20,567 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1035 transitions. Word has length 728 [2025-01-09 10:09:20,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:20,570 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1035 transitions. [2025-01-09 10:09:20,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:20,571 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1035 transitions. [2025-01-09 10:09:20,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:20,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:20,589 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:09:20,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:20,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1236668523, now seen corresponding path program 1 times [2025-01-09 10:09:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:20,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972611839] [2025-01-09 10:09:20,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:20,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:20,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:20,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:20,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:20,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972611839] [2025-01-09 10:09:20,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972611839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:20,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:20,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593443865] [2025-01-09 10:09:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:20,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:20,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:20,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:20,940 INFO L87 Difference]: Start difference. First operand 611 states and 1035 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:21,008 INFO L93 Difference]: Finished difference Result 1637 states and 2786 transitions. [2025-01-09 10:09:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:21,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:21,022 INFO L225 Difference]: With dead ends: 1637 [2025-01-09 10:09:21,022 INFO L226 Difference]: Without dead ends: 1029 [2025-01-09 10:09:21,024 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:09:21,026 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 369 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:21,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1444 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2025-01-09 10:09:21,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1025. [2025-01-09 10:09:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 783 states have (on average 1.6257982120051087) internal successors, (1273), 786 states have internal predecessors, (1273), 237 states have call successors, (237), 4 states have call predecessors, (237), 4 states have return successors, (237), 234 states have call predecessors, (237), 237 states have call successors, (237) [2025-01-09 10:09:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1747 transitions. [2025-01-09 10:09:21,089 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1747 transitions. Word has length 728 [2025-01-09 10:09:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:21,090 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1747 transitions. [2025-01-09 10:09:21,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1747 transitions. [2025-01-09 10:09:21,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:21,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:21,095 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:09:21,095 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:21,096 INFO L85 PathProgramCache]: Analyzing trace with hash 883580141, now seen corresponding path program 1 times [2025-01-09 10:09:21,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:21,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595161252] [2025-01-09 10:09:21,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:21,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:21,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:21,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:21,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595161252] [2025-01-09 10:09:21,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595161252] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:21,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181460665] [2025-01-09 10:09:21,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:21,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:21,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:21,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:21,478 INFO L87 Difference]: Start difference. First operand 1025 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:21,587 INFO L93 Difference]: Finished difference Result 2721 states and 4608 transitions. [2025-01-09 10:09:21,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:21,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:21,598 INFO L225 Difference]: With dead ends: 2721 [2025-01-09 10:09:21,598 INFO L226 Difference]: Without dead ends: 1699 [2025-01-09 10:09:21,601 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:09:21,602 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 380 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:21,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-01-09 10:09:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1696. [2025-01-09 10:09:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1228 states have (on average 1.5798045602605864) internal successors, (1940), 1235 states have internal predecessors, (1940), 459 states have call successors, (459), 8 states have call predecessors, (459), 8 states have return successors, (459), 452 states have call predecessors, (459), 459 states have call successors, (459) [2025-01-09 10:09:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2858 transitions. [2025-01-09 10:09:21,686 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2858 transitions. Word has length 728 [2025-01-09 10:09:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:21,686 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2858 transitions. [2025-01-09 10:09:21,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:21,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2858 transitions. [2025-01-09 10:09:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:21,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:21,692 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:09:21,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:21,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1165807701, now seen corresponding path program 1 times [2025-01-09 10:09:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192184094] [2025-01-09 10:09:21,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:21,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:21,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:21,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:21,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:21,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:22,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:22,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192184094] [2025-01-09 10:09:22,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192184094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:22,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988962335] [2025-01-09 10:09:22,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:22,057 INFO L87 Difference]: Start difference. First operand 1696 states and 2858 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:22,308 INFO L93 Difference]: Finished difference Result 5082 states and 8568 transitions. [2025-01-09 10:09:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:22,328 INFO L225 Difference]: With dead ends: 5082 [2025-01-09 10:09:22,328 INFO L226 Difference]: Without dead ends: 3389 [2025-01-09 10:09:22,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:22,335 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 660 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:22,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1209 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:09:22,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2025-01-09 10:09:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2025-01-09 10:09:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2452 states have (on average 1.5774877650897228) internal successors, (3868), 2466 states have internal predecessors, (3868), 918 states have call successors, (918), 16 states have call predecessors, (918), 16 states have return successors, (918), 904 states have call predecessors, (918), 918 states have call successors, (918) [2025-01-09 10:09:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 5704 transitions. [2025-01-09 10:09:22,606 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 5704 transitions. Word has length 728 [2025-01-09 10:09:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:22,607 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 5704 transitions. [2025-01-09 10:09:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 5704 transitions. [2025-01-09 10:09:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:22,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:22,617 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:09:22,618 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -742160979, now seen corresponding path program 1 times [2025-01-09 10:09:22,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:22,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196850917] [2025-01-09 10:09:22,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:22,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:23,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:23,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:23,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:23,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:23,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196850917] [2025-01-09 10:09:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196850917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:09:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803054686] [2025-01-09 10:09:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:23,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:09:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:23,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:09:23,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:09:23,660 INFO L87 Difference]: Start difference. First operand 3387 states and 5704 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:24,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:24,120 INFO L93 Difference]: Finished difference Result 15079 states and 25188 transitions. [2025-01-09 10:09:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:09:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:24,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:24,180 INFO L225 Difference]: With dead ends: 15079 [2025-01-09 10:09:24,181 INFO L226 Difference]: Without dead ends: 11695 [2025-01-09 10:09:24,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:09:24,194 INFO L435 NwaCegarLoop]: 1139 mSDtfsCounter, 1103 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1103 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:24,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1103 Valid, 2426 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2025-01-09 10:09:24,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 6363. [2025-01-09 10:09:24,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6363 states, 4588 states have (on average 1.5623365300784655) internal successors, (7168), 4618 states have internal predecessors, (7168), 1742 states have call successors, (1742), 32 states have call predecessors, (1742), 32 states have return successors, (1742), 1712 states have call predecessors, (1742), 1742 states have call successors, (1742) [2025-01-09 10:09:24,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6363 states to 6363 states and 10652 transitions. [2025-01-09 10:09:24,859 INFO L78 Accepts]: Start accepts. Automaton has 6363 states and 10652 transitions. Word has length 728 [2025-01-09 10:09:24,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:24,860 INFO L471 AbstractCegarLoop]: Abstraction has 6363 states and 10652 transitions. [2025-01-09 10:09:24,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:24,860 INFO L276 IsEmpty]: Start isEmpty. Operand 6363 states and 10652 transitions. [2025-01-09 10:09:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:24,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:24,869 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:09:24,869 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:24,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash -494014485, now seen corresponding path program 1 times [2025-01-09 10:09:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761517617] [2025-01-09 10:09:24,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:24,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:24,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:24,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:24,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761517617] [2025-01-09 10:09:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761517617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:25,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:25,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688024883] [2025-01-09 10:09:25,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:25,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:25,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:25,076 INFO L87 Difference]: Start difference. First operand 6363 states and 10652 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:25,741 INFO L93 Difference]: Finished difference Result 17805 states and 29678 transitions. [2025-01-09 10:09:25,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:25,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:25,819 INFO L225 Difference]: With dead ends: 17805 [2025-01-09 10:09:25,819 INFO L226 Difference]: Without dead ends: 11445 [2025-01-09 10:09:25,841 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:09:25,842 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 355 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:25,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1198 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11445 states. [2025-01-09 10:09:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11445 to 11435. [2025-01-09 10:09:26,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 7996 states have (on average 1.5167583791895949) internal successors, (12128), 8058 states have internal predecessors, (12128), 3374 states have call successors, (3374), 64 states have call predecessors, (3374), 64 states have return successors, (3374), 3312 states have call predecessors, (3374), 3374 states have call successors, (3374) [2025-01-09 10:09:26,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 18876 transitions. [2025-01-09 10:09:26,616 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 18876 transitions. Word has length 728 [2025-01-09 10:09:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:26,617 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 18876 transitions. [2025-01-09 10:09:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 18876 transitions. [2025-01-09 10:09:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2025-01-09 10:09:26,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:26,637 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:09:26,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash -757679697, now seen corresponding path program 1 times [2025-01-09 10:09:26,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:26,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828863553] [2025-01-09 10:09:26,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:26,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 728 statements into 1 equivalence classes. [2025-01-09 10:09:26,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 728 of 728 statements. [2025-01-09 10:09:26,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:26,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:29,063 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:29,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:29,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828863553] [2025-01-09 10:09:29,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828863553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:29,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:29,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:29,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808793917] [2025-01-09 10:09:29,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:29,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:29,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:29,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:29,066 INFO L87 Difference]: Start difference. First operand 11435 states and 18876 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:29,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:29,830 INFO L93 Difference]: Finished difference Result 22867 states and 37749 transitions. [2025-01-09 10:09:29,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:29,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 728 [2025-01-09 10:09:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:29,874 INFO L225 Difference]: With dead ends: 22867 [2025-01-09 10:09:29,874 INFO L226 Difference]: Without dead ends: 11435 [2025-01-09 10:09:29,901 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:09:29,901 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 594 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:29,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 607 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11435 states. [2025-01-09 10:09:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11435 to 11435. [2025-01-09 10:09:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11435 states, 7996 states have (on average 1.5087543771885943) internal successors, (12064), 8058 states have internal predecessors, (12064), 3374 states have call successors, (3374), 64 states have call predecessors, (3374), 64 states have return successors, (3374), 3312 states have call predecessors, (3374), 3374 states have call successors, (3374) [2025-01-09 10:09:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11435 states to 11435 states and 18812 transitions. [2025-01-09 10:09:30,557 INFO L78 Accepts]: Start accepts. Automaton has 11435 states and 18812 transitions. Word has length 728 [2025-01-09 10:09:30,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:30,558 INFO L471 AbstractCegarLoop]: Abstraction has 11435 states and 18812 transitions. [2025-01-09 10:09:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11435 states and 18812 transitions. [2025-01-09 10:09:30,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:09:30,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:30,570 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:09:30,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:30,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:30,571 INFO L85 PathProgramCache]: Analyzing trace with hash -396419213, now seen corresponding path program 1 times [2025-01-09 10:09:30,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:30,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710533979] [2025-01-09 10:09:30,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:30,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:30,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:30,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:30,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:30,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:30,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710533979] [2025-01-09 10:09:30,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710533979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:30,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:30,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:30,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820190428] [2025-01-09 10:09:30,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:30,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:30,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:30,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:30,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:30,999 INFO L87 Difference]: Start difference. First operand 11435 states and 18812 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:31,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:31,965 INFO L93 Difference]: Finished difference Result 34299 states and 56430 transitions. [2025-01-09 10:09:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 729 [2025-01-09 10:09:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:32,055 INFO L225 Difference]: With dead ends: 34299 [2025-01-09 10:09:32,055 INFO L226 Difference]: Without dead ends: 22867 [2025-01-09 10:09:32,086 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:09:32,088 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 357 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:32,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1212 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:09:32,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22867 states. [2025-01-09 10:09:34,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22867 to 22865. [2025-01-09 10:09:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22865 states, 15988 states have (on average 1.5048786589942458) internal successors, (24060), 16112 states have internal predecessors, (24060), 6748 states have call successors, (6748), 128 states have call predecessors, (6748), 128 states have return successors, (6748), 6624 states have call predecessors, (6748), 6748 states have call successors, (6748) [2025-01-09 10:09:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22865 states to 22865 states and 37556 transitions. [2025-01-09 10:09:34,210 INFO L78 Accepts]: Start accepts. Automaton has 22865 states and 37556 transitions. Word has length 729 [2025-01-09 10:09:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:34,211 INFO L471 AbstractCegarLoop]: Abstraction has 22865 states and 37556 transitions. [2025-01-09 10:09:34,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 22865 states and 37556 transitions. [2025-01-09 10:09:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:09:34,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:34,227 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:09:34,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:34,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:34,231 INFO L85 PathProgramCache]: Analyzing trace with hash -2085362955, now seen corresponding path program 1 times [2025-01-09 10:09:34,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:34,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194129187] [2025-01-09 10:09:34,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:34,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:34,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:34,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:34,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 165 proven. 177 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:35,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:35,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194129187] [2025-01-09 10:09:35,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194129187] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:35,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635549593] [2025-01-09 10:09:35,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:35,050 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:35,051 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:35,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:35,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:35,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:35,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:35,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:09:35,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 10362 proven. 90 refuted. 0 times theorem prover too weak. 15768 trivial. 0 not checked. [2025-01-09 10:09:35,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 252 proven. 90 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635549593] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:36,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:36,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 10:09:36,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688661944] [2025-01-09 10:09:36,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:36,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 10:09:36,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:36,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 10:09:36,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:09:36,304 INFO L87 Difference]: Start difference. First operand 22865 states and 37556 transitions. Second operand has 9 states, 9 states have (on average 30.11111111111111) internal successors, (271), 9 states have internal predecessors, (271), 4 states have call successors, (260), 2 states have call predecessors, (260), 4 states have return successors, (261), 4 states have call predecessors, (261), 4 states have call successors, (261) [2025-01-09 10:09:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:39,478 INFO L93 Difference]: Finished difference Result 48211 states and 78861 transitions. [2025-01-09 10:09:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 10:09:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 30.11111111111111) internal successors, (271), 9 states have internal predecessors, (271), 4 states have call successors, (260), 2 states have call predecessors, (260), 4 states have return successors, (261), 4 states have call predecessors, (261), 4 states have call successors, (261) Word has length 729 [2025-01-09 10:09:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:39,591 INFO L225 Difference]: With dead ends: 48211 [2025-01-09 10:09:39,592 INFO L226 Difference]: Without dead ends: 25349 [2025-01-09 10:09:39,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1480 GetRequests, 1456 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=424, Unknown=0, NotChecked=0, Total=600 [2025-01-09 10:09:39,641 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 1380 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:39,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 2487 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:09:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25349 states. [2025-01-09 10:09:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25349 to 25054. [2025-01-09 10:09:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25054 states, 17838 states have (on average 1.5076802332100012) internal successors, (26894), 17959 states have internal predecessors, (26894), 7020 states have call successors, (7020), 195 states have call predecessors, (7020), 195 states have return successors, (7020), 6899 states have call predecessors, (7020), 7020 states have call successors, (7020) [2025-01-09 10:09:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25054 states to 25054 states and 40934 transitions. [2025-01-09 10:09:41,513 INFO L78 Accepts]: Start accepts. Automaton has 25054 states and 40934 transitions. Word has length 729 [2025-01-09 10:09:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 25054 states and 40934 transitions. [2025-01-09 10:09:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.11111111111111) internal successors, (271), 9 states have internal predecessors, (271), 4 states have call successors, (260), 2 states have call predecessors, (260), 4 states have return successors, (261), 4 states have call predecessors, (261), 4 states have call successors, (261) [2025-01-09 10:09:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25054 states and 40934 transitions. [2025-01-09 10:09:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:09:41,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:41,531 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:09:41,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:41,735 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:41,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1025622461, now seen corresponding path program 1 times [2025-01-09 10:09:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495611321] [2025-01-09 10:09:41,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:41,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:41,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:41,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:42,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26220 trivial. 0 not checked. [2025-01-09 10:09:42,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:42,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495611321] [2025-01-09 10:09:42,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495611321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:09:42,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:09:42,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:09:42,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64527601] [2025-01-09 10:09:42,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:09:42,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:09:42,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:42,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:09:42,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:09:42,270 INFO L87 Difference]: Start difference. First operand 25054 states and 40934 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:43,928 INFO L93 Difference]: Finished difference Result 49466 states and 80712 transitions. [2025-01-09 10:09:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:09:43,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) Word has length 729 [2025-01-09 10:09:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:44,054 INFO L225 Difference]: With dead ends: 49466 [2025-01-09 10:09:44,054 INFO L226 Difference]: Without dead ends: 24560 [2025-01-09 10:09:44,098 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:09:44,100 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 344 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:44,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1455 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:09:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24560 states. [2025-01-09 10:09:45,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24560 to 16622. [2025-01-09 10:09:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16622 states, 12734 states have (on average 1.5553635935291346) internal successors, (19806), 12791 states have internal predecessors, (19806), 3756 states have call successors, (3756), 131 states have call predecessors, (3756), 131 states have return successors, (3756), 3699 states have call predecessors, (3756), 3756 states have call successors, (3756) [2025-01-09 10:09:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16622 states to 16622 states and 27318 transitions. [2025-01-09 10:09:45,880 INFO L78 Accepts]: Start accepts. Automaton has 16622 states and 27318 transitions. Word has length 729 [2025-01-09 10:09:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:45,881 INFO L471 AbstractCegarLoop]: Abstraction has 16622 states and 27318 transitions. [2025-01-09 10:09:45,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (115), 1 states have call predecessors, (115), 1 states have return successors, (115), 1 states have call predecessors, (115), 1 states have call successors, (115) [2025-01-09 10:09:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 16622 states and 27318 transitions. [2025-01-09 10:09:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2025-01-09 10:09:45,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:45,890 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:09:45,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash -120284351, now seen corresponding path program 1 times [2025-01-09 10:09:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655062215] [2025-01-09 10:09:45,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:46,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:46,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:46,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:46,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655062215] [2025-01-09 10:09:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655062215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:46,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974509374] [2025-01-09 10:09:46,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:46,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:46,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:46,435 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:46,437 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:46,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 729 statements into 1 equivalence classes. [2025-01-09 10:09:46,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 729 of 729 statements. [2025-01-09 10:09:46,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:46,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:46,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:09:46,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 10774 proven. 96 refuted. 0 times theorem prover too weak. 15350 trivial. 0 not checked. [2025-01-09 10:09:47,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:47,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 246 proven. 96 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:47,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974509374] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:47,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:47,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:09:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879687614] [2025-01-09 10:09:47,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:47,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:09:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:47,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:09:47,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:09:47,518 INFO L87 Difference]: Start difference. First operand 16622 states and 27318 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (147), 2 states have call predecessors, (147), 4 states have return successors, (148), 2 states have call predecessors, (148), 2 states have call successors, (148) [2025-01-09 10:09:48,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:48,768 INFO L93 Difference]: Finished difference Result 30640 states and 49966 transitions. [2025-01-09 10:09:48,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:09:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (147), 2 states have call predecessors, (147), 4 states have return successors, (148), 2 states have call predecessors, (148), 2 states have call successors, (148) Word has length 729 [2025-01-09 10:09:48,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:48,832 INFO L225 Difference]: With dead ends: 30640 [2025-01-09 10:09:48,832 INFO L226 Difference]: Without dead ends: 14166 [2025-01-09 10:09:48,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1464 GetRequests, 1455 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:09:48,860 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 713 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:48,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 1197 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:09:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14166 states. [2025-01-09 10:09:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14166 to 14002. [2025-01-09 10:09:50,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14002 states, 10097 states have (on average 1.502327423987323) internal successors, (15169), 10154 states have internal predecessors, (15169), 3756 states have call successors, (3756), 148 states have call predecessors, (3756), 148 states have return successors, (3756), 3699 states have call predecessors, (3756), 3756 states have call successors, (3756) [2025-01-09 10:09:50,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14002 states to 14002 states and 22681 transitions. [2025-01-09 10:09:50,233 INFO L78 Accepts]: Start accepts. Automaton has 14002 states and 22681 transitions. Word has length 729 [2025-01-09 10:09:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:50,234 INFO L471 AbstractCegarLoop]: Abstraction has 14002 states and 22681 transitions. [2025-01-09 10:09:50,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 7 states have internal predecessors, (166), 2 states have call successors, (147), 2 states have call predecessors, (147), 4 states have return successors, (148), 2 states have call predecessors, (148), 2 states have call successors, (148) [2025-01-09 10:09:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 14002 states and 22681 transitions. [2025-01-09 10:09:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:09:50,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:50,254 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,270 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:50,454 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:50,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:50,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:50,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1310180145, now seen corresponding path program 1 times [2025-01-09 10:09:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182273527] [2025-01-09 10:09:50,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:09:50,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:09:50,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:50,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 30 proven. 312 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:51,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182273527] [2025-01-09 10:09:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182273527] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399440375] [2025-01-09 10:09:51,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:51,587 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:51,589 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:51,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:09:51,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:09:51,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:51,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:51,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 10:09:51,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 4294 proven. 312 refuted. 0 times theorem prover too weak. 21614 trivial. 0 not checked. [2025-01-09 10:09:52,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:09:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 30 proven. 312 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:53,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399440375] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:09:53,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:09:53,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-01-09 10:09:53,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467485374] [2025-01-09 10:09:53,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:09:53,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:09:53,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:09:53,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:09:53,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:09:53,609 INFO L87 Difference]: Start difference. First operand 14002 states and 22681 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (220), 2 states have call predecessors, (220), 2 states have call successors, (220) [2025-01-09 10:09:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:09:56,414 INFO L93 Difference]: Finished difference Result 42800 states and 68548 transitions. [2025-01-09 10:09:56,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 10:09:56,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (220), 2 states have call predecessors, (220), 2 states have call successors, (220) Word has length 730 [2025-01-09 10:09:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:09:56,586 INFO L225 Difference]: With dead ends: 42800 [2025-01-09 10:09:56,587 INFO L226 Difference]: Without dead ends: 28950 [2025-01-09 10:09:56,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1477 GetRequests, 1457 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-01-09 10:09:56,652 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1331 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 10:09:56,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 1685 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 10:09:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28950 states. [2025-01-09 10:09:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28950 to 15658. [2025-01-09 10:09:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15658 states, 11468 states have (on average 1.4890129054761074) internal successors, (17076), 11529 states have internal predecessors, (17076), 3963 states have call successors, (3963), 226 states have call predecessors, (3963), 226 states have return successors, (3963), 3902 states have call predecessors, (3963), 3963 states have call successors, (3963) [2025-01-09 10:09:58,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15658 states to 15658 states and 25002 transitions. [2025-01-09 10:09:58,197 INFO L78 Accepts]: Start accepts. Automaton has 15658 states and 25002 transitions. Word has length 730 [2025-01-09 10:09:58,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:09:58,198 INFO L471 AbstractCegarLoop]: Abstraction has 15658 states and 25002 transitions. [2025-01-09 10:09:58,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 2 states have call successors, (219), 2 states have call predecessors, (219), 4 states have return successors, (220), 2 states have call predecessors, (220), 2 states have call successors, (220) [2025-01-09 10:09:58,198 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states and 25002 transitions. [2025-01-09 10:09:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:09:58,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:09:58,206 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:09:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 10:09:58,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:09:58,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:09:58,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1209779789, now seen corresponding path program 1 times [2025-01-09 10:09:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:09:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688155440] [2025-01-09 10:09:58,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:09:58,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:09:58,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:09:58,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:58,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 294 proven. 48 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:09:59,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:09:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688155440] [2025-01-09 10:09:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688155440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:09:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138376582] [2025-01-09 10:09:59,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:09:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:09:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:09:59,180 INFO L229 MonitoredProcess]: Starting monitored process 6 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:59,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 10:09:59,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:09:59,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:09:59,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:09:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:09:59,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 10:09:59,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:09:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 13168 proven. 159 refuted. 0 times theorem prover too weak. 12893 trivial. 0 not checked. [2025-01-09 10:09:59,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:10:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 183 proven. 159 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:10:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138376582] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:10:00,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:10:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2025-01-09 10:10:00,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057491777] [2025-01-09 10:10:00,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:10:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:10:00,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:00,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:10:00,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:10:00,411 INFO L87 Difference]: Start difference. First operand 15658 states and 25002 transitions. Second operand has 12 states, 11 states have (on average 23.09090909090909) internal successors, (254), 12 states have internal predecessors, (254), 4 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (223), 3 states have call predecessors, (223), 4 states have call successors, (223) [2025-01-09 10:10:05,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 10:10:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 10:10:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:10:14,302 INFO L93 Difference]: Finished difference Result 57338 states and 90913 transitions. [2025-01-09 10:10:14,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 10:10:14,303 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.09090909090909) internal successors, (254), 12 states have internal predecessors, (254), 4 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (223), 3 states have call predecessors, (223), 4 states have call successors, (223) Word has length 730 [2025-01-09 10:10:14,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:10:14,467 INFO L225 Difference]: With dead ends: 57338 [2025-01-09 10:10:14,467 INFO L226 Difference]: Without dead ends: 41836 [2025-01-09 10:10:14,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1507 GetRequests, 1462 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=542, Invalid=1438, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 10:10:14,514 INFO L435 NwaCegarLoop]: 1065 mSDtfsCounter, 2447 mSDsluCounter, 3042 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1303 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2449 SdHoareTripleChecker+Valid, 4107 SdHoareTripleChecker+Invalid, 3676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1303 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:10:14,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2449 Valid, 4107 Invalid, 3676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1303 Valid, 2371 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2025-01-09 10:10:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41836 states. [2025-01-09 10:10:17,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41836 to 38069. [2025-01-09 10:10:17,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38069 states, 28733 states have (on average 1.486687780600703) internal successors, (42717), 28918 states have internal predecessors, (42717), 8811 states have call successors, (8811), 524 states have call predecessors, (8811), 524 states have return successors, (8811), 8626 states have call predecessors, (8811), 8811 states have call successors, (8811) [2025-01-09 10:10:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38069 states to 38069 states and 60339 transitions. [2025-01-09 10:10:17,542 INFO L78 Accepts]: Start accepts. Automaton has 38069 states and 60339 transitions. Word has length 730 [2025-01-09 10:10:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:10:17,543 INFO L471 AbstractCegarLoop]: Abstraction has 38069 states and 60339 transitions. [2025-01-09 10:10:17,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.09090909090909) internal successors, (254), 12 states have internal predecessors, (254), 4 states have call successors, (221), 2 states have call predecessors, (221), 4 states have return successors, (223), 3 states have call predecessors, (223), 4 states have call successors, (223) [2025-01-09 10:10:17,543 INFO L276 IsEmpty]: Start isEmpty. Operand 38069 states and 60339 transitions. [2025-01-09 10:10:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2025-01-09 10:10:17,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:10:17,561 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:17,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 10:10:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 10:10:17,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:10:17,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:10:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash -989260173, now seen corresponding path program 1 times [2025-01-09 10:10:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:10:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809184977] [2025-01-09 10:10:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:10:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:10:17,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:10:17,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:17,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 228 proven. 114 refuted. 0 times theorem prover too weak. 25878 trivial. 0 not checked. [2025-01-09 10:10:18,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:10:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809184977] [2025-01-09 10:10:18,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809184977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:10:18,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242690857] [2025-01-09 10:10:18,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:10:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:10:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:10:18,346 INFO L229 MonitoredProcess]: Starting monitored process 7 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:10:18,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 10:10:18,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 730 statements into 1 equivalence classes. [2025-01-09 10:10:18,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 730 of 730 statements. [2025-01-09 10:10:18,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:10:18,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:10:18,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 10:10:18,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:10:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 11858 proven. 222 refuted. 0 times theorem prover too weak. 14140 trivial. 0 not checked. [2025-01-09 10:10:20,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:10:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26220 backedges. 456 proven. 225 refuted. 0 times theorem prover too weak. 25539 trivial. 0 not checked. [2025-01-09 10:10:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242690857] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:10:21,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:10:21,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2025-01-09 10:10:21,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128329833] [2025-01-09 10:10:21,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:10:21,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 10:10:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:10:21,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 10:10:21,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:10:21,109 INFO L87 Difference]: Start difference. First operand 38069 states and 60339 transitions. Second operand has 21 states, 20 states have (on average 18.55) internal successors, (371), 19 states have internal predecessors, (371), 8 states have call successors, (345), 4 states have call predecessors, (345), 8 states have return successors, (345), 8 states have call predecessors, (345), 8 states have call successors, (345)