./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.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-a_file-85.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 f2dab74649212a3ffb00bb2114fde15cc6c5343aaff8c111997aa1541045c9bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:21:06,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:21:06,439 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:21:06,446 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:21:06,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:21:06,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:21:06,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:21:06,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:21:06,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:21:06,468 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:21:06,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:21:06,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:21:06,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:21:06,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:21:06,470 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:21:06,471 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:06,471 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:21:06,471 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:21:06,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:21:06,472 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 -> f2dab74649212a3ffb00bb2114fde15cc6c5343aaff8c111997aa1541045c9bd [2025-02-06 03:21:06,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:21:06,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:21:06,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:21:06,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:21:06,679 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:21:06,680 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-a_file-85.i [2025-02-06 03:21:07,756 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf88beae/4d31c435e4f5448d8d7fc30d72c9f6a1/FLAG8b2dd0ded [2025-02-06 03:21:08,019 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:21:08,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i [2025-02-06 03:21:08,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf88beae/4d31c435e4f5448d8d7fc30d72c9f6a1/FLAG8b2dd0ded [2025-02-06 03:21:08,321 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcf88beae/4d31c435e4f5448d8d7fc30d72c9f6a1 [2025-02-06 03:21:08,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:21:08,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:21:08,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:08,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:21:08,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:21:08,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3c9d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08, skipping insertion in model container [2025-02-06 03:21:08,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:21:08,447 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-a_file-85.i[916,929] [2025-02-06 03:21:08,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:08,536 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:21:08,544 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-a_file-85.i[916,929] [2025-02-06 03:21:08,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:21:08,594 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:21:08,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08 WrapperNode [2025-02-06 03:21:08,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:21:08,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:08,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:21:08,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:21:08,599 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:21:08" (1/1) ... [2025-02-06 03:21:08,607 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:21:08" (1/1) ... [2025-02-06 03:21:08,648 INFO L138 Inliner]: procedures = 27, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2025-02-06 03:21:08,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:21:08,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:21:08,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:21:08,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:21:08,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,681 INFO L175 MemorySlicer]: Split 140 memory accesses to 6 slices as follows [2, 70, 25, 7, 29, 7]. 50 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 0, 3, 1, 2, 1]. The 33 writes are split as follows [0, 23, 4, 3, 2, 1]. [2025-02-06 03:21:08,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:21:08,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:21:08,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:21:08,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:21:08,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (1/1) ... [2025-02-06 03:21:08,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:21:08,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:08,737 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:21:08,741 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:21:08,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:21:08,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:21:08,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:21:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:21:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:21:08,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:21:08,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:21:08,856 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:21:08,857 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:21:09,297 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-02-06 03:21:09,334 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-02-06 03:21:09,335 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:21:09,347 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:21:09,347 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:21:09,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:09 BoogieIcfgContainer [2025-02-06 03:21:09,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:21:09,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:21:09,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:21:09,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:21:09,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:21:08" (1/3) ... [2025-02-06 03:21:09,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257c2e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:09, skipping insertion in model container [2025-02-06 03:21:09,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:21:08" (2/3) ... [2025-02-06 03:21:09,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257c2e7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:21:09, skipping insertion in model container [2025-02-06 03:21:09,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:21:09" (3/3) ... [2025-02-06 03:21:09,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-85.i [2025-02-06 03:21:09,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:21:09,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-85.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:21:09,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:21:09,428 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;@110276c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:21:09,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:21:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:09,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-06 03:21:09,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:09,444 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:09,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -378510325, now seen corresponding path program 1 times [2025-02-06 03:21:09,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:09,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727204953] [2025-02-06 03:21:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:09,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 03:21:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 03:21:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 03:21:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727204953] [2025-02-06 03:21:09,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727204953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:09,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862694670] [2025-02-06 03:21:09,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:09,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:09,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:09,752 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:21:09,753 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:21:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 03:21:09,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 03:21:09,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:09,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:09,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:21:09,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 03:21:09,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:21:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862694670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:21:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:21:09,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661864936] [2025-02-06 03:21:09,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:09,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:21:09,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:09,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:21:09,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:21:09,994 INFO L87 Difference]: Start difference. First operand has 130 states, 104 states have (on average 1.375) internal successors, (143), 105 states have internal predecessors, (143), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:10,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:10,012 INFO L93 Difference]: Finished difference Result 254 states and 396 transitions. [2025-02-06 03:21:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:21:10,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-02-06 03:21:10,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:10,018 INFO L225 Difference]: With dead ends: 254 [2025-02-06 03:21:10,018 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 03:21:10,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 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:21:10,023 INFO L435 NwaCegarLoop]: 184 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, 184 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:21:10,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 03:21:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-06 03:21:10,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:10,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-02-06 03:21:10,059 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2025-02-06 03:21:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:10,059 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-02-06 03:21:10,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:10,059 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-02-06 03:21:10,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-06 03:21:10,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:10,065 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,073 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:21:10,266 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:21:10,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:10,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash -308756012, now seen corresponding path program 1 times [2025-02-06 03:21:10,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:10,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511139358] [2025-02-06 03:21:10,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:10,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:10,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 03:21:10,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 03:21:10,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:10,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:10,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:10,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511139358] [2025-02-06 03:21:10,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511139358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:10,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:10,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:10,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062752698] [2025-02-06 03:21:10,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:10,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:10,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:10,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:10,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:10,545 INFO L87 Difference]: Start difference. First operand 127 states and 184 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:10,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:10,599 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2025-02-06 03:21:10,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:10,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-02-06 03:21:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:10,601 INFO L225 Difference]: With dead ends: 254 [2025-02-06 03:21:10,601 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 03:21:10,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:21:10,602 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:10,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 534 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:10,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 03:21:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-02-06 03:21:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-02-06 03:21:10,610 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 179 [2025-02-06 03:21:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:10,611 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-02-06 03:21:10,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-02-06 03:21:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-06 03:21:10,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:10,612 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:10,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 03:21:10,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:10,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:10,613 INFO L85 PathProgramCache]: Analyzing trace with hash -297439885, now seen corresponding path program 1 times [2025-02-06 03:21:10,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16826696] [2025-02-06 03:21:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:10,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 03:21:10,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 03:21:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:11,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:11,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16826696] [2025-02-06 03:21:11,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16826696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:11,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:11,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:11,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329450105] [2025-02-06 03:21:11,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:11,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:11,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:11,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:11,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:11,051 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:11,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:11,351 INFO L93 Difference]: Finished difference Result 374 states and 541 transitions. [2025-02-06 03:21:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-02-06 03:21:11,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:11,354 INFO L225 Difference]: With dead ends: 374 [2025-02-06 03:21:11,354 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 03:21:11,355 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:21:11,355 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 158 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:11,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 809 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:11,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 03:21:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-02-06 03:21:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-02-06 03:21:11,370 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 179 [2025-02-06 03:21:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:11,370 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-02-06 03:21:11,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2025-02-06 03:21:11,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-02-06 03:21:11,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:11,374 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:11,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 03:21:11,374 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:11,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 513934839, now seen corresponding path program 1 times [2025-02-06 03:21:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:11,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307333549] [2025-02-06 03:21:11,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:11,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-02-06 03:21:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-02-06 03:21:11,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:11,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:12,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:12,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307333549] [2025-02-06 03:21:12,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307333549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:12,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:12,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:21:12,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118265731] [2025-02-06 03:21:12,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:12,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:12,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:12,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:12,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:12,783 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:13,325 INFO L93 Difference]: Finished difference Result 478 states and 685 transitions. [2025-02-06 03:21:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:13,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 179 [2025-02-06 03:21:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:13,328 INFO L225 Difference]: With dead ends: 478 [2025-02-06 03:21:13,328 INFO L226 Difference]: Without dead ends: 350 [2025-02-06 03:21:13,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:13,332 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 286 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:13,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 867 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:21:13,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-02-06 03:21:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 203. [2025-02-06 03:21:13,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 176 states have internal predecessors, (241), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:13,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2025-02-06 03:21:13,360 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 179 [2025-02-06 03:21:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:13,360 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2025-02-06 03:21:13,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:13,360 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2025-02-06 03:21:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:13,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:13,364 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 03:21:13,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash 588004448, now seen corresponding path program 1 times [2025-02-06 03:21:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710477397] [2025-02-06 03:21:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:13,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:13,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:13,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:13,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:13,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:13,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710477397] [2025-02-06 03:21:13,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710477397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:13,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:13,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:13,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874395668] [2025-02-06 03:21:13,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:13,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:13,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:13,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:13,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:13,836 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:13,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:13,950 INFO L93 Difference]: Finished difference Result 560 states and 801 transitions. [2025-02-06 03:21:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:13,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:13,954 INFO L225 Difference]: With dead ends: 560 [2025-02-06 03:21:13,955 INFO L226 Difference]: Without dead ends: 360 [2025-02-06 03:21:13,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:13,957 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 143 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:13,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1152 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-06 03:21:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 215. [2025-02-06 03:21:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 187 states have (on average 1.3636363636363635) internal successors, (255), 188 states have internal predecessors, (255), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2025-02-06 03:21:13,975 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 180 [2025-02-06 03:21:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:13,976 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2025-02-06 03:21:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2025-02-06 03:21:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:13,979 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:13,979 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:13,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 03:21:13,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:13,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:13,981 INFO L85 PathProgramCache]: Analyzing trace with hash 77470271, now seen corresponding path program 1 times [2025-02-06 03:21:13,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:13,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720997014] [2025-02-06 03:21:13,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:13,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:14,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:14,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:14,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:14,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720997014] [2025-02-06 03:21:14,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720997014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:14,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:14,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105137704] [2025-02-06 03:21:14,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:14,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:14,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:14,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:14,357 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:14,613 INFO L93 Difference]: Finished difference Result 560 states and 798 transitions. [2025-02-06 03:21:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:14,615 INFO L225 Difference]: With dead ends: 560 [2025-02-06 03:21:14,615 INFO L226 Difference]: Without dead ends: 348 [2025-02-06 03:21:14,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:14,616 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 157 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:14,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 912 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:14,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-06 03:21:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 235. [2025-02-06 03:21:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.357487922705314) internal successors, (281), 208 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 331 transitions. [2025-02-06 03:21:14,628 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 331 transitions. Word has length 180 [2025-02-06 03:21:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:14,629 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 331 transitions. [2025-02-06 03:21:14,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 331 transitions. [2025-02-06 03:21:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:14,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:14,630 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:14,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 03:21:14,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:14,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:14,631 INFO L85 PathProgramCache]: Analyzing trace with hash -953879141, now seen corresponding path program 1 times [2025-02-06 03:21:14,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:14,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783786429] [2025-02-06 03:21:14,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:14,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:14,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:14,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:14,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:14,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783786429] [2025-02-06 03:21:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783786429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:15,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579481233] [2025-02-06 03:21:15,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:15,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:15,185 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:21:15,187 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:21:15,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:15,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:15,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:15,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:15,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:21:15,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:15,403 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 13 treesize of output 9 [2025-02-06 03:21:15,466 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 15 [2025-02-06 03:21:15,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 15 [2025-02-06 03:21:15,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 11 [2025-02-06 03:21:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:15,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:15,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579481233] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:15,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:21:15,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 12] total 22 [2025-02-06 03:21:15,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433627688] [2025-02-06 03:21:15,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:15,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:21:15,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:15,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:21:15,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:21:15,736 INFO L87 Difference]: Start difference. First operand 235 states and 331 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:16,115 INFO L93 Difference]: Finished difference Result 634 states and 895 transitions. [2025-02-06 03:21:16,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:21:16,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:16,118 INFO L225 Difference]: With dead ends: 634 [2025-02-06 03:21:16,118 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 03:21:16,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-02-06 03:21:16,119 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 148 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1511 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:16,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1511 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:16,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 03:21:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 248. [2025-02-06 03:21:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 220 states have (on average 1.3590909090909091) internal successors, (299), 221 states have internal predecessors, (299), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 349 transitions. [2025-02-06 03:21:16,139 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 349 transitions. Word has length 180 [2025-02-06 03:21:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:16,139 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 349 transitions. [2025-02-06 03:21:16,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 349 transitions. [2025-02-06 03:21:16,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:16,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:16,140 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:16,150 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:21:16,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:16,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:16,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1464413318, now seen corresponding path program 1 times [2025-02-06 03:21:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025015911] [2025-02-06 03:21:16,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:16,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:16,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:16,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:16,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:16,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:16,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:16,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025015911] [2025-02-06 03:21:16,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025015911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:16,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:16,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:21:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821783020] [2025-02-06 03:21:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:16,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:16,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:16,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:16,629 INFO L87 Difference]: Start difference. First operand 248 states and 349 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:16,989 INFO L93 Difference]: Finished difference Result 924 states and 1304 transitions. [2025-02-06 03:21:16,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:16,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:16,992 INFO L225 Difference]: With dead ends: 924 [2025-02-06 03:21:16,993 INFO L226 Difference]: Without dead ends: 679 [2025-02-06 03:21:16,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:16,994 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 409 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:16,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1162 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-02-06 03:21:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 311. [2025-02-06 03:21:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 284 states have internal predecessors, (392), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 442 transitions. [2025-02-06 03:21:17,014 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 442 transitions. Word has length 180 [2025-02-06 03:21:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:17,014 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 442 transitions. [2025-02-06 03:21:17,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 442 transitions. [2025-02-06 03:21:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:17,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:17,017 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:21:17,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:17,020 INFO L85 PathProgramCache]: Analyzing trace with hash -142504417, now seen corresponding path program 1 times [2025-02-06 03:21:17,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:17,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164820693] [2025-02-06 03:21:17,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:17,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:17,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:17,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:17,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:17,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:17,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164820693] [2025-02-06 03:21:17,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164820693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:17,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:17,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62467239] [2025-02-06 03:21:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:17,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:17,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:17,173 INFO L87 Difference]: Start difference. First operand 311 states and 442 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:17,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:17,424 INFO L93 Difference]: Finished difference Result 842 states and 1206 transitions. [2025-02-06 03:21:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:17,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:17,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:17,427 INFO L225 Difference]: With dead ends: 842 [2025-02-06 03:21:17,427 INFO L226 Difference]: Without dead ends: 534 [2025-02-06 03:21:17,428 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:21:17,428 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 160 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:17,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 535 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:17,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-06 03:21:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 297. [2025-02-06 03:21:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 269 states have (on average 1.3643122676579926) internal successors, (367), 270 states have internal predecessors, (367), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 417 transitions. [2025-02-06 03:21:17,441 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 417 transitions. Word has length 180 [2025-02-06 03:21:17,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:17,442 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 417 transitions. [2025-02-06 03:21:17,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 417 transitions. [2025-02-06 03:21:17,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:17,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:17,443 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:17,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:21:17,444 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1362703366, now seen corresponding path program 1 times [2025-02-06 03:21:17,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:17,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528690687] [2025-02-06 03:21:17,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:17,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:17,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:17,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:17,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:17,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:17,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528690687] [2025-02-06 03:21:17,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528690687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:17,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:17,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:21:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448977019] [2025-02-06 03:21:17,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:17,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:17,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:17,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:17,718 INFO L87 Difference]: Start difference. First operand 297 states and 417 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:18,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:18,091 INFO L93 Difference]: Finished difference Result 942 states and 1323 transitions. [2025-02-06 03:21:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:18,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:18,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:18,095 INFO L225 Difference]: With dead ends: 942 [2025-02-06 03:21:18,095 INFO L226 Difference]: Without dead ends: 648 [2025-02-06 03:21:18,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:18,097 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 402 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:18,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1178 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:18,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-02-06 03:21:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 305. [2025-02-06 03:21:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 425 transitions. [2025-02-06 03:21:18,114 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 425 transitions. Word has length 180 [2025-02-06 03:21:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:18,114 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 425 transitions. [2025-02-06 03:21:18,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 425 transitions. [2025-02-06 03:21:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-06 03:21:18,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:18,116 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:18,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:21:18,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:18,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:18,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1873237543, now seen corresponding path program 1 times [2025-02-06 03:21:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:18,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72799764] [2025-02-06 03:21:18,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:18,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-06 03:21:18,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-06 03:21:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:18,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:18,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:18,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72799764] [2025-02-06 03:21:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72799764] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:18,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:21:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675832651] [2025-02-06 03:21:18,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:18,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:21:18,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:18,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:21:18,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:18,351 INFO L87 Difference]: Start difference. First operand 305 states and 425 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:18,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:18,460 INFO L93 Difference]: Finished difference Result 870 states and 1226 transitions. [2025-02-06 03:21:18,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:18,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 180 [2025-02-06 03:21:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:18,463 INFO L225 Difference]: With dead ends: 870 [2025-02-06 03:21:18,463 INFO L226 Difference]: Without dead ends: 568 [2025-02-06 03:21:18,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:18,464 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 178 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:18,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 2243 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-02-06 03:21:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 305. [2025-02-06 03:21:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:18,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 425 transitions. [2025-02-06 03:21:18,487 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 425 transitions. Word has length 180 [2025-02-06 03:21:18,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:18,487 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 425 transitions. [2025-02-06 03:21:18,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:18,487 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 425 transitions. [2025-02-06 03:21:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 03:21:18,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:18,489 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:18,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:21:18,490 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:18,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:18,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1343091623, now seen corresponding path program 1 times [2025-02-06 03:21:18,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319209230] [2025-02-06 03:21:18,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:18,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:18,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 03:21:18,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 03:21:18,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:18,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:18,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:18,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319209230] [2025-02-06 03:21:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319209230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:18,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:18,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:18,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493373669] [2025-02-06 03:21:18,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:18,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:18,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:18,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:18,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:18,828 INFO L87 Difference]: Start difference. First operand 305 states and 425 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:19,234 INFO L93 Difference]: Finished difference Result 771 states and 1076 transitions. [2025-02-06 03:21:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-02-06 03:21:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:19,237 INFO L225 Difference]: With dead ends: 771 [2025-02-06 03:21:19,237 INFO L226 Difference]: Without dead ends: 469 [2025-02-06 03:21:19,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:19,238 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 306 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:19,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 728 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:19,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-02-06 03:21:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 302. [2025-02-06 03:21:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.354014598540146) internal successors, (371), 275 states have internal predecessors, (371), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 421 transitions. [2025-02-06 03:21:19,256 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 421 transitions. Word has length 181 [2025-02-06 03:21:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 421 transitions. [2025-02-06 03:21:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2025-02-06 03:21:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 03:21:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:19,258 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:21:19,258 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1677029317, now seen corresponding path program 1 times [2025-02-06 03:21:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284259493] [2025-02-06 03:21:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:19,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 03:21:19,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 03:21:19,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:19,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284259493] [2025-02-06 03:21:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284259493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487624407] [2025-02-06 03:21:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:19,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:19,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:19,572 INFO L87 Difference]: Start difference. First operand 302 states and 421 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:19,854 INFO L93 Difference]: Finished difference Result 719 states and 1005 transitions. [2025-02-06 03:21:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:19,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-02-06 03:21:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:19,856 INFO L225 Difference]: With dead ends: 719 [2025-02-06 03:21:19,856 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 03:21:19,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:19,857 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 306 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:19,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 489 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:19,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 03:21:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 302. [2025-02-06 03:21:19,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 275 states have internal predecessors, (370), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:19,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-02-06 03:21:19,870 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 181 [2025-02-06 03:21:19,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:19,870 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-02-06 03:21:19,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:19,870 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-02-06 03:21:19,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-06 03:21:19,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:19,871 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:19,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:21:19,872 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2107403802, now seen corresponding path program 1 times [2025-02-06 03:21:19,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:19,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465634482] [2025-02-06 03:21:19,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:19,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:19,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-06 03:21:19,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-06 03:21:19,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:19,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:20,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:20,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465634482] [2025-02-06 03:21:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465634482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:20,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:20,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:21:20,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861049055] [2025-02-06 03:21:20,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:20,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:21:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:20,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:21:20,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:20,184 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:20,466 INFO L93 Difference]: Finished difference Result 917 states and 1282 transitions. [2025-02-06 03:21:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:20,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 181 [2025-02-06 03:21:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:20,469 INFO L225 Difference]: With dead ends: 917 [2025-02-06 03:21:20,469 INFO L226 Difference]: Without dead ends: 618 [2025-02-06 03:21:20,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:20,471 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 329 mSDsluCounter, 2129 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:20,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 2573 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:20,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-02-06 03:21:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 306. [2025-02-06 03:21:20,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 278 states have (on average 1.3489208633093526) internal successors, (375), 279 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2025-02-06 03:21:20,486 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 181 [2025-02-06 03:21:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:20,487 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2025-02-06 03:21:20,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:20,487 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2025-02-06 03:21:20,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-06 03:21:20,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:20,488 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:21:20,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:20,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1864669431, now seen corresponding path program 1 times [2025-02-06 03:21:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915791184] [2025-02-06 03:21:20,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 03:21:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 03:21:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:20,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915791184] [2025-02-06 03:21:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915791184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:20,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:20,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:21:20,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465876020] [2025-02-06 03:21:20,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:20,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:21:20,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:20,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:21:20,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:21:20,541 INFO L87 Difference]: Start difference. First operand 306 states and 425 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:20,559 INFO L93 Difference]: Finished difference Result 610 states and 849 transitions. [2025-02-06 03:21:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:21:20,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 182 [2025-02-06 03:21:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:20,561 INFO L225 Difference]: With dead ends: 610 [2025-02-06 03:21:20,561 INFO L226 Difference]: Without dead ends: 307 [2025-02-06 03:21:20,561 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:21:20,563 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:20,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-06 03:21:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-02-06 03:21:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3476702508960574) internal successors, (376), 280 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:20,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2025-02-06 03:21:20,581 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 426 transitions. Word has length 182 [2025-02-06 03:21:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:20,582 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 426 transitions. [2025-02-06 03:21:20,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 426 transitions. [2025-02-06 03:21:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-06 03:21:20,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:20,585 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:21:20,585 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash -797493866, now seen corresponding path program 1 times [2025-02-06 03:21:20,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:20,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891309931] [2025-02-06 03:21:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:20,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-06 03:21:20,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-06 03:21:20,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:20,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:20,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891309931] [2025-02-06 03:21:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891309931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:20,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040212434] [2025-02-06 03:21:20,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:20,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:20,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:20,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:20,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:20,762 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:20,813 INFO L93 Difference]: Finished difference Result 531 states and 735 transitions. [2025-02-06 03:21:20,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:20,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 182 [2025-02-06 03:21:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:20,815 INFO L225 Difference]: With dead ends: 531 [2025-02-06 03:21:20,815 INFO L226 Difference]: Without dead ends: 227 [2025-02-06 03:21:20,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:20,818 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:20,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 656 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-02-06 03:21:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2025-02-06 03:21:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 199 states have internal predecessors, (260), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 310 transitions. [2025-02-06 03:21:20,829 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 310 transitions. Word has length 182 [2025-02-06 03:21:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:20,829 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 310 transitions. [2025-02-06 03:21:20,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 310 transitions. [2025-02-06 03:21:20,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-06 03:21:20,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:20,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:20,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 03:21:20,831 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:20,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:20,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2057496074, now seen corresponding path program 1 times [2025-02-06 03:21:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772754672] [2025-02-06 03:21:20,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:20,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-06 03:21:20,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-06 03:21:20,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:20,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772754672] [2025-02-06 03:21:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772754672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:21,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:21,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:21:21,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637542070] [2025-02-06 03:21:21,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:21,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:21:21,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:21,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:21:21,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:21:21,107 INFO L87 Difference]: Start difference. First operand 226 states and 310 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:21,231 INFO L93 Difference]: Finished difference Result 511 states and 704 transitions. [2025-02-06 03:21:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:21,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 183 [2025-02-06 03:21:21,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:21,233 INFO L225 Difference]: With dead ends: 511 [2025-02-06 03:21:21,233 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 03:21:21,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:21,235 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 163 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1460 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:21,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1460 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:21,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 03:21:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2025-02-06 03:21:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.303921568627451) internal successors, (266), 205 states have internal predecessors, (266), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-02-06 03:21:21,248 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 183 [2025-02-06 03:21:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:21,248 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-02-06 03:21:21,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-02-06 03:21:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:21,250 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:21:21,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2022915892, now seen corresponding path program 1 times [2025-02-06 03:21:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:21,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799201989] [2025-02-06 03:21:21,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:21,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:21,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:21,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:21,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799201989] [2025-02-06 03:21:21,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799201989] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:21,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:21,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 03:21:21,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405794509] [2025-02-06 03:21:21,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:21,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 03:21:21,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:21,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 03:21:21,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 03:21:21,305 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:21,321 INFO L93 Difference]: Finished difference Result 463 states and 633 transitions. [2025-02-06 03:21:21,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 03:21:21,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-02-06 03:21:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:21,323 INFO L225 Difference]: With dead ends: 463 [2025-02-06 03:21:21,323 INFO L226 Difference]: Without dead ends: 234 [2025-02-06 03:21:21,324 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:21:21,324 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:21,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 350 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:21,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-06 03:21:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-02-06 03:21:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 207 states have internal predecessors, (268), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:21,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2025-02-06 03:21:21,334 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 318 transitions. Word has length 185 [2025-02-06 03:21:21,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:21,335 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-02-06 03:21:21,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,335 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2025-02-06 03:21:21,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-06 03:21:21,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:21,336 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 03:21:21,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash -669606195, now seen corresponding path program 1 times [2025-02-06 03:21:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974664921] [2025-02-06 03:21:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:21,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-02-06 03:21:21,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-02-06 03:21:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:21,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:21,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974664921] [2025-02-06 03:21:21,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974664921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:21,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734595912] [2025-02-06 03:21:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:21,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:21,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:21,469 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:21,502 INFO L93 Difference]: Finished difference Result 455 states and 619 transitions. [2025-02-06 03:21:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 185 [2025-02-06 03:21:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:21,504 INFO L225 Difference]: With dead ends: 455 [2025-02-06 03:21:21,505 INFO L226 Difference]: Without dead ends: 224 [2025-02-06 03:21:21,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:21:21,506 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:21,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-06 03:21:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2025-02-06 03:21:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 194 states have (on average 1.288659793814433) internal successors, (250), 195 states have internal predecessors, (250), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 300 transitions. [2025-02-06 03:21:21,515 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 300 transitions. Word has length 185 [2025-02-06 03:21:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:21,516 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 300 transitions. [2025-02-06 03:21:21,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 300 transitions. [2025-02-06 03:21:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 03:21:21,517 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:21,517 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 03:21:21,517 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:21,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 532581411, now seen corresponding path program 1 times [2025-02-06 03:21:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607728693] [2025-02-06 03:21:21,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:21,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:21,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:21,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:21,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607728693] [2025-02-06 03:21:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607728693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:21,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:21:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348641776] [2025-02-06 03:21:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:21,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:21:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:21,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:21:21,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:21:21,582 INFO L87 Difference]: Start difference. First operand 222 states and 300 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:21,602 INFO L93 Difference]: Finished difference Result 447 states and 605 transitions. [2025-02-06 03:21:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:21:21,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-02-06 03:21:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:21,604 INFO L225 Difference]: With dead ends: 447 [2025-02-06 03:21:21,604 INFO L226 Difference]: Without dead ends: 228 [2025-02-06 03:21:21,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:21:21,604 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:21,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 502 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-02-06 03:21:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2025-02-06 03:21:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 198 states have (on average 1.2828282828282829) internal successors, (254), 199 states have internal predecessors, (254), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 304 transitions. [2025-02-06 03:21:21,618 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 304 transitions. Word has length 187 [2025-02-06 03:21:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:21,618 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 304 transitions. [2025-02-06 03:21:21,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:21,620 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 304 transitions. [2025-02-06 03:21:21,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 03:21:21,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:21,621 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:21,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 03:21:21,621 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:21,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:21,622 INFO L85 PathProgramCache]: Analyzing trace with hash 661664130, now seen corresponding path program 1 times [2025-02-06 03:21:21,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:21,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545375310] [2025-02-06 03:21:21,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:21,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:21,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 03:21:21,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 03:21:21,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:21,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:22,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545375310] [2025-02-06 03:21:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545375310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:22,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:22,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:22,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762940566] [2025-02-06 03:21:22,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:22,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:22,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:22,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:22,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:22,116 INFO L87 Difference]: Start difference. First operand 226 states and 304 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:22,423 INFO L93 Difference]: Finished difference Result 574 states and 772 transitions. [2025-02-06 03:21:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-02-06 03:21:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:22,426 INFO L225 Difference]: With dead ends: 574 [2025-02-06 03:21:22,426 INFO L226 Difference]: Without dead ends: 351 [2025-02-06 03:21:22,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:22,427 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 153 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:22,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1391 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-02-06 03:21:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 260. [2025-02-06 03:21:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 232 states have (on average 1.2629310344827587) internal successors, (293), 233 states have internal predecessors, (293), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-06 03:21:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2025-02-06 03:21:22,437 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 343 transitions. Word has length 187 [2025-02-06 03:21:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:22,437 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 343 transitions. [2025-02-06 03:21:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2025-02-06 03:21:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-06 03:21:22,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:22,438 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:22,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 03:21:22,439 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:22,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash 302419496, now seen corresponding path program 1 times [2025-02-06 03:21:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:22,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107178818] [2025-02-06 03:21:22,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:22,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:22,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-06 03:21:22,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-06 03:21:22,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:22,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107178818] [2025-02-06 03:21:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107178818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:22,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:22,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:22,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766800040] [2025-02-06 03:21:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:22,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:22,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:22,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:22,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:22,992 INFO L87 Difference]: Start difference. First operand 260 states and 343 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:23,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:23,178 INFO L93 Difference]: Finished difference Result 520 states and 684 transitions. [2025-02-06 03:21:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:23,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 188 [2025-02-06 03:21:23,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:23,188 INFO L225 Difference]: With dead ends: 520 [2025-02-06 03:21:23,188 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 03:21:23,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:23,190 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 143 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:23,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 737 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 03:21:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 221. [2025-02-06 03:21:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 195 states have (on average 1.241025641025641) internal successors, (242), 195 states have internal predecessors, (242), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:23,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 288 transitions. [2025-02-06 03:21:23,199 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 288 transitions. Word has length 188 [2025-02-06 03:21:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:23,199 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 288 transitions. [2025-02-06 03:21:23,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 288 transitions. [2025-02-06 03:21:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-06 03:21:23,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:23,200 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:23,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 03:21:23,200 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:23,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:23,201 INFO L85 PathProgramCache]: Analyzing trace with hash 112763781, now seen corresponding path program 1 times [2025-02-06 03:21:23,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:23,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734496487] [2025-02-06 03:21:23,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:23,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:23,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-06 03:21:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-06 03:21:23,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:23,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:23,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:23,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:23,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734496487] [2025-02-06 03:21:23,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734496487] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:23,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:23,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:23,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909911235] [2025-02-06 03:21:23,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:23,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:23,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:23,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:23,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:23,790 INFO L87 Difference]: Start difference. First operand 221 states and 288 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:23,972 INFO L93 Difference]: Finished difference Result 474 states and 617 transitions. [2025-02-06 03:21:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:23,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 189 [2025-02-06 03:21:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:23,973 INFO L225 Difference]: With dead ends: 474 [2025-02-06 03:21:23,973 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 03:21:23,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:23,974 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 62 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:23,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 753 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:23,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 03:21:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 221. [2025-02-06 03:21:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 195 states have (on average 1.235897435897436) internal successors, (241), 195 states have internal predecessors, (241), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2025-02-06 03:21:23,983 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 189 [2025-02-06 03:21:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2025-02-06 03:21:23,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2025-02-06 03:21:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:23,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:23,984 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:23,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 03:21:23,984 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:23,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:23,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1523945813, now seen corresponding path program 1 times [2025-02-06 03:21:23,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:23,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396694964] [2025-02-06 03:21:23,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:23,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:23,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:24,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:24,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:24,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:24,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396694964] [2025-02-06 03:21:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396694964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:21:24,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398766872] [2025-02-06 03:21:24,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:24,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:21:24,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:24,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:21:24,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:24,989 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:25,422 INFO L93 Difference]: Finished difference Result 506 states and 659 transitions. [2025-02-06 03:21:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:21:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:25,424 INFO L225 Difference]: With dead ends: 506 [2025-02-06 03:21:25,424 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 03:21:25,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:21:25,425 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 137 mSDsluCounter, 1486 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:25,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1701 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:21:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 03:21:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 234. [2025-02-06 03:21:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.2355769230769231) internal successors, (257), 208 states have internal predecessors, (257), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 303 transitions. [2025-02-06 03:21:25,434 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 303 transitions. Word has length 190 [2025-02-06 03:21:25,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:25,434 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 303 transitions. [2025-02-06 03:21:25,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:25,434 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 303 transitions. [2025-02-06 03:21:25,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:25,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:25,435 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:25,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 03:21:25,435 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:25,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash 439075595, now seen corresponding path program 1 times [2025-02-06 03:21:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:25,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984274707] [2025-02-06 03:21:25,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:25,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:25,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:25,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984274707] [2025-02-06 03:21:26,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984274707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:26,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:26,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:21:26,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337617835] [2025-02-06 03:21:26,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:26,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:21:26,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:26,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:21:26,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:26,357 INFO L87 Difference]: Start difference. First operand 234 states and 303 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:26,683 INFO L93 Difference]: Finished difference Result 507 states and 658 transitions. [2025-02-06 03:21:26,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:21:26,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:26,684 INFO L225 Difference]: With dead ends: 507 [2025-02-06 03:21:26,685 INFO L226 Difference]: Without dead ends: 276 [2025-02-06 03:21:26,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:21:26,685 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 152 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:26,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1227 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-06 03:21:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 246. [2025-02-06 03:21:26,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 220 states have (on average 1.2363636363636363) internal successors, (272), 220 states have internal predecessors, (272), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:21:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2025-02-06 03:21:26,698 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 190 [2025-02-06 03:21:26,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:26,698 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2025-02-06 03:21:26,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 11 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2025-02-06 03:21:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:26,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:26,699 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:26,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 03:21:26,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:26,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:26,700 INFO L85 PathProgramCache]: Analyzing trace with hash 568158314, now seen corresponding path program 1 times [2025-02-06 03:21:26,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:26,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497083313] [2025-02-06 03:21:26,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:26,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:26,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:26,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:26,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:26,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:27,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497083313] [2025-02-06 03:21:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497083313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081794568] [2025-02-06 03:21:27,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:27,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:27,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:27,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:27,232 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:27,483 INFO L93 Difference]: Finished difference Result 548 states and 708 transitions. [2025-02-06 03:21:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:27,484 INFO L225 Difference]: With dead ends: 548 [2025-02-06 03:21:27,484 INFO L226 Difference]: Without dead ends: 305 [2025-02-06 03:21:27,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:27,485 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 293 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:27,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 1233 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-06 03:21:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2025-02-06 03:21:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 265 states have (on average 1.2339622641509433) internal successors, (327), 266 states have internal predecessors, (327), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:21:27,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 385 transitions. [2025-02-06 03:21:27,497 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 385 transitions. Word has length 190 [2025-02-06 03:21:27,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:27,498 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 385 transitions. [2025-02-06 03:21:27,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:27,498 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 385 transitions. [2025-02-06 03:21:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:27,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:27,498 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:27,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 03:21:27,499 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2075710123, now seen corresponding path program 1 times [2025-02-06 03:21:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529829154] [2025-02-06 03:21:27,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:27,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:27,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:27,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:27,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:27,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:27,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529829154] [2025-02-06 03:21:27,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529829154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:27,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:27,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995328193] [2025-02-06 03:21:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:27,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:27,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:27,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:27,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:27,980 INFO L87 Difference]: Start difference. First operand 299 states and 385 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:28,147 INFO L93 Difference]: Finished difference Result 793 states and 1015 transitions. [2025-02-06 03:21:28,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:28,150 INFO L225 Difference]: With dead ends: 793 [2025-02-06 03:21:28,150 INFO L226 Difference]: Without dead ends: 497 [2025-02-06 03:21:28,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:28,151 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 143 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:28,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 663 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-06 03:21:28,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 483. [2025-02-06 03:21:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 437 states have (on average 1.2379862700228832) internal successors, (541), 440 states have internal predecessors, (541), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:21:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 615 transitions. [2025-02-06 03:21:28,171 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 615 transitions. Word has length 190 [2025-02-06 03:21:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 615 transitions. [2025-02-06 03:21:28,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:28,171 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 615 transitions. [2025-02-06 03:21:28,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:28,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:28,172 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:28,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 03:21:28,173 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:28,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:28,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1848337900, now seen corresponding path program 1 times [2025-02-06 03:21:28,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:28,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743318315] [2025-02-06 03:21:28,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:28,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:28,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:28,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743318315] [2025-02-06 03:21:28,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743318315] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:28,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:28,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:28,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801306838] [2025-02-06 03:21:28,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:28,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:28,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:28,733 INFO L87 Difference]: Start difference. First operand 483 states and 615 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:28,981 INFO L93 Difference]: Finished difference Result 976 states and 1240 transitions. [2025-02-06 03:21:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 03:21:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:28,985 INFO L225 Difference]: With dead ends: 976 [2025-02-06 03:21:28,985 INFO L226 Difference]: Without dead ends: 496 [2025-02-06 03:21:28,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:28,986 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:28,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1462 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:28,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-02-06 03:21:29,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 486. [2025-02-06 03:21:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 437 states have (on average 1.2265446224256293) internal successors, (536), 440 states have internal predecessors, (536), 39 states have call successors, (39), 9 states have call predecessors, (39), 9 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-02-06 03:21:29,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 614 transitions. [2025-02-06 03:21:29,005 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 614 transitions. Word has length 190 [2025-02-06 03:21:29,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:29,006 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 614 transitions. [2025-02-06 03:21:29,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:29,006 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 614 transitions. [2025-02-06 03:21:29,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:29,007 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:29,007 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 03:21:29,007 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:29,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:29,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2095183926, now seen corresponding path program 1 times [2025-02-06 03:21:29,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:29,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964327476] [2025-02-06 03:21:29,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:29,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:29,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:29,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:29,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964327476] [2025-02-06 03:21:29,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964327476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:29,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:29,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:21:29,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055558104] [2025-02-06 03:21:29,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:21:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:29,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:21:29,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:29,080 INFO L87 Difference]: Start difference. First operand 486 states and 614 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:29,112 INFO L93 Difference]: Finished difference Result 859 states and 1087 transitions. [2025-02-06 03:21:29,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:21:29,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 190 [2025-02-06 03:21:29,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:29,114 INFO L225 Difference]: With dead ends: 859 [2025-02-06 03:21:29,114 INFO L226 Difference]: Without dead ends: 376 [2025-02-06 03:21:29,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:21:29,115 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:29,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:21:29,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-06 03:21:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 328. [2025-02-06 03:21:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 293 states have (on average 1.2184300341296928) internal successors, (357), 294 states have internal predecessors, (357), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 03:21:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 415 transitions. [2025-02-06 03:21:29,130 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 415 transitions. Word has length 190 [2025-02-06 03:21:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:29,131 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 415 transitions. [2025-02-06 03:21:29,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:29,131 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 415 transitions. [2025-02-06 03:21:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-06 03:21:29,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:29,132 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 03:21:29,132 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:29,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1972411147, now seen corresponding path program 1 times [2025-02-06 03:21:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978298118] [2025-02-06 03:21:29,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:29,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:29,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-06 03:21:29,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-06 03:21:29,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:29,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:29,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:29,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:29,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978298118] [2025-02-06 03:21:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978298118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:29,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062097973] [2025-02-06 03:21:29,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:29,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:29,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:29,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:29,607 INFO L87 Difference]: Start difference. First operand 328 states and 415 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:29,791 INFO L93 Difference]: Finished difference Result 692 states and 874 transitions. [2025-02-06 03:21:29,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:29,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 190 [2025-02-06 03:21:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:29,793 INFO L225 Difference]: With dead ends: 692 [2025-02-06 03:21:29,793 INFO L226 Difference]: Without dead ends: 367 [2025-02-06 03:21:29,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:29,794 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 129 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:29,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 782 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-06 03:21:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2025-02-06 03:21:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 323 states have (on average 1.21671826625387) internal successors, (393), 325 states have internal predecessors, (393), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-06 03:21:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 459 transitions. [2025-02-06 03:21:29,811 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 459 transitions. Word has length 190 [2025-02-06 03:21:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:29,811 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 459 transitions. [2025-02-06 03:21:29,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 459 transitions. [2025-02-06 03:21:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 03:21:29,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:29,813 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:29,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 03:21:29,813 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1686158701, now seen corresponding path program 1 times [2025-02-06 03:21:29,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:29,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462148992] [2025-02-06 03:21:29,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:29,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:29,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 03:21:29,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 03:21:29,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:29,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:30,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:30,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462148992] [2025-02-06 03:21:30,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462148992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:30,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:30,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:21:30,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079154680] [2025-02-06 03:21:30,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:30,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:30,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:30,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:30,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:30,431 INFO L87 Difference]: Start difference. First operand 364 states and 459 transitions. Second operand has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:30,836 INFO L93 Difference]: Finished difference Result 978 states and 1242 transitions. [2025-02-06 03:21:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-02-06 03:21:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:30,839 INFO L225 Difference]: With dead ends: 978 [2025-02-06 03:21:30,839 INFO L226 Difference]: Without dead ends: 617 [2025-02-06 03:21:30,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:30,840 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 382 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:30,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1198 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-02-06 03:21:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 554. [2025-02-06 03:21:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 478 states have (on average 1.1924686192468619) internal successors, (570), 482 states have internal predecessors, (570), 62 states have call successors, (62), 13 states have call predecessors, (62), 13 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-02-06 03:21:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 694 transitions. [2025-02-06 03:21:30,864 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 694 transitions. Word has length 191 [2025-02-06 03:21:30,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:30,864 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 694 transitions. [2025-02-06 03:21:30,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.166666666666666) internal successors, (79), 7 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 694 transitions. [2025-02-06 03:21:30,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 03:21:30,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:30,865 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:30,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 03:21:30,866 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 807360159, now seen corresponding path program 1 times [2025-02-06 03:21:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515083424] [2025-02-06 03:21:30,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:30,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 03:21:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 03:21:30,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:30,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515083424] [2025-02-06 03:21:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515083424] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:21:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728081351] [2025-02-06 03:21:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:31,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:21:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:31,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:21:31,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:31,308 INFO L87 Difference]: Start difference. First operand 554 states and 694 transitions. Second operand has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:31,556 INFO L93 Difference]: Finished difference Result 1606 states and 2001 transitions. [2025-02-06 03:21:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:21:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-02-06 03:21:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:31,559 INFO L225 Difference]: With dead ends: 1606 [2025-02-06 03:21:31,559 INFO L226 Difference]: Without dead ends: 1055 [2025-02-06 03:21:31,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:31,562 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 149 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:31,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 859 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2025-02-06 03:21:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1046. [2025-02-06 03:21:31,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 917 states have (on average 1.1864776444929117) internal successors, (1088), 926 states have internal predecessors, (1088), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2025-02-06 03:21:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1292 transitions. [2025-02-06 03:21:31,611 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1292 transitions. Word has length 191 [2025-02-06 03:21:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:31,612 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1292 transitions. [2025-02-06 03:21:31,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.285714285714286) internal successors, (79), 9 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:31,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1292 transitions. [2025-02-06 03:21:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 03:21:31,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:31,613 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:31,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 03:21:31,614 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:31,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:31,614 INFO L85 PathProgramCache]: Analyzing trace with hash 610846654, now seen corresponding path program 1 times [2025-02-06 03:21:31,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:31,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623545571] [2025-02-06 03:21:31,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:31,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:31,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 03:21:31,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 03:21:31,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:31,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:31,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623545571] [2025-02-06 03:21:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623545571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:31,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:21:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469088339] [2025-02-06 03:21:31,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:31,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:21:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:31,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:21:31,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:31,921 INFO L87 Difference]: Start difference. First operand 1046 states and 1292 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:32,235 INFO L93 Difference]: Finished difference Result 2728 states and 3378 transitions. [2025-02-06 03:21:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 191 [2025-02-06 03:21:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:32,241 INFO L225 Difference]: With dead ends: 2728 [2025-02-06 03:21:32,241 INFO L226 Difference]: Without dead ends: 1685 [2025-02-06 03:21:32,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:21:32,243 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 146 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:32,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1304 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-02-06 03:21:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1366. [2025-02-06 03:21:32,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1221 states have (on average 1.1736281736281737) internal successors, (1433), 1231 states have internal predecessors, (1433), 114 states have call successors, (114), 30 states have call predecessors, (114), 30 states have return successors, (114), 104 states have call predecessors, (114), 114 states have call successors, (114) [2025-02-06 03:21:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1661 transitions. [2025-02-06 03:21:32,326 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1661 transitions. Word has length 191 [2025-02-06 03:21:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:32,327 INFO L471 AbstractCegarLoop]: Abstraction has 1366 states and 1661 transitions. [2025-02-06 03:21:32,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:32,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1661 transitions. [2025-02-06 03:21:32,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 03:21:32,328 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:32,328 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:32,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 03:21:32,329 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:32,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:32,329 INFO L85 PathProgramCache]: Analyzing trace with hash -825443840, now seen corresponding path program 1 times [2025-02-06 03:21:32,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:32,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420024830] [2025-02-06 03:21:32,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:32,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:32,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 03:21:32,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 03:21:32,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:32,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:33,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:33,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420024830] [2025-02-06 03:21:33,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420024830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:33,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:33,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:21:33,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492452372] [2025-02-06 03:21:33,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:33,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:21:33,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:33,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:21:33,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:33,047 INFO L87 Difference]: Start difference. First operand 1366 states and 1661 transitions. Second operand has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:33,523 INFO L93 Difference]: Finished difference Result 3146 states and 3819 transitions. [2025-02-06 03:21:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 03:21:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 191 [2025-02-06 03:21:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:33,528 INFO L225 Difference]: With dead ends: 3146 [2025-02-06 03:21:33,528 INFO L226 Difference]: Without dead ends: 1824 [2025-02-06 03:21:33,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-02-06 03:21:33,530 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 87 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:33,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1549 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:21:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2025-02-06 03:21:33,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1820. [2025-02-06 03:21:33,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1630 states have (on average 1.1717791411042944) internal successors, (1910), 1645 states have internal predecessors, (1910), 146 states have call successors, (146), 43 states have call predecessors, (146), 43 states have return successors, (146), 131 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-06 03:21:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2202 transitions. [2025-02-06 03:21:33,609 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2202 transitions. Word has length 191 [2025-02-06 03:21:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:33,609 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2202 transitions. [2025-02-06 03:21:33,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.777777777777779) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2202 transitions. [2025-02-06 03:21:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 03:21:33,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:33,611 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:33,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 03:21:33,612 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:33,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:33,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2026027138, now seen corresponding path program 1 times [2025-02-06 03:21:33,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:33,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525356376] [2025-02-06 03:21:33,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:33,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:33,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 03:21:33,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 03:21:33,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:33,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525356376] [2025-02-06 03:21:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525356376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:34,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876484244] [2025-02-06 03:21:34,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:34,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:34,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:34,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:34,135 INFO L87 Difference]: Start difference. First operand 1820 states and 2202 transitions. Second operand has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:34,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:34,401 INFO L93 Difference]: Finished difference Result 4509 states and 5438 transitions. [2025-02-06 03:21:34,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 191 [2025-02-06 03:21:34,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:34,418 INFO L225 Difference]: With dead ends: 4509 [2025-02-06 03:21:34,418 INFO L226 Difference]: Without dead ends: 2733 [2025-02-06 03:21:34,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:34,427 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 82 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:34,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 839 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2733 states. [2025-02-06 03:21:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2733 to 2724. [2025-02-06 03:21:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2724 states, 2439 states have (on average 1.1631816318163182) internal successors, (2837), 2464 states have internal predecessors, (2837), 214 states have call successors, (214), 70 states have call predecessors, (214), 70 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 03:21:34,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2724 states to 2724 states and 3265 transitions. [2025-02-06 03:21:34,597 INFO L78 Accepts]: Start accepts. Automaton has 2724 states and 3265 transitions. Word has length 191 [2025-02-06 03:21:34,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:34,597 INFO L471 AbstractCegarLoop]: Abstraction has 2724 states and 3265 transitions. [2025-02-06 03:21:34,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.8) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:34,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2724 states and 3265 transitions. [2025-02-06 03:21:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 03:21:34,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:34,600 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:34,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 03:21:34,600 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:34,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1812358288, now seen corresponding path program 1 times [2025-02-06 03:21:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:34,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551849741] [2025-02-06 03:21:34,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:34,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:34,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 03:21:34,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 03:21:34,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:34,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:35,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:35,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:35,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551849741] [2025-02-06 03:21:35,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551849741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:35,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:35,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:21:35,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152995345] [2025-02-06 03:21:35,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:35,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:21:35,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:35,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:21:35,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:35,642 INFO L87 Difference]: Start difference. First operand 2724 states and 3265 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:36,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:36,033 INFO L93 Difference]: Finished difference Result 5672 states and 6817 transitions. [2025-02-06 03:21:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:36,034 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 192 [2025-02-06 03:21:36,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:36,044 INFO L225 Difference]: With dead ends: 5672 [2025-02-06 03:21:36,045 INFO L226 Difference]: Without dead ends: 2996 [2025-02-06 03:21:36,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:21:36,048 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 59 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:36,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1496 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:36,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2025-02-06 03:21:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2628. [2025-02-06 03:21:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2628 states, 2343 states have (on average 1.1634656423388818) internal successors, (2726), 2368 states have internal predecessors, (2726), 214 states have call successors, (214), 70 states have call predecessors, (214), 70 states have return successors, (214), 189 states have call predecessors, (214), 214 states have call successors, (214) [2025-02-06 03:21:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2628 states to 2628 states and 3154 transitions. [2025-02-06 03:21:36,191 INFO L78 Accepts]: Start accepts. Automaton has 2628 states and 3154 transitions. Word has length 192 [2025-02-06 03:21:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:36,193 INFO L471 AbstractCegarLoop]: Abstraction has 2628 states and 3154 transitions. [2025-02-06 03:21:36,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2628 states and 3154 transitions. [2025-02-06 03:21:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 03:21:36,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:36,196 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:36,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 03:21:36,196 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash 35510168, now seen corresponding path program 1 times [2025-02-06 03:21:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287294511] [2025-02-06 03:21:36,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:36,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:36,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:36,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:36,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:36,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:36,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:36,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287294511] [2025-02-06 03:21:36,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287294511] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:36,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361997262] [2025-02-06 03:21:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:36,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:36,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:36,707 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:21:36,708 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:21:36,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:36,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:36,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:36,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:36,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 03:21:36,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:37,076 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 33 treesize of output 17 [2025-02-06 03:21:37,092 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 52 treesize of output 38 [2025-02-06 03:21:37,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2025-02-06 03:21:37,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2025-02-06 03:21:37,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:37,161 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 67 treesize of output 42 [2025-02-06 03:21:37,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:37,342 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 77 treesize of output 41 [2025-02-06 03:21:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 526 proven. 30 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-02-06 03:21:37,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:37,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361997262] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:37,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:37,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 17 [2025-02-06 03:21:37,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931579358] [2025-02-06 03:21:37,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:37,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 03:21:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:37,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 03:21:37,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-02-06 03:21:37,612 INFO L87 Difference]: Start difference. First operand 2628 states and 3154 transitions. Second operand has 17 states, 13 states have (on average 12.76923076923077) internal successors, (166), 17 states have internal predecessors, (166), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) [2025-02-06 03:21:38,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:38,453 INFO L93 Difference]: Finished difference Result 4882 states and 5828 transitions. [2025-02-06 03:21:38,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 03:21:38,454 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 12.76923076923077) internal successors, (166), 17 states have internal predecessors, (166), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) Word has length 193 [2025-02-06 03:21:38,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:38,461 INFO L225 Difference]: With dead ends: 4882 [2025-02-06 03:21:38,461 INFO L226 Difference]: Without dead ends: 2302 [2025-02-06 03:21:38,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 378 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 03:21:38,464 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 267 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:38,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 977 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:21:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2025-02-06 03:21:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2155. [2025-02-06 03:21:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1932 states have (on average 1.1557971014492754) internal successors, (2233), 1952 states have internal predecessors, (2233), 163 states have call successors, (163), 59 states have call predecessors, (163), 59 states have return successors, (163), 143 states have call predecessors, (163), 163 states have call successors, (163) [2025-02-06 03:21:38,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2559 transitions. [2025-02-06 03:21:38,591 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2559 transitions. Word has length 193 [2025-02-06 03:21:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:38,592 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2559 transitions. [2025-02-06 03:21:38,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 12.76923076923077) internal successors, (166), 17 states have internal predecessors, (166), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) [2025-02-06 03:21:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2559 transitions. [2025-02-06 03:21:38,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 03:21:38,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:38,594 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:38,603 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:21:38,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:38,795 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:38,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1177764226, now seen corresponding path program 1 times [2025-02-06 03:21:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738019448] [2025-02-06 03:21:38,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:38,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:38,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:38,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:38,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738019448] [2025-02-06 03:21:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738019448] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 03:21:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284394948] [2025-02-06 03:21:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 03:21:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 03:21:39,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:21:39,553 INFO L87 Difference]: Start difference. First operand 2155 states and 2559 transitions. Second operand has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:40,040 INFO L93 Difference]: Finished difference Result 4718 states and 5595 transitions. [2025-02-06 03:21:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:21:40,040 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2025-02-06 03:21:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:40,046 INFO L225 Difference]: With dead ends: 4718 [2025-02-06 03:21:40,046 INFO L226 Difference]: Without dead ends: 2611 [2025-02-06 03:21:40,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:40,049 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 78 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:40,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1700 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2025-02-06 03:21:40,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1950. [2025-02-06 03:21:40,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1950 states, 1775 states have (on average 1.1526760563380283) internal successors, (2046), 1790 states have internal predecessors, (2046), 127 states have call successors, (127), 47 states have call predecessors, (127), 47 states have return successors, (127), 112 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 03:21:40,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2300 transitions. [2025-02-06 03:21:40,143 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2300 transitions. Word has length 193 [2025-02-06 03:21:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:40,143 INFO L471 AbstractCegarLoop]: Abstraction has 1950 states and 2300 transitions. [2025-02-06 03:21:40,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.0) internal successors, (81), 11 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2300 transitions. [2025-02-06 03:21:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 03:21:40,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:40,145 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:40,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-06 03:21:40,146 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:40,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1110333440, now seen corresponding path program 1 times [2025-02-06 03:21:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:40,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412521093] [2025-02-06 03:21:40,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:40,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:40,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:40,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:40,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:40,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:40,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:40,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412521093] [2025-02-06 03:21:40,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412521093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:40,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:40,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:21:40,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046625912] [2025-02-06 03:21:40,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:40,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:21:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:40,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:21:40,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:40,558 INFO L87 Difference]: Start difference. First operand 1950 states and 2300 transitions. Second operand has 7 states, 5 states have (on average 16.2) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:40,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:40,837 INFO L93 Difference]: Finished difference Result 3824 states and 4510 transitions. [2025-02-06 03:21:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:21:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.2) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2025-02-06 03:21:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:40,843 INFO L225 Difference]: With dead ends: 3824 [2025-02-06 03:21:40,843 INFO L226 Difference]: Without dead ends: 1922 [2025-02-06 03:21:40,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 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:21:40,845 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 76 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:40,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 841 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:21:40,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2025-02-06 03:21:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1700. [2025-02-06 03:21:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1527 states have (on average 1.1512770137524557) internal successors, (1758), 1542 states have internal predecessors, (1758), 125 states have call successors, (125), 47 states have call predecessors, (125), 47 states have return successors, (125), 110 states have call predecessors, (125), 125 states have call successors, (125) [2025-02-06 03:21:40,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2008 transitions. [2025-02-06 03:21:40,948 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2008 transitions. Word has length 193 [2025-02-06 03:21:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:40,948 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2008 transitions. [2025-02-06 03:21:40,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.2) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2025-02-06 03:21:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2008 transitions. [2025-02-06 03:21:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 03:21:40,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:40,951 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:40,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-06 03:21:40,952 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:40,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1555152550, now seen corresponding path program 1 times [2025-02-06 03:21:40,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:40,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349199045] [2025-02-06 03:21:40,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:40,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:41,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:41,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:41,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:41,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:41,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349199045] [2025-02-06 03:21:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349199045] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:41,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130300203] [2025-02-06 03:21:41,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:41,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:41,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:41,542 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:21:41,543 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:21:41,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:41,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:41,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:41,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:41,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 03:21:41,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:41,766 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 33 treesize of output 17 [2025-02-06 03:21:41,786 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 33 treesize of output 17 [2025-02-06 03:21:41,900 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 27 treesize of output 26 [2025-02-06 03:21:41,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:41,945 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 36 treesize of output 38 [2025-02-06 03:21:41,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:41,980 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 51 treesize of output 41 [2025-02-06 03:21:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-02-06 03:21:42,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:42,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:42,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130300203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:42,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:42,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 28 [2025-02-06 03:21:42,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983762626] [2025-02-06 03:21:42,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:42,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 03:21:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:42,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 03:21:42,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-02-06 03:21:42,544 INFO L87 Difference]: Start difference. First operand 1700 states and 2008 transitions. Second operand has 28 states, 25 states have (on average 7.12) internal successors, (178), 28 states have internal predecessors, (178), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:21:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:44,726 INFO L93 Difference]: Finished difference Result 4605 states and 5398 transitions. [2025-02-06 03:21:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 03:21:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.12) internal successors, (178), 28 states have internal predecessors, (178), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) Word has length 193 [2025-02-06 03:21:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:44,734 INFO L225 Difference]: With dead ends: 4605 [2025-02-06 03:21:44,734 INFO L226 Difference]: Without dead ends: 2945 [2025-02-06 03:21:44,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 373 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2025-02-06 03:21:44,737 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1377 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 2742 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 2742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:44,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 1583 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 2742 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-06 03:21:44,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2025-02-06 03:21:44,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 1601. [2025-02-06 03:21:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1451 states have (on average 1.146106133700896) internal successors, (1663), 1463 states have internal predecessors, (1663), 105 states have call successors, (105), 44 states have call predecessors, (105), 44 states have return successors, (105), 93 states have call predecessors, (105), 105 states have call successors, (105) [2025-02-06 03:21:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 1873 transitions. [2025-02-06 03:21:44,832 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 1873 transitions. Word has length 193 [2025-02-06 03:21:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:44,832 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 1873 transitions. [2025-02-06 03:21:44,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.12) internal successors, (178), 28 states have internal predecessors, (178), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:21:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1873 transitions. [2025-02-06 03:21:44,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 03:21:44,834 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:44,834 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:44,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:21:45,034 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,SelfDestructingSolverStorable39 [2025-02-06 03:21:45,034 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:45,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:45,035 INFO L85 PathProgramCache]: Analyzing trace with hash -345975210, now seen corresponding path program 1 times [2025-02-06 03:21:45,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:45,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191558001] [2025-02-06 03:21:45,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:45,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:45,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:45,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:45,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:45,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191558001] [2025-02-06 03:21:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191558001] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340842474] [2025-02-06 03:21:45,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:45,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:45,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:45,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:21:45,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:21:45,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 03:21:45,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 03:21:45,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:45,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:45,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 03:21:45,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:45,637 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 33 treesize of output 17 [2025-02-06 03:21:45,743 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 33 treesize of output 17 [2025-02-06 03:21:45,764 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 52 treesize of output 38 [2025-02-06 03:21:45,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 64 [2025-02-06 03:21:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2025-02-06 03:21:45,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:45,821 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 67 treesize of output 42 [2025-02-06 03:21:45,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:45,948 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 77 treesize of output 41 [2025-02-06 03:21:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 522 proven. 36 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-02-06 03:21:45,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:46,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340842474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:46,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:46,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2025-02-06 03:21:46,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562059115] [2025-02-06 03:21:46,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:46,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:21:46,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:46,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:21:46,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:46,184 INFO L87 Difference]: Start difference. First operand 1601 states and 1873 transitions. Second operand has 15 states, 11 states have (on average 14.727272727272727) internal successors, (162), 15 states have internal predecessors, (162), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) [2025-02-06 03:21:46,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:46,852 INFO L93 Difference]: Finished difference Result 2257 states and 2633 transitions. [2025-02-06 03:21:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 03:21:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 14.727272727272727) internal successors, (162), 15 states have internal predecessors, (162), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) Word has length 193 [2025-02-06 03:21:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:46,857 INFO L225 Difference]: With dead ends: 2257 [2025-02-06 03:21:46,857 INFO L226 Difference]: Without dead ends: 659 [2025-02-06 03:21:46,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 378 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2025-02-06 03:21:46,860 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 239 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:46,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 691 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 03:21:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-06 03:21:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 569. [2025-02-06 03:21:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 490 states have (on average 1.1326530612244898) internal successors, (555), 495 states have internal predecessors, (555), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 03:21:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 665 transitions. [2025-02-06 03:21:46,941 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 665 transitions. Word has length 193 [2025-02-06 03:21:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:46,941 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 665 transitions. [2025-02-06 03:21:46,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 14.727272727272727) internal successors, (162), 15 states have internal predecessors, (162), 7 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (48), 3 states have call predecessors, (48), 7 states have call successors, (48) [2025-02-06 03:21:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 665 transitions. [2025-02-06 03:21:46,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 03:21:46,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:46,942 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:47,143 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2037742948, now seen corresponding path program 1 times [2025-02-06 03:21:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968190171] [2025-02-06 03:21:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:47,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 03:21:47,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 03:21:47,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:47,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:47,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:47,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968190171] [2025-02-06 03:21:47,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968190171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:47,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:47,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:47,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017338722] [2025-02-06 03:21:47,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:47,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:47,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:47,461 INFO L87 Difference]: Start difference. First operand 569 states and 665 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:47,631 INFO L93 Difference]: Finished difference Result 1366 states and 1581 transitions. [2025-02-06 03:21:47,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:47,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 195 [2025-02-06 03:21:47,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:47,634 INFO L225 Difference]: With dead ends: 1366 [2025-02-06 03:21:47,634 INFO L226 Difference]: Without dead ends: 569 [2025-02-06 03:21:47,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:47,635 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 17 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:47,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 654 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-02-06 03:21:47,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2025-02-06 03:21:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 490 states have (on average 1.1244897959183673) internal successors, (551), 495 states have internal predecessors, (551), 55 states have call successors, (55), 23 states have call predecessors, (55), 23 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 03:21:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 661 transitions. [2025-02-06 03:21:47,686 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 661 transitions. Word has length 195 [2025-02-06 03:21:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:47,686 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 661 transitions. [2025-02-06 03:21:47,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:47,686 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 661 transitions. [2025-02-06 03:21:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 03:21:47,687 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:47,687 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:47,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-06 03:21:47,687 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:47,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:47,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1350400286, now seen corresponding path program 1 times [2025-02-06 03:21:47,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:47,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875786892] [2025-02-06 03:21:47,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:47,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:47,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:21:47,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:21:47,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:47,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:48,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:48,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875786892] [2025-02-06 03:21:48,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875786892] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:48,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431373574] [2025-02-06 03:21:48,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:48,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:48,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:21:48,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:21:48,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:21:48,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:21:48,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:48,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:48,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-06 03:21:48,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:48,397 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:21:48,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:48,697 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 88 treesize of output 40 [2025-02-06 03:21:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:48,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:49,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431373574] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:49,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:21:49,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [8, 11] total 18 [2025-02-06 03:21:49,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179415863] [2025-02-06 03:21:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:49,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:21:49,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:49,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:21:49,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-02-06 03:21:49,100 INFO L87 Difference]: Start difference. First operand 569 states and 661 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:49,432 INFO L93 Difference]: Finished difference Result 1669 states and 1936 transitions. [2025-02-06 03:21:49,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:21:49,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 197 [2025-02-06 03:21:49,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:49,436 INFO L225 Difference]: With dead ends: 1669 [2025-02-06 03:21:49,436 INFO L226 Difference]: Without dead ends: 1103 [2025-02-06 03:21:49,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:21:49,437 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 95 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:49,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1486 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2025-02-06 03:21:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1100. [2025-02-06 03:21:49,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1100 states, 950 states have (on average 1.12) internal successors, (1064), 961 states have internal predecessors, (1064), 103 states have call successors, (103), 46 states have call predecessors, (103), 46 states have return successors, (103), 92 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-06 03:21:49,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1270 transitions. [2025-02-06 03:21:49,540 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1270 transitions. Word has length 197 [2025-02-06 03:21:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:49,540 INFO L471 AbstractCegarLoop]: Abstraction has 1100 states and 1270 transitions. [2025-02-06 03:21:49,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:49,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1270 transitions. [2025-02-06 03:21:49,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 03:21:49,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:49,542 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:49,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:21:49,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-02-06 03:21:49,742 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:49,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:49,743 INFO L85 PathProgramCache]: Analyzing trace with hash -457054177, now seen corresponding path program 1 times [2025-02-06 03:21:49,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:49,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969744423] [2025-02-06 03:21:49,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:49,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:49,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:21:49,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:21:49,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:49,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:49,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:49,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969744423] [2025-02-06 03:21:49,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969744423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972398972] [2025-02-06 03:21:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:49,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:49,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:49,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:49,928 INFO L87 Difference]: Start difference. First operand 1100 states and 1270 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:50,112 INFO L93 Difference]: Finished difference Result 2249 states and 2588 transitions. [2025-02-06 03:21:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:50,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-02-06 03:21:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:50,116 INFO L225 Difference]: With dead ends: 2249 [2025-02-06 03:21:50,116 INFO L226 Difference]: Without dead ends: 1152 [2025-02-06 03:21:50,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:50,118 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 89 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:50,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 701 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-02-06 03:21:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1076. [2025-02-06 03:21:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 926 states have (on average 1.1101511879049677) internal successors, (1028), 937 states have internal predecessors, (1028), 103 states have call successors, (103), 46 states have call predecessors, (103), 46 states have return successors, (103), 92 states have call predecessors, (103), 103 states have call successors, (103) [2025-02-06 03:21:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1234 transitions. [2025-02-06 03:21:50,216 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1234 transitions. Word has length 197 [2025-02-06 03:21:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:50,216 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1234 transitions. [2025-02-06 03:21:50,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:50,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1234 transitions. [2025-02-06 03:21:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 03:21:50,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:50,217 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:50,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-02-06 03:21:50,218 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -585260001, now seen corresponding path program 1 times [2025-02-06 03:21:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449981072] [2025-02-06 03:21:50,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:50,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:50,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:21:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:21:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:50,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:50,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449981072] [2025-02-06 03:21:50,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449981072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:50,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:50,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172097268] [2025-02-06 03:21:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:50,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:50,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:50,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:50,405 INFO L87 Difference]: Start difference. First operand 1076 states and 1234 transitions. Second operand has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:50,587 INFO L93 Difference]: Finished difference Result 2156 states and 2470 transitions. [2025-02-06 03:21:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:50,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 197 [2025-02-06 03:21:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:50,590 INFO L225 Difference]: With dead ends: 2156 [2025-02-06 03:21:50,590 INFO L226 Difference]: Without dead ends: 1083 [2025-02-06 03:21:50,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:50,592 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 88 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:50,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1103 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-02-06 03:21:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 838. [2025-02-06 03:21:50,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 758 states have (on average 1.1029023746701847) internal successors, (836), 763 states have internal predecessors, (836), 55 states have call successors, (55), 24 states have call predecessors, (55), 24 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 03:21:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 946 transitions. [2025-02-06 03:21:50,652 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 946 transitions. Word has length 197 [2025-02-06 03:21:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:50,652 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 946 transitions. [2025-02-06 03:21:50,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.0) internal successors, (85), 6 states have internal predecessors, (85), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 946 transitions. [2025-02-06 03:21:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 03:21:50,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:50,653 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:50,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-02-06 03:21:50,653 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:50,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:50,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1902252832, now seen corresponding path program 1 times [2025-02-06 03:21:50,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029587760] [2025-02-06 03:21:50,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:50,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 03:21:50,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 03:21:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:51,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:51,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029587760] [2025-02-06 03:21:51,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029587760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:51,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:51,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 03:21:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638025123] [2025-02-06 03:21:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:51,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 03:21:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:51,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 03:21:51,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:21:51,047 INFO L87 Difference]: Start difference. First operand 838 states and 946 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:51,356 INFO L93 Difference]: Finished difference Result 1986 states and 2258 transitions. [2025-02-06 03:21:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:51,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 197 [2025-02-06 03:21:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:51,359 INFO L225 Difference]: With dead ends: 1986 [2025-02-06 03:21:51,359 INFO L226 Difference]: Without dead ends: 1151 [2025-02-06 03:21:51,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:51,361 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 130 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2256 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:51,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2256 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-02-06 03:21:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 814. [2025-02-06 03:21:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 734 states have (on average 1.098092643051771) internal successors, (806), 739 states have internal predecessors, (806), 55 states have call successors, (55), 24 states have call predecessors, (55), 24 states have return successors, (55), 50 states have call predecessors, (55), 55 states have call successors, (55) [2025-02-06 03:21:51,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 916 transitions. [2025-02-06 03:21:51,422 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 916 transitions. Word has length 197 [2025-02-06 03:21:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:51,423 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 916 transitions. [2025-02-06 03:21:51,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 916 transitions. [2025-02-06 03:21:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-06 03:21:51,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:51,424 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:51,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-02-06 03:21:51,424 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:51,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:51,424 INFO L85 PathProgramCache]: Analyzing trace with hash -57331048, now seen corresponding path program 1 times [2025-02-06 03:21:51,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:51,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361853175] [2025-02-06 03:21:51,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:51,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:51,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 03:21:51,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 03:21:51,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:51,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:51,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361853175] [2025-02-06 03:21:51,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361853175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:51,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646319613] [2025-02-06 03:21:51,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:51,895 INFO L229 MonitoredProcess]: Starting monitored process 8 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:21:51,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:21:52,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-06 03:21:52,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-06 03:21:52,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:52,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:52,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:21:52,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:52,166 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:21:52,183 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:21:52,200 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:21:52,224 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:21:52,243 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:21:52,341 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:21:52,350 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 50 treesize of output 36 [2025-02-06 03:21:52,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-02-06 03:21:52,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2025-02-06 03:21:52,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:52,413 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 63 treesize of output 38 [2025-02-06 03:21:52,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:52,505 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 73 treesize of output 37 [2025-02-06 03:21:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-02-06 03:21:52,514 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646319613] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:52,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:52,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2025-02-06 03:21:52,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236991823] [2025-02-06 03:21:52,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:52,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:21:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:52,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:21:52,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:52,764 INFO L87 Difference]: Start difference. First operand 814 states and 916 transitions. Second operand has 15 states, 12 states have (on average 14.916666666666666) internal successors, (179), 15 states have internal predecessors, (179), 7 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (66), 4 states have call predecessors, (66), 7 states have call successors, (66) [2025-02-06 03:21:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:53,298 INFO L93 Difference]: Finished difference Result 1537 states and 1724 transitions. [2025-02-06 03:21:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:21:53,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 14.916666666666666) internal successors, (179), 15 states have internal predecessors, (179), 7 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (66), 4 states have call predecessors, (66), 7 states have call successors, (66) Word has length 199 [2025-02-06 03:21:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:53,301 INFO L225 Difference]: With dead ends: 1537 [2025-02-06 03:21:53,301 INFO L226 Difference]: Without dead ends: 726 [2025-02-06 03:21:53,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 389 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:21:53,302 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 235 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:53,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 463 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:53,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-02-06 03:21:53,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 502. [2025-02-06 03:21:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 447 states have (on average 1.1051454138702461) internal successors, (494), 449 states have internal predecessors, (494), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:21:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 568 transitions. [2025-02-06 03:21:53,347 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 568 transitions. Word has length 199 [2025-02-06 03:21:53,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:53,347 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 568 transitions. [2025-02-06 03:21:53,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 14.916666666666666) internal successors, (179), 15 states have internal predecessors, (179), 7 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (66), 4 states have call predecessors, (66), 7 states have call successors, (66) [2025-02-06 03:21:53,347 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 568 transitions. [2025-02-06 03:21:53,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-02-06 03:21:53,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:53,348 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:53,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:21:53,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:53,548 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:53,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1696053157, now seen corresponding path program 1 times [2025-02-06 03:21:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:53,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057156743] [2025-02-06 03:21:53,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:53,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:53,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-02-06 03:21:53,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-02-06 03:21:53,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:53,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:53,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:53,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057156743] [2025-02-06 03:21:53,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057156743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:53,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:53,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 03:21:53,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51672709] [2025-02-06 03:21:53,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:53,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 03:21:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:53,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 03:21:53,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:21:53,989 INFO L87 Difference]: Start difference. First operand 502 states and 568 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:54,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:54,395 INFO L93 Difference]: Finished difference Result 895 states and 1015 transitions. [2025-02-06 03:21:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 03:21:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 202 [2025-02-06 03:21:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:54,398 INFO L225 Difference]: With dead ends: 895 [2025-02-06 03:21:54,398 INFO L226 Difference]: Without dead ends: 893 [2025-02-06 03:21:54,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:21:54,398 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 113 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:54,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1531 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:21:54,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-02-06 03:21:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 667. [2025-02-06 03:21:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 612 states have (on average 1.091503267973856) internal successors, (668), 614 states have internal predecessors, (668), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:21:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 742 transitions. [2025-02-06 03:21:54,445 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 742 transitions. Word has length 202 [2025-02-06 03:21:54,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:54,445 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 742 transitions. [2025-02-06 03:21:54,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:21:54,445 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 742 transitions. [2025-02-06 03:21:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:21:54,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:54,446 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-02-06 03:21:54,446 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2105223264, now seen corresponding path program 1 times [2025-02-06 03:21:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022506297] [2025-02-06 03:21:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:54,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:21:54,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:21:54,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:55,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:55,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022506297] [2025-02-06 03:21:55,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022506297] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:55,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875801803] [2025-02-06 03:21:55,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:55,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:55,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:55,187 INFO L229 MonitoredProcess]: Starting monitored process 9 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:21:55,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:21:55,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:21:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:21:55,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:55,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:55,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 03:21:55,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:55,460 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 13 [2025-02-06 03:21:55,477 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 13 [2025-02-06 03:21:55,494 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 13 [2025-02-06 03:21:55,510 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 13 [2025-02-06 03:21:55,528 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 13 [2025-02-06 03:21:55,547 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 13 [2025-02-06 03:21:55,646 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 13 [2025-02-06 03:21:55,657 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 48 treesize of output 34 [2025-02-06 03:21:55,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 58 [2025-02-06 03:21:55,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-02-06 03:21:55,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:55,712 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 57 treesize of output 45 [2025-02-06 03:21:55,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:55,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 62 treesize of output 26 [2025-02-06 03:21:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-06 03:21:55,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875801803] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:55,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 15 [2025-02-06 03:21:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153988831] [2025-02-06 03:21:55,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:21:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:55,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:21:55,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:21:55,969 INFO L87 Difference]: Start difference. First operand 667 states and 742 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:21:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:56,803 INFO L93 Difference]: Finished difference Result 1814 states and 2024 transitions. [2025-02-06 03:21:56,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 03:21:56,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) Word has length 204 [2025-02-06 03:21:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:56,806 INFO L225 Difference]: With dead ends: 1814 [2025-02-06 03:21:56,806 INFO L226 Difference]: Without dead ends: 1150 [2025-02-06 03:21:56,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 404 SyntacticMatches, 12 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=1036, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 03:21:56,807 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 340 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:56,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 737 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:21:56,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-02-06 03:21:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 667. [2025-02-06 03:21:56,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 612 states have (on average 1.091503267973856) internal successors, (668), 614 states have internal predecessors, (668), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:21:56,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 742 transitions. [2025-02-06 03:21:56,855 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 742 transitions. Word has length 204 [2025-02-06 03:21:56,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:56,855 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 742 transitions. [2025-02-06 03:21:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:21:56,855 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 742 transitions. [2025-02-06 03:21:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:21:56,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:56,856 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:56,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 03:21:57,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-02-06 03:21:57,057 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1981150017, now seen corresponding path program 1 times [2025-02-06 03:21:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561668304] [2025-02-06 03:21:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:21:57,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:21:57,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:57,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:57,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:21:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:57,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561668304] [2025-02-06 03:21:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561668304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:21:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:21:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:21:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797193028] [2025-02-06 03:21:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:21:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:21:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:57,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:21:57,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:21:57,587 INFO L87 Difference]: Start difference. First operand 667 states and 742 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:21:57,750 INFO L93 Difference]: Finished difference Result 1183 states and 1318 transitions. [2025-02-06 03:21:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:21:57,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 204 [2025-02-06 03:21:57,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:21:57,753 INFO L225 Difference]: With dead ends: 1183 [2025-02-06 03:21:57,753 INFO L226 Difference]: Without dead ends: 519 [2025-02-06 03:21:57,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:21:57,754 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 71 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:21:57,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 591 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:21:57,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-02-06 03:21:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 517. [2025-02-06 03:21:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 462 states have (on average 1.0822510822510822) internal successors, (500), 464 states have internal predecessors, (500), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:21:57,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 574 transitions. [2025-02-06 03:21:57,799 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 574 transitions. Word has length 204 [2025-02-06 03:21:57,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:21:57,799 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 574 transitions. [2025-02-06 03:21:57,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 03:21:57,799 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 574 transitions. [2025-02-06 03:21:57,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:21:57,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:21:57,800 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:57,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-02-06 03:21:57,800 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:21:57,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:21:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2021177091, now seen corresponding path program 1 times [2025-02-06 03:21:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:21:57,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434708519] [2025-02-06 03:21:57,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:21:57,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:21:57,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:21:57,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:57,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:21:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434708519] [2025-02-06 03:21:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434708519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:21:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344762664] [2025-02-06 03:21:58,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:21:58,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:21:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:21:58,623 INFO L229 MonitoredProcess]: Starting monitored process 10 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:21:58,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 03:21:58,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:21:58,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:21:58,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:21:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:21:58,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 03:21:58,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:21:58,891 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 13 [2025-02-06 03:21:58,911 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 13 [2025-02-06 03:21:58,931 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 13 [2025-02-06 03:21:58,948 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 13 [2025-02-06 03:21:58,964 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 13 [2025-02-06 03:21:58,984 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 13 [2025-02-06 03:21:59,089 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 23 treesize of output 22 [2025-02-06 03:21:59,110 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 57 treesize of output 41 [2025-02-06 03:21:59,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:59,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 75 [2025-02-06 03:21:59,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2025-02-06 03:21:59,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:21:59,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 69 [2025-02-06 03:21:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-02-06 03:21:59,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:21:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:21:59,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344762664] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:21:59,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:21:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 23 [2025-02-06 03:21:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391363985] [2025-02-06 03:21:59,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:21:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 03:21:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:21:59,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 03:21:59,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-02-06 03:21:59,509 INFO L87 Difference]: Start difference. First operand 517 states and 574 transitions. Second operand has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (68), 4 states have call predecessors, (68), 7 states have call successors, (68) [2025-02-06 03:22:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:00,423 INFO L93 Difference]: Finished difference Result 1205 states and 1335 transitions. [2025-02-06 03:22:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 03:22:00,423 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (68), 4 states have call predecessors, (68), 7 states have call successors, (68) Word has length 204 [2025-02-06 03:22:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:00,426 INFO L225 Difference]: With dead ends: 1205 [2025-02-06 03:22:00,426 INFO L226 Difference]: Without dead ends: 691 [2025-02-06 03:22:00,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 401 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=376, Invalid=1604, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 03:22:00,427 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 870 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:00,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 835 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:22:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-02-06 03:22:00,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 511. [2025-02-06 03:22:00,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 456 states have (on average 1.0789473684210527) internal successors, (492), 458 states have internal predecessors, (492), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:22:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 566 transitions. [2025-02-06 03:22:00,475 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 566 transitions. Word has length 204 [2025-02-06 03:22:00,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:00,475 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 566 transitions. [2025-02-06 03:22:00,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.3) internal successors, (166), 23 states have internal predecessors, (166), 7 states have call successors, (68), 2 states have call predecessors, (68), 4 states have return successors, (68), 4 states have call predecessors, (68), 7 states have call successors, (68) [2025-02-06 03:22:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 566 transitions. [2025-02-06 03:22:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:22:00,476 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:00,476 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:00,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 03:22:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:00,676 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:00,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -229831331, now seen corresponding path program 1 times [2025-02-06 03:22:00,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:00,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011900982] [2025-02-06 03:22:00,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:00,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:00,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:00,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:00,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:22:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:01,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011900982] [2025-02-06 03:22:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011900982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 03:22:01,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661551644] [2025-02-06 03:22:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:01,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 03:22:01,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:01,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 03:22:01,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-02-06 03:22:01,207 INFO L87 Difference]: Start difference. First operand 511 states and 566 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:22:01,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:01,864 INFO L93 Difference]: Finished difference Result 627 states and 696 transitions. [2025-02-06 03:22:01,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 03:22:01,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 204 [2025-02-06 03:22:01,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:01,867 INFO L225 Difference]: With dead ends: 627 [2025-02-06 03:22:01,867 INFO L226 Difference]: Without dead ends: 625 [2025-02-06 03:22:01,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-02-06 03:22:01,867 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 158 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:01,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 2159 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:22:01,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-02-06 03:22:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 512. [2025-02-06 03:22:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 457 states have (on average 1.0787746170678336) internal successors, (493), 459 states have internal predecessors, (493), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:22:01,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 567 transitions. [2025-02-06 03:22:01,916 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 567 transitions. Word has length 204 [2025-02-06 03:22:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:01,917 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 567 transitions. [2025-02-06 03:22:01,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 15 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:22:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 567 transitions. [2025-02-06 03:22:01,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:22:01,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:01,918 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:01,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-02-06 03:22:01,918 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:01,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:01,918 INFO L85 PathProgramCache]: Analyzing trace with hash 657672350, now seen corresponding path program 1 times [2025-02-06 03:22:01,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:01,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988590708] [2025-02-06 03:22:01,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:01,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:01,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:01,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:01,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:01,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:02,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 03:22:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:02,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988590708] [2025-02-06 03:22:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988590708] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:22:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:22:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:22:02,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334258224] [2025-02-06 03:22:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:22:02,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:22:02,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:02,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:22:02,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:22:02,085 INFO L87 Difference]: Start difference. First operand 512 states and 567 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:22:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:02,234 INFO L93 Difference]: Finished difference Result 1018 states and 1126 transitions. [2025-02-06 03:22:02,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:22:02,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 204 [2025-02-06 03:22:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:02,237 INFO L225 Difference]: With dead ends: 1018 [2025-02-06 03:22:02,237 INFO L226 Difference]: Without dead ends: 509 [2025-02-06 03:22:02,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:22:02,237 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 30 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:02,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 522 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:22:02,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-02-06 03:22:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2025-02-06 03:22:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 452 states have (on average 1.073008849557522) internal successors, (485), 454 states have internal predecessors, (485), 37 states have call successors, (37), 17 states have call predecessors, (37), 17 states have return successors, (37), 35 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-06 03:22:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 559 transitions. [2025-02-06 03:22:02,285 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 559 transitions. Word has length 204 [2025-02-06 03:22:02,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:02,285 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 559 transitions. [2025-02-06 03:22:02,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 03:22:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 559 transitions. [2025-02-06 03:22:02,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:22:02,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:02,286 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:02,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-02-06 03:22:02,286 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:02,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 281250141, now seen corresponding path program 1 times [2025-02-06 03:22:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:02,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411407781] [2025-02-06 03:22:02,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:02,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:02,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:02,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:02,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:22:02,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411407781] [2025-02-06 03:22:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411407781] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171295288] [2025-02-06 03:22:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:02,711 INFO L229 MonitoredProcess]: Starting monitored process 11 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:22:02,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 03:22:02,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:02,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:02,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:02,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 03:22:02,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:02,979 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:22:02,995 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:22:03,012 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:22:03,107 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:22:03,116 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 50 treesize of output 36 [2025-02-06 03:22:03,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-02-06 03:22:03,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:03,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 27 [2025-02-06 03:22:03,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:03,166 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 63 treesize of output 56 [2025-02-06 03:22:03,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:03,343 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 88 treesize of output 40 [2025-02-06 03:22:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-02-06 03:22:03,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:03,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:22:03,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171295288] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:22:03,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:22:03,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 19 [2025-02-06 03:22:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065583026] [2025-02-06 03:22:03,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:22:03,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 03:22:03,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:03,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 03:22:03,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-02-06 03:22:03,628 INFO L87 Difference]: Start difference. First operand 507 states and 559 transitions. Second operand has 19 states, 16 states have (on average 10.5625) internal successors, (169), 19 states have internal predecessors, (169), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:22:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:04,631 INFO L93 Difference]: Finished difference Result 1091 states and 1193 transitions. [2025-02-06 03:22:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 03:22:04,632 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 10.5625) internal successors, (169), 19 states have internal predecessors, (169), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) Word has length 204 [2025-02-06 03:22:04,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:04,634 INFO L225 Difference]: With dead ends: 1091 [2025-02-06 03:22:04,634 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 03:22:04,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 399 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=352, Invalid=1540, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 03:22:04,635 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 424 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:04,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 853 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 03:22:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 03:22:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 357. [2025-02-06 03:22:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 322 states have (on average 1.0776397515527951) internal successors, (347), 322 states have internal predecessors, (347), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 03:22:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 393 transitions. [2025-02-06 03:22:04,665 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 393 transitions. Word has length 204 [2025-02-06 03:22:04,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:04,665 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 393 transitions. [2025-02-06 03:22:04,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 10.5625) internal successors, (169), 19 states have internal predecessors, (169), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:22:04,665 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 393 transitions. [2025-02-06 03:22:04,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-06 03:22:04,666 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:22:04,666 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:04,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 03:22:04,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:04,866 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:22:04,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:22:04,867 INFO L85 PathProgramCache]: Analyzing trace with hash 588323007, now seen corresponding path program 1 times [2025-02-06 03:22:04,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:22:04,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332691218] [2025-02-06 03:22:04,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:04,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:22:04,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:04,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:04,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:04,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:22:05,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:22:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332691218] [2025-02-06 03:22:05,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332691218] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:22:05,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753275711] [2025-02-06 03:22:05,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:22:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:22:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:22:05,301 INFO L229 MonitoredProcess]: Starting monitored process 12 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:22:05,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 03:22:05,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-06 03:22:05,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-06 03:22:05,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:22:05,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:22:05,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 03:22:05,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:22:05,568 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:22:05,580 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:22:05,596 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:22:05,626 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:22:05,644 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:22:05,744 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:22:05,753 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 50 treesize of output 36 [2025-02-06 03:22:05,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2025-02-06 03:22:05,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2025-02-06 03:22:05,805 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:05,805 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 63 treesize of output 38 [2025-02-06 03:22:05,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:22:05,893 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 73 treesize of output 37 [2025-02-06 03:22:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-02-06 03:22:05,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:22:06,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 03:22:06,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753275711] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:22:06,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:22:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 14 [2025-02-06 03:22:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877702304] [2025-02-06 03:22:06,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:22:06,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 03:22:06,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:22:06,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 03:22:06,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-02-06 03:22:06,109 INFO L87 Difference]: Start difference. First operand 357 states and 393 transitions. Second operand has 14 states, 11 states have (on average 15.272727272727273) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:22:06,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:22:06,533 INFO L93 Difference]: Finished difference Result 555 states and 611 transitions. [2025-02-06 03:22:06,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 03:22:06,533 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 15.272727272727273) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) Word has length 204 [2025-02-06 03:22:06,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:22:06,535 INFO L225 Difference]: With dead ends: 555 [2025-02-06 03:22:06,535 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 03:22:06,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 401 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2025-02-06 03:22:06,535 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 156 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 03:22:06,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 412 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 03:22:06,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 03:22:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 03:22:06,536 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:22:06,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 03:22:06,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-02-06 03:22:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:22:06,536 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 03:22:06,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 15.272727272727273) internal successors, (168), 14 states have internal predecessors, (168), 6 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (47), 3 states have call predecessors, (47), 6 states have call successors, (47) [2025-02-06 03:22:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 03:22:06,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 03:22:06,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:22:06,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-06 03:22:06,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-02-06 03:22:06,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:06,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 03:22:14,814 WARN L286 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 152 DAG size of output: 175 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)