./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_variablewrapping_wrapper-s_file-76.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 dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:56:01,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:56:01,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:56:01,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:56:01,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:56:01,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:56:01,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:56:01,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:56:01,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:56:01,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:56:01,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:56:01,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:56:01,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:56:01,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:56:01,935 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:01,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:56:01,935 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:56:01,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:56:01,936 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 -> dcd8b7c9719c9e124f88c0306e66fdc794df6c79afaa727af6840898442d18a1 [2025-02-06 03:56:02,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:56:02,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:56:02,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:56:02,213 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:56:02,213 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:56:02,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2025-02-06 03:56:03,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/deed6acab/baa9f526ee854ac7bb5d7b2823b877c8/FLAG5c6e8710b [2025-02-06 03:56:03,785 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:56:03,787 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-76.i [2025-02-06 03:56:03,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/deed6acab/baa9f526ee854ac7bb5d7b2823b877c8/FLAG5c6e8710b [2025-02-06 03:56:04,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/deed6acab/baa9f526ee854ac7bb5d7b2823b877c8 [2025-02-06 03:56:04,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:56:04,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:56:04,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:04,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:56:04,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:56:04,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5842314d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04, skipping insertion in model container [2025-02-06 03:56:04,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:56:04,188 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_variablewrapping_wrapper-s_file-76.i[916,929] [2025-02-06 03:56:04,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:04,262 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:56:04,270 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_variablewrapping_wrapper-s_file-76.i[916,929] [2025-02-06 03:56:04,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:56:04,339 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:56:04,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04 WrapperNode [2025-02-06 03:56:04,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:56:04,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:04,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:56:04,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:56:04,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,401 INFO L138 Inliner]: procedures = 30, calls = 134, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2025-02-06 03:56:04,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:56:04,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:56:04,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:56:04,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:56:04,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,413 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,419 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 03:56:04,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,439 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:56:04,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:56:04,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:56:04,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:56:04,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (1/1) ... [2025-02-06 03:56:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:56:04,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:04,483 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-02-06 03:56:04,486 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-02-06 03:56:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:56:04,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:56:04,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 03:56:04,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:56:04,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:56:04,595 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:56:04,597 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:56:05,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~ite66#1;havoc property_#t~mem63#1;havoc property_#t~mem62#1;havoc property_#t~mem65#1;havoc property_#t~mem64#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~ite75#1;havoc property_#t~mem69#1;havoc property_#t~ite74#1;havoc property_#t~mem73#1;havoc property_#t~mem70#1;havoc property_#t~ite72#1;havoc property_#t~mem71#1;havoc property_#t~short76#1;havoc property_#t~mem77#1;havoc property_#t~ite93#1;havoc property_#t~mem83#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~ite82#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short94#1;havoc property_#t~mem95#1;havoc property_#t~ite108#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite105#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short109#1; [2025-02-06 03:56:05,049 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-02-06 03:56:05,049 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:56:05,066 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:56:05,066 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:56:05,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:05 BoogieIcfgContainer [2025-02-06 03:56:05,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:56:05,070 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:56:05,070 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:56:05,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:56:05,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:56:04" (1/3) ... [2025-02-06 03:56:05,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277a87ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:05, skipping insertion in model container [2025-02-06 03:56:05,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:56:04" (2/3) ... [2025-02-06 03:56:05,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277a87ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:56:05, skipping insertion in model container [2025-02-06 03:56:05,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:05" (3/3) ... [2025-02-06 03:56:05,078 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-76.i [2025-02-06 03:56:05,091 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:56:05,092 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-76.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:56:05,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:56:05,154 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;@68da1197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:56:05,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:56:05,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:56:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:56:05,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:05,172 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:05,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:05,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 580118133, now seen corresponding path program 1 times [2025-02-06 03:56:05,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:05,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444889124] [2025-02-06 03:56:05,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:05,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:56:05,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:56:05,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:05,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:56:05,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444889124] [2025-02-06 03:56:05,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444889124] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:05,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71399207] [2025-02-06 03:56:05,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:05,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:05,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:05,524 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-02-06 03:56:05,525 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-02-06 03:56:05,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:56:05,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:56:05,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:05,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:05,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:56:05,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-02-06 03:56:05,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71399207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:56:05,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624795813] [2025-02-06 03:56:05,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:05,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:56:05,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:05,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:56:05,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:56:05,842 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 84 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:05,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:05,873 INFO L93 Difference]: Finished difference Result 192 states and 298 transitions. [2025-02-06 03:56:05,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:56:05,874 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2025-02-06 03:56:05,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:05,880 INFO L225 Difference]: With dead ends: 192 [2025-02-06 03:56:05,881 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:56:05,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-02-06 03:56:05,889 INFO L435 NwaCegarLoop]: 133 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, 133 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-02-06 03:56:05,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:56:05,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:56:05,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:56:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2025-02-06 03:56:05,936 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 119 [2025-02-06 03:56:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:05,936 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2025-02-06 03:56:05,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2025-02-06 03:56:05,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 03:56:05,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:05,943 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:05,952 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-02-06 03:56:06,144 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-02-06 03:56:06,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:06,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:06,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1684946745, now seen corresponding path program 1 times [2025-02-06 03:56:06,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:06,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261372256] [2025-02-06 03:56:06,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:06,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:06,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 03:56:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 03:56:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:06,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:06,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261372256] [2025-02-06 03:56:06,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261372256] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:06,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:06,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:56:06,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176857797] [2025-02-06 03:56:06,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:06,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:56:06,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:06,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:56:06,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:56:06,472 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:06,497 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2025-02-06 03:56:06,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:56:06,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2025-02-06 03:56:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:06,502 INFO L225 Difference]: With dead ends: 185 [2025-02-06 03:56:06,502 INFO L226 Difference]: Without dead ends: 94 [2025-02-06 03:56:06,503 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-02-06 03:56:06,503 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:06,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-06 03:56:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-06 03:56:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 03:56:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2025-02-06 03:56:06,520 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 119 [2025-02-06 03:56:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:06,542 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2025-02-06 03:56:06,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:06,543 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2025-02-06 03:56:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:56:06,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:06,549 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:06,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:56:06,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:06,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash 556071901, now seen corresponding path program 1 times [2025-02-06 03:56:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:06,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075063797] [2025-02-06 03:56:06,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:06,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:56:06,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:56:06,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:06,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:07,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075063797] [2025-02-06 03:56:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075063797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:07,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335636577] [2025-02-06 03:56:07,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:07,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:07,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:07,207 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:07,616 INFO L93 Difference]: Finished difference Result 321 states and 453 transitions. [2025-02-06 03:56:07,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:07,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2025-02-06 03:56:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:07,619 INFO L225 Difference]: With dead ends: 321 [2025-02-06 03:56:07,619 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 03:56:07,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:07,623 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 162 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:07,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 440 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:07,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 03:56:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 183. [2025-02-06 03:56:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 150 states have (on average 1.3266666666666667) internal successors, (199), 150 states have internal predecessors, (199), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 03:56:07,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 259 transitions. [2025-02-06 03:56:07,658 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 259 transitions. Word has length 120 [2025-02-06 03:56:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:07,660 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 259 transitions. [2025-02-06 03:56:07,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 259 transitions. [2025-02-06 03:56:07,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 03:56:07,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:07,662 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:07,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:56:07,662 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:07,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:07,662 INFO L85 PathProgramCache]: Analyzing trace with hash 767422814, now seen corresponding path program 1 times [2025-02-06 03:56:07,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:07,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297875300] [2025-02-06 03:56:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:07,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:07,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 03:56:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 03:56:07,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:07,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:09,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:09,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297875300] [2025-02-06 03:56:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297875300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:09,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:09,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:09,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383078385] [2025-02-06 03:56:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:09,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:09,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:09,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:09,535 INFO L87 Difference]: Start difference. First operand 183 states and 259 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:10,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:10,174 INFO L93 Difference]: Finished difference Result 533 states and 746 transitions. [2025-02-06 03:56:10,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:56:10,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2025-02-06 03:56:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:10,181 INFO L225 Difference]: With dead ends: 533 [2025-02-06 03:56:10,181 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 03:56:10,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:56:10,185 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 192 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:10,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 557 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 03:56:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 266. [2025-02-06 03:56:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 227 states have (on average 1.3436123348017621) internal successors, (305), 228 states have internal predecessors, (305), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 373 transitions. [2025-02-06 03:56:10,236 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 373 transitions. Word has length 120 [2025-02-06 03:56:10,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:10,237 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 373 transitions. [2025-02-06 03:56:10,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 373 transitions. [2025-02-06 03:56:10,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:56:10,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:10,239 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:10,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:56:10,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:10,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:10,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2065683492, now seen corresponding path program 1 times [2025-02-06 03:56:10,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:10,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784958148] [2025-02-06 03:56:10,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:10,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:10,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:56:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:56:10,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:10,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:11,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:11,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784958148] [2025-02-06 03:56:11,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784958148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:11,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:11,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:11,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414690082] [2025-02-06 03:56:11,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:11,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:11,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:11,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:11,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:11,291 INFO L87 Difference]: Start difference. First operand 266 states and 373 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:11,726 INFO L93 Difference]: Finished difference Result 725 states and 1016 transitions. [2025-02-06 03:56:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:11,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2025-02-06 03:56:11,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:11,731 INFO L225 Difference]: With dead ends: 725 [2025-02-06 03:56:11,731 INFO L226 Difference]: Without dead ends: 462 [2025-02-06 03:56:11,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:11,733 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 181 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:11,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 405 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:11,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-02-06 03:56:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 268. [2025-02-06 03:56:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.331877729257642) internal successors, (305), 230 states have internal predecessors, (305), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 373 transitions. [2025-02-06 03:56:11,770 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 373 transitions. Word has length 122 [2025-02-06 03:56:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 373 transitions. [2025-02-06 03:56:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 373 transitions. [2025-02-06 03:56:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 03:56:11,774 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:11,774 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:56:11,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 683078613, now seen corresponding path program 1 times [2025-02-06 03:56:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759232965] [2025-02-06 03:56:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:11,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 03:56:11,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 03:56:11,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:11,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:11,890 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:11,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:11,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759232965] [2025-02-06 03:56:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759232965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:11,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:11,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:56:11,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324314014] [2025-02-06 03:56:11,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:11,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:56:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:56:11,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:56:11,893 INFO L87 Difference]: Start difference. First operand 268 states and 373 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:11,926 INFO L93 Difference]: Finished difference Result 533 states and 743 transitions. [2025-02-06 03:56:11,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:56:11,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 122 [2025-02-06 03:56:11,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:11,929 INFO L225 Difference]: With dead ends: 533 [2025-02-06 03:56:11,929 INFO L226 Difference]: Without dead ends: 268 [2025-02-06 03:56:11,930 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-02-06 03:56:11,934 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 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-02-06 03:56:11,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:11,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-02-06 03:56:11,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-02-06 03:56:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 229 states have (on average 1.3187772925764192) internal successors, (302), 230 states have internal predecessors, (302), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 370 transitions. [2025-02-06 03:56:11,967 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 370 transitions. Word has length 122 [2025-02-06 03:56:11,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:11,968 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 370 transitions. [2025-02-06 03:56:11,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 370 transitions. [2025-02-06 03:56:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:56:11,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:11,971 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:11,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:56:11,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:11,973 INFO L85 PathProgramCache]: Analyzing trace with hash -624008742, now seen corresponding path program 1 times [2025-02-06 03:56:11,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:11,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79985938] [2025-02-06 03:56:11,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:11,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:12,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:56:12,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:56:12,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:13,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:13,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79985938] [2025-02-06 03:56:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79985938] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:13,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:13,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:56:13,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081056755] [2025-02-06 03:56:13,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:13,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:13,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:56:13,016 INFO L87 Difference]: Start difference. First operand 268 states and 370 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:13,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:13,776 INFO L93 Difference]: Finished difference Result 637 states and 873 transitions. [2025-02-06 03:56:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:13,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2025-02-06 03:56:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:13,779 INFO L225 Difference]: With dead ends: 637 [2025-02-06 03:56:13,779 INFO L226 Difference]: Without dead ends: 372 [2025-02-06 03:56:13,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:13,780 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 132 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:13,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 605 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 03:56:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-02-06 03:56:13,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 271. [2025-02-06 03:56:13,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 232 states have (on average 1.3060344827586208) internal successors, (303), 233 states have internal predecessors, (303), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:13,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 371 transitions. [2025-02-06 03:56:13,818 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 371 transitions. Word has length 124 [2025-02-06 03:56:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:13,819 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 371 transitions. [2025-02-06 03:56:13,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:13,819 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 371 transitions. [2025-02-06 03:56:13,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-06 03:56:13,820 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:13,820 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:13,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 03:56:13,821 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:13,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:13,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1509533029, now seen corresponding path program 1 times [2025-02-06 03:56:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:13,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661790574] [2025-02-06 03:56:13,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:13,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:13,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:56:13,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:56:13,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:13,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:56:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661790574] [2025-02-06 03:56:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661790574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:14,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688385607] [2025-02-06 03:56:14,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:14,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:14,016 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-02-06 03:56:14,020 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-02-06 03:56:14,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 03:56:14,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 03:56:14,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:14,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:14,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:56:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:14,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:56:14,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688385607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:14,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:56:14,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-02-06 03:56:14,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156319953] [2025-02-06 03:56:14,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:14,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:14,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:14,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:14,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:14,284 INFO L87 Difference]: Start difference. First operand 271 states and 371 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:14,331 INFO L93 Difference]: Finished difference Result 551 states and 754 transitions. [2025-02-06 03:56:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2025-02-06 03:56:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:14,334 INFO L225 Difference]: With dead ends: 551 [2025-02-06 03:56:14,335 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 03:56:14,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:56:14,337 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:14,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:56:14,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 03:56:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-02-06 03:56:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 244 states have (on average 1.290983606557377) internal successors, (315), 245 states have internal predecessors, (315), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 383 transitions. [2025-02-06 03:56:14,361 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 383 transitions. Word has length 124 [2025-02-06 03:56:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:14,362 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 383 transitions. [2025-02-06 03:56:14,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 383 transitions. [2025-02-06 03:56:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:56:14,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:14,363 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:14,372 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-02-06 03:56:14,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:14,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:14,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:14,568 INFO L85 PathProgramCache]: Analyzing trace with hash 746835928, now seen corresponding path program 1 times [2025-02-06 03:56:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829054540] [2025-02-06 03:56:14,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:56:14,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:56:14,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:14,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:14,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:14,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829054540] [2025-02-06 03:56:14,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829054540] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:14,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:14,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:14,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400315294] [2025-02-06 03:56:14,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:14,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:14,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:14,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:14,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:14,792 INFO L87 Difference]: Start difference. First operand 283 states and 383 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:14,956 INFO L93 Difference]: Finished difference Result 585 states and 790 transitions. [2025-02-06 03:56:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2025-02-06 03:56:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:14,959 INFO L225 Difference]: With dead ends: 585 [2025-02-06 03:56:14,959 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 03:56:14,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-02-06 03:56:14,963 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:14,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 323 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 03:56:14,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 290. [2025-02-06 03:56:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 251 states have (on average 1.2828685258964143) internal successors, (322), 252 states have internal predecessors, (322), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 390 transitions. [2025-02-06 03:56:14,991 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 390 transitions. Word has length 126 [2025-02-06 03:56:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:14,992 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 390 transitions. [2025-02-06 03:56:14,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 390 transitions. [2025-02-06 03:56:14,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:56:14,994 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:14,994 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:14,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:56:14,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:14,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:14,995 INFO L85 PathProgramCache]: Analyzing trace with hash 241277303, now seen corresponding path program 1 times [2025-02-06 03:56:14,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:14,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153027829] [2025-02-06 03:56:14,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:14,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:15,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:56:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:56:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:15,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:15,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153027829] [2025-02-06 03:56:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153027829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:15,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123789980] [2025-02-06 03:56:15,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:15,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:15,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:15,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:15,899 INFO L87 Difference]: Start difference. First operand 290 states and 390 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:16,284 INFO L93 Difference]: Finished difference Result 594 states and 796 transitions. [2025-02-06 03:56:16,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:56:16,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-06 03:56:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:16,288 INFO L225 Difference]: With dead ends: 594 [2025-02-06 03:56:16,288 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 03:56:16,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:16,290 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 62 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:16,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 451 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:16,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 03:56:16,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 274. [2025-02-06 03:56:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 235 states have (on average 1.2851063829787235) internal successors, (302), 236 states have internal predecessors, (302), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 370 transitions. [2025-02-06 03:56:16,326 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 370 transitions. Word has length 126 [2025-02-06 03:56:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:16,326 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 370 transitions. [2025-02-06 03:56:16,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 370 transitions. [2025-02-06 03:56:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-06 03:56:16,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:16,328 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:16,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:56:16,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:16,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:16,329 INFO L85 PathProgramCache]: Analyzing trace with hash -501856647, now seen corresponding path program 1 times [2025-02-06 03:56:16,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:16,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201789790] [2025-02-06 03:56:16,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:16,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:16,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 03:56:16,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 03:56:16,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:16,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:17,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:17,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201789790] [2025-02-06 03:56:17,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201789790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:17,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:17,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:56:17,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903234349] [2025-02-06 03:56:17,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:17,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:56:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:17,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:56:17,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:17,094 INFO L87 Difference]: Start difference. First operand 274 states and 370 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:17,492 INFO L93 Difference]: Finished difference Result 753 states and 1015 transitions. [2025-02-06 03:56:17,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:17,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 126 [2025-02-06 03:56:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:17,496 INFO L225 Difference]: With dead ends: 753 [2025-02-06 03:56:17,496 INFO L226 Difference]: Without dead ends: 482 [2025-02-06 03:56:17,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:17,497 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 155 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:17,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 430 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-06 03:56:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 306. [2025-02-06 03:56:17,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 267 states have (on average 1.2734082397003745) internal successors, (340), 268 states have internal predecessors, (340), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-06 03:56:17,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 408 transitions. [2025-02-06 03:56:17,529 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 408 transitions. Word has length 126 [2025-02-06 03:56:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:17,531 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 408 transitions. [2025-02-06 03:56:17,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-06 03:56:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 408 transitions. [2025-02-06 03:56:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-06 03:56:17,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:17,533 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:17,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:56:17,533 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:17,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:17,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1480147632, now seen corresponding path program 1 times [2025-02-06 03:56:17,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:17,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203567954] [2025-02-06 03:56:17,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:17,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:56:17,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:56:17,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:17,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:18,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:56:18,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203567954] [2025-02-06 03:56:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203567954] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084407430] [2025-02-06 03:56:18,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:18,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:18,728 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-02-06 03:56:18,730 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-02-06 03:56:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 03:56:18,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 03:56:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:18,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 03:56:18,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:19,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 03:56:19,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 03:56:19,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 55 [2025-02-06 03:56:19,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:56:19,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2025-02-06 03:56:19,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:56:19,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 146 [2025-02-06 03:56:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:56:19,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:56:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084407430] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:19,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:56:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11, 10] total 15 [2025-02-06 03:56:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144472912] [2025-02-06 03:56:19,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:19,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:56:19,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:56:19,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:56:19,955 INFO L87 Difference]: Start difference. First operand 306 states and 408 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:20,444 INFO L93 Difference]: Finished difference Result 676 states and 901 transitions. [2025-02-06 03:56:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:56:20,445 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2025-02-06 03:56:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:20,448 INFO L225 Difference]: With dead ends: 676 [2025-02-06 03:56:20,448 INFO L226 Difference]: Without dead ends: 486 [2025-02-06 03:56:20,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 255 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:56:20,450 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 85 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:20,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 723 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:56:20,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-02-06 03:56:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 483. [2025-02-06 03:56:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 427 states have (on average 1.2740046838407495) internal successors, (544), 430 states have internal predecessors, (544), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:56:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 642 transitions. [2025-02-06 03:56:20,489 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 642 transitions. Word has length 128 [2025-02-06 03:56:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 642 transitions. [2025-02-06 03:56:20,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:20,492 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 642 transitions. [2025-02-06 03:56:20,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-06 03:56:20,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:20,495 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:20,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 03:56:20,696 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-02-06 03:56:20,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:20,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:20,697 INFO L85 PathProgramCache]: Analyzing trace with hash -725902073, now seen corresponding path program 1 times [2025-02-06 03:56:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876985845] [2025-02-06 03:56:20,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:20,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:20,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-06 03:56:20,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-06 03:56:20,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:20,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:20,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:20,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876985845] [2025-02-06 03:56:20,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876985845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:20,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:20,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:20,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664870712] [2025-02-06 03:56:20,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:20,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:20,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:20,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:20,969 INFO L87 Difference]: Start difference. First operand 483 states and 642 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:21,229 INFO L93 Difference]: Finished difference Result 977 states and 1291 transitions. [2025-02-06 03:56:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2025-02-06 03:56:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:21,233 INFO L225 Difference]: With dead ends: 977 [2025-02-06 03:56:21,234 INFO L226 Difference]: Without dead ends: 497 [2025-02-06 03:56:21,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:21,235 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 54 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:21,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 470 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-06 03:56:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 495. [2025-02-06 03:56:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 436 states have (on average 1.261467889908257) internal successors, (550), 439 states have internal predecessors, (550), 49 states have call successors, (49), 9 states have call predecessors, (49), 9 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2025-02-06 03:56:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 648 transitions. [2025-02-06 03:56:21,266 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 648 transitions. Word has length 129 [2025-02-06 03:56:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:21,267 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 648 transitions. [2025-02-06 03:56:21,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 648 transitions. [2025-02-06 03:56:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:56:21,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:21,268 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:21,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:56:21,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:21,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1356436251, now seen corresponding path program 1 times [2025-02-06 03:56:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440675908] [2025-02-06 03:56:21,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:21,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:56:21,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:56:21,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:21,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:21,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440675908] [2025-02-06 03:56:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440675908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:56:21,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152290443] [2025-02-06 03:56:21,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:21,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:56:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:21,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:56:21,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:56:21,961 INFO L87 Difference]: Start difference. First operand 495 states and 648 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:56:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:22,554 INFO L93 Difference]: Finished difference Result 824 states and 1066 transitions. [2025-02-06 03:56:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:56:22,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 130 [2025-02-06 03:56:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:22,559 INFO L225 Difference]: With dead ends: 824 [2025-02-06 03:56:22,560 INFO L226 Difference]: Without dead ends: 822 [2025-02-06 03:56:22,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:22,561 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 74 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:22,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 609 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:56:22,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2025-02-06 03:56:22,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2025-02-06 03:56:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 705 states have (on average 1.2326241134751772) internal successors, (869), 713 states have internal predecessors, (869), 94 states have call successors, (94), 18 states have call predecessors, (94), 18 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 03:56:22,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1057 transitions. [2025-02-06 03:56:22,654 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1057 transitions. Word has length 130 [2025-02-06 03:56:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:22,654 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1057 transitions. [2025-02-06 03:56:22,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 9 states have internal predecessors, (58), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-06 03:56:22,654 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1057 transitions. [2025-02-06 03:56:22,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-06 03:56:22,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:22,656 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:22,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:56:22,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:22,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:22,657 INFO L85 PathProgramCache]: Analyzing trace with hash 20313907, now seen corresponding path program 1 times [2025-02-06 03:56:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315109138] [2025-02-06 03:56:22,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:22,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 03:56:22,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 03:56:22,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:22,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315109138] [2025-02-06 03:56:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315109138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425965153] [2025-02-06 03:56:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:22,883 INFO L87 Difference]: Start difference. First operand 818 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:23,189 INFO L93 Difference]: Finished difference Result 1439 states and 1852 transitions. [2025-02-06 03:56:23,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:23,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-02-06 03:56:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:23,194 INFO L225 Difference]: With dead ends: 1439 [2025-02-06 03:56:23,195 INFO L226 Difference]: Without dead ends: 818 [2025-02-06 03:56:23,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:23,197 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 48 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:23,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 370 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:56:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2025-02-06 03:56:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 816. [2025-02-06 03:56:23,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 699 states have (on average 1.2217453505007152) internal successors, (854), 707 states have internal predecessors, (854), 94 states have call successors, (94), 22 states have call predecessors, (94), 22 states have return successors, (94), 86 states have call predecessors, (94), 94 states have call successors, (94) [2025-02-06 03:56:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1042 transitions. [2025-02-06 03:56:23,256 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1042 transitions. Word has length 130 [2025-02-06 03:56:23,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:23,257 INFO L471 AbstractCegarLoop]: Abstraction has 816 states and 1042 transitions. [2025-02-06 03:56:23,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1042 transitions. [2025-02-06 03:56:23,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:56:23,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:23,260 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:23,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:56:23,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:23,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:23,260 INFO L85 PathProgramCache]: Analyzing trace with hash -999176918, now seen corresponding path program 1 times [2025-02-06 03:56:23,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:23,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578472495] [2025-02-06 03:56:23,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:23,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:23,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:56:23,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:56:23,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:23,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:23,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578472495] [2025-02-06 03:56:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578472495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:23,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:56:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759911993] [2025-02-06 03:56:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:56:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:23,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:56:23,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:56:23,576 INFO L87 Difference]: Start difference. First operand 816 states and 1042 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:23,966 INFO L93 Difference]: Finished difference Result 1951 states and 2486 transitions. [2025-02-06 03:56:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:56:23,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:56:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:23,973 INFO L225 Difference]: With dead ends: 1951 [2025-02-06 03:56:23,973 INFO L226 Difference]: Without dead ends: 1138 [2025-02-06 03:56:23,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:23,976 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 71 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:23,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1082 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-02-06 03:56:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1134. [2025-02-06 03:56:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 987 states have (on average 1.2178318135764945) internal successors, (1202), 999 states have internal predecessors, (1202), 116 states have call successors, (116), 30 states have call predecessors, (116), 30 states have return successors, (116), 104 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 03:56:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1434 transitions. [2025-02-06 03:56:24,053 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1434 transitions. Word has length 131 [2025-02-06 03:56:24,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:24,053 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1434 transitions. [2025-02-06 03:56:24,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1434 transitions. [2025-02-06 03:56:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-06 03:56:24,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:24,055 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:24,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:56:24,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1253913463, now seen corresponding path program 1 times [2025-02-06 03:56:24,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:24,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322572840] [2025-02-06 03:56:24,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:24,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-06 03:56:24,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-06 03:56:24,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:24,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:24,250 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322572840] [2025-02-06 03:56:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322572840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:24,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511387383] [2025-02-06 03:56:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:24,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:24,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:24,253 INFO L87 Difference]: Start difference. First operand 1134 states and 1434 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:24,658 INFO L93 Difference]: Finished difference Result 2814 states and 3573 transitions. [2025-02-06 03:56:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-02-06 03:56:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:24,669 INFO L225 Difference]: With dead ends: 2814 [2025-02-06 03:56:24,669 INFO L226 Difference]: Without dead ends: 1683 [2025-02-06 03:56:24,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:24,673 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 122 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:24,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 384 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2025-02-06 03:56:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1145. [2025-02-06 03:56:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 998 states have (on average 1.2104208416833668) internal successors, (1208), 1010 states have internal predecessors, (1208), 116 states have call successors, (116), 30 states have call predecessors, (116), 30 states have return successors, (116), 104 states have call predecessors, (116), 116 states have call successors, (116) [2025-02-06 03:56:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1440 transitions. [2025-02-06 03:56:24,782 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1440 transitions. Word has length 131 [2025-02-06 03:56:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:24,782 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1440 transitions. [2025-02-06 03:56:24,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:24,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1440 transitions. [2025-02-06 03:56:24,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:56:24,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:24,785 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:24,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:56:24,786 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:24,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:24,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1109936174, now seen corresponding path program 1 times [2025-02-06 03:56:24,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:24,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157070198] [2025-02-06 03:56:24,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:56:24,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:56:24,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:24,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:56:25,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:25,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157070198] [2025-02-06 03:56:25,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157070198] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:56:25,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573328539] [2025-02-06 03:56:25,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:25,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:56:25,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:56:25,366 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-02-06 03:56:25,370 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-02-06 03:56:25,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:56:25,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:56:25,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:25,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 03:56:25,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:56:25,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:56:25,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:56:25,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:56:25,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:56:25,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 03:56:25,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-02-06 03:56:25,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:56:25,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2025-02-06 03:56:25,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:56:25,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2025-02-06 03:56:25,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 204 proven. 27 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2025-02-06 03:56:25,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:56:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 15 proven. 27 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-06 03:56:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573328539] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:56:26,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:56:26,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-06 03:56:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775817506] [2025-02-06 03:56:26,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:56:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:56:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:26,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:56:26,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:56:26,175 INFO L87 Difference]: Start difference. First operand 1145 states and 1440 transitions. Second operand has 13 states, 10 states have (on average 7.7) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 2 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-06 03:56:27,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:27,232 INFO L93 Difference]: Finished difference Result 2460 states and 3070 transitions. [2025-02-06 03:56:27,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 03:56:27,232 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 7.7) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 2 states have call predecessors, (26), 5 states have call successors, (26) Word has length 132 [2025-02-06 03:56:27,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:27,239 INFO L225 Difference]: With dead ends: 2460 [2025-02-06 03:56:27,240 INFO L226 Difference]: Without dead ends: 1318 [2025-02-06 03:56:27,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 258 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:56:27,243 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 323 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:27,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 401 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 03:56:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2025-02-06 03:56:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1280. [2025-02-06 03:56:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1053 states have (on average 1.1861348528015194) internal successors, (1249), 1066 states have internal predecessors, (1249), 171 states have call successors, (171), 55 states have call predecessors, (171), 55 states have return successors, (171), 158 states have call predecessors, (171), 171 states have call successors, (171) [2025-02-06 03:56:27,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1591 transitions. [2025-02-06 03:56:27,351 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1591 transitions. Word has length 132 [2025-02-06 03:56:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:27,352 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1591 transitions. [2025-02-06 03:56:27,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 7.7) internal successors, (77), 13 states have internal predecessors, (77), 5 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (26), 2 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-06 03:56:27,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1591 transitions. [2025-02-06 03:56:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-06 03:56:27,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:27,353 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:27,364 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-02-06 03:56:27,554 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,SelfDestructingSolverStorable17 [2025-02-06 03:56:27,554 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:27,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:27,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1390869277, now seen corresponding path program 1 times [2025-02-06 03:56:27,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:27,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472628187] [2025-02-06 03:56:27,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:27,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-06 03:56:27,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-06 03:56:27,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:27,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:27,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:27,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472628187] [2025-02-06 03:56:27,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472628187] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:27,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:27,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:27,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632007943] [2025-02-06 03:56:27,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:27,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:27,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:27,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:27,746 INFO L87 Difference]: Start difference. First operand 1280 states and 1591 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:28,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:28,189 INFO L93 Difference]: Finished difference Result 2175 states and 2699 transitions. [2025-02-06 03:56:28,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:28,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-02-06 03:56:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:28,195 INFO L225 Difference]: With dead ends: 2175 [2025-02-06 03:56:28,196 INFO L226 Difference]: Without dead ends: 954 [2025-02-06 03:56:28,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:28,199 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 92 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:28,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 451 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:28,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2025-02-06 03:56:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 882. [2025-02-06 03:56:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 733 states have (on average 1.1773533424283766) internal successors, (863), 741 states have internal predecessors, (863), 112 states have call successors, (112), 36 states have call predecessors, (112), 36 states have return successors, (112), 104 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1087 transitions. [2025-02-06 03:56:28,267 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1087 transitions. Word has length 132 [2025-02-06 03:56:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:28,267 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1087 transitions. [2025-02-06 03:56:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1087 transitions. [2025-02-06 03:56:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-06 03:56:28,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:28,269 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:56:28,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:56:28,269 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:28,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash 648625117, now seen corresponding path program 1 times [2025-02-06 03:56:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375489487] [2025-02-06 03:56:28,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:28,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 03:56:28,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 03:56:28,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:28,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-02-06 03:56:28,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375489487] [2025-02-06 03:56:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375489487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:56:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162696485] [2025-02-06 03:56:28,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:28,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:56:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:28,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:56:28,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:56:28,458 INFO L87 Difference]: Start difference. First operand 882 states and 1087 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:28,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:28,824 INFO L93 Difference]: Finished difference Result 2101 states and 2582 transitions. [2025-02-06 03:56:28,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:56:28,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-02-06 03:56:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:28,833 INFO L225 Difference]: With dead ends: 2101 [2025-02-06 03:56:28,833 INFO L226 Difference]: Without dead ends: 1222 [2025-02-06 03:56:28,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:56:28,836 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 63 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:28,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 479 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:56:28,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2025-02-06 03:56:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 884. [2025-02-06 03:56:28,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 735 states have (on average 1.1496598639455782) internal successors, (845), 743 states have internal predecessors, (845), 112 states have call successors, (112), 36 states have call predecessors, (112), 36 states have return successors, (112), 104 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-06 03:56:28,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1069 transitions. [2025-02-06 03:56:28,914 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1069 transitions. Word has length 133 [2025-02-06 03:56:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:28,915 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1069 transitions. [2025-02-06 03:56:28,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1069 transitions. [2025-02-06 03:56:28,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-02-06 03:56:28,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:56:28,920 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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-02-06 03:56:28,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:56:28,920 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:56:28,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:56:28,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1793371652, now seen corresponding path program 1 times [2025-02-06 03:56:28,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:56:28,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205960775] [2025-02-06 03:56:28,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:56:28,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:56:28,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-02-06 03:56:28,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-02-06 03:56:28,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:56:28,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:56:29,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 1776 trivial. 0 not checked. [2025-02-06 03:56:29,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:56:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205960775] [2025-02-06 03:56:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205960775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:56:29,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:56:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:56:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3512004] [2025-02-06 03:56:29,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:56:29,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:56:29,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:56:29,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:56:29,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:29,283 INFO L87 Difference]: Start difference. First operand 884 states and 1069 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:56:29,438 INFO L93 Difference]: Finished difference Result 1112 states and 1329 transitions. [2025-02-06 03:56:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:56:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 247 [2025-02-06 03:56:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:56:29,441 INFO L225 Difference]: With dead ends: 1112 [2025-02-06 03:56:29,441 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:56:29,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:56:29,443 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:56:29,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:56:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:56:29,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:56:29,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 03:56:29,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:56:29,445 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2025-02-06 03:56:29,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:56:29,445 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:56:29,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-02-06 03:56:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:56:29,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:56:29,448 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:56:29,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:56:29,451 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:56:29,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 03:56:36,680 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:56:36,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,690 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,692 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,694 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,695 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,698 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,699 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,700 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] [2025-02-06 03:56:36,703 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] [2025-02-06 03:56:36,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:56:36 BoogieIcfgContainer [2025-02-06 03:56:36,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:56:36,704 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:56:36,704 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:56:36,705 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:56:36,705 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:56:05" (3/4) ... [2025-02-06 03:56:36,708 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 03:56:36,714 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 03:56:36,725 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-02-06 03:56:36,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 03:56:36,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 03:56:36,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 03:56:36,827 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 03:56:36,828 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 03:56:36,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:56:36,828 INFO L158 Benchmark]: Toolchain (without parser) took 32789.97ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 889.2MB). Free memory was 124.1MB in the beginning and 792.2MB in the end (delta: -668.1MB). Peak memory consumption was 217.6MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,828 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.17ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 108.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.56ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: Boogie Preprocessor took 43.08ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: IcfgBuilder took 621.65ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 74.3MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: TraceAbstraction took 31633.94ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 889.2MB). Free memory was 73.6MB in the beginning and 804.6MB in the end (delta: -731.0MB). Peak memory consumption was 472.5MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,829 INFO L158 Benchmark]: Witness Printer took 123.24ms. Allocated memory is still 1.1GB. Free memory was 804.6MB in the beginning and 792.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:56:36,832 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.17ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 108.6MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.56ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 105.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.08ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 103.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 621.65ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 74.3MB in the end (delta: 28.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31633.94ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 889.2MB). Free memory was 73.6MB in the beginning and 804.6MB in the end (delta: -731.0MB). Peak memory consumption was 472.5MB. Max. memory is 16.1GB. * Witness Printer took 123.24ms. Allocated memory is still 1.1GB. Free memory was 804.6MB in the beginning and 792.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int,GLOBAL],[IdentifierExpression[~#WrapperStruct00~0!base,GLOBAL]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 21, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1835 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1818 mSDsluCounter, 9690 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6934 mSDsCounter, 380 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5118 IncrementalHoareTripleChecker+Invalid, 5498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 380 mSolverCounterUnsat, 2756 mSDtfsCounter, 5118 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 865 SyntacticMatches, 11 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1280occurred in iteration=18, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 1654 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 3274 NumberOfCodeBlocks, 3274 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3507 ConstructedInterpolants, 0 QuantifiedInterpolants, 11134 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1794 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 12514/12716 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 03:56:36,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE