./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-?-551b009-m [2025-01-09 15:27:30,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:27:30,714 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:27:30,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:27:30,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:27:30,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:27:30,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:27:30,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:27:30,743 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:27:30,743 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:27:30,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:27:30,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:27:30,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:27:30,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:27:30,744 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:27:30,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:27:30,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:27:30,744 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:27:30,744 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:27:30,744 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:27:30,745 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:27:30,746 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:30,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:27:30,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:30,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:27:30,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:27:30,747 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-01-09 15:27:31,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:27:31,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:27:31,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:27:31,012 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:27:31,013 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:27:31,014 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-01-09 15:27:32,310 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e2f9e26/fa69cfc08ad4467abecdec2df31d5c05/FLAG88d49e2fc [2025-01-09 15:27:32,560 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:27:32,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-85.i [2025-01-09 15:27:32,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e2f9e26/fa69cfc08ad4467abecdec2df31d5c05/FLAG88d49e2fc [2025-01-09 15:27:32,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11e2f9e26/fa69cfc08ad4467abecdec2df31d5c05 [2025-01-09 15:27:32,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:27:32,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:27:32,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:32,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:27:32,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:27:32,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@307c211d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32, skipping insertion in model container [2025-01-09 15:27:32,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:27:32,744 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-01-09 15:27:32,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:32,819 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:27:32,828 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-01-09 15:27:32,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:27:32,890 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:27:32,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32 WrapperNode [2025-01-09 15:27:32,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:27:32,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:32,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:27:32,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:27:32,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,955 INFO L138 Inliner]: procedures = 27, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 518 [2025-01-09 15:27:32,956 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:27:32,956 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:27:32,957 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:27:32,957 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:27:32,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,995 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-01-09 15:27:32,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:32,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,018 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,039 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:27:33,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:27:33,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:27:33,040 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:27:33,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (1/1) ... [2025-01-09 15:27:33,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:27:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:33,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:27:33,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:27:33,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:27:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:27:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:27:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:27:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:27:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:27:33,203 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:27:33,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:27:33,639 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-01-09 15:27:33,639 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:27:33,647 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:27:33,647 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:27:33,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:33 BoogieIcfgContainer [2025-01-09 15:27:33,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:27:33,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:27:33,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:27:33,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:27:33,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:27:32" (1/3) ... [2025-01-09 15:27:33,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d53bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:33, skipping insertion in model container [2025-01-09 15:27:33,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:27:32" (2/3) ... [2025-01-09 15:27:33,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d53bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:27:33, skipping insertion in model container [2025-01-09 15:27:33,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:27:33" (3/3) ... [2025-01-09 15:27:33,654 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-85.i [2025-01-09 15:27:33,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:27:33,664 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-01-09 15:27:33,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:27:33,714 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;@61f7ca74, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:27:33,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:27:33,718 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-01-09 15:27:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 15:27:33,727 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:33,728 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-01-09 15:27:33,728 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -255026595, now seen corresponding path program 1 times [2025-01-09 15:27:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:33,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234661654] [2025-01-09 15:27:33,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:33,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:33,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 15:27:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 15:27:33,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:33,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 15:27:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234661654] [2025-01-09 15:27:34,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234661654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:34,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531282486] [2025-01-09 15:27:34,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:34,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:34,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:27:34,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 15:27:34,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 15:27:34,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:34,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:34,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:27:34,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 15:27:34,282 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:27:34,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531282486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:34,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:27:34,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:27:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726426933] [2025-01-09 15:27:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:34,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:27:34,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:34,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:27:34,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:27:34,299 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-01-09 15:27:34,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:34,321 INFO L93 Difference]: Finished difference Result 254 states and 396 transitions. [2025-01-09 15:27:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:27:34,322 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-01-09 15:27:34,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:34,326 INFO L225 Difference]: With dead ends: 254 [2025-01-09 15:27:34,326 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:27:34,328 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-01-09 15:27:34,331 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-01-09 15:27:34,332 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-01-09 15:27:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:27:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-01-09 15:27:34,356 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-01-09 15:27:34,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-01-09 15:27:34,360 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2025-01-09 15:27:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:34,360 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-01-09 15:27:34,361 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-01-09 15:27:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-01-09 15:27:34,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 15:27:34,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:34,363 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-01-09 15:27:34,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:27:34,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:27:34,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:34,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:34,564 INFO L85 PathProgramCache]: Analyzing trace with hash -115517969, now seen corresponding path program 1 times [2025-01-09 15:27:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:34,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831120895] [2025-01-09 15:27:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:34,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 15:27:34,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 15:27:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:34,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831120895] [2025-01-09 15:27:34,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831120895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:34,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276461048] [2025-01-09 15:27:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:34,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:34,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:34,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:34,912 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-01-09 15:27:34,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:34,958 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2025-01-09 15:27:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:34,959 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-01-09 15:27:34,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:34,960 INFO L225 Difference]: With dead ends: 254 [2025-01-09 15:27:34,963 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 15:27:34,964 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-01-09 15:27:34,964 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:34,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 535 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:34,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 15:27:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-01-09 15:27:34,978 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-01-09 15:27:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-01-09 15:27:34,984 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 179 [2025-01-09 15:27:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:34,985 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-01-09 15:27:34,985 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-01-09 15:27:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-01-09 15:27:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 15:27:34,986 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:34,987 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-01-09 15:27:34,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:27:34,990 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:34,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -53478355, now seen corresponding path program 1 times [2025-01-09 15:27:34,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:34,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452525068] [2025-01-09 15:27:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:35,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 15:27:35,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 15:27:35,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:35,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:36,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452525068] [2025-01-09 15:27:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452525068] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:36,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:36,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098214916] [2025-01-09 15:27:36,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:36,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:36,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:36,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:36,640 INFO L87 Difference]: Start difference. First operand 129 states and 186 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-01-09 15:27:37,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:37,104 INFO L93 Difference]: Finished difference Result 480 states and 689 transitions. [2025-01-09 15:27:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:27:37,105 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-01-09 15:27:37,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:37,107 INFO L225 Difference]: With dead ends: 480 [2025-01-09 15:27:37,107 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 15:27:37,108 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-01-09 15:27:37,109 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 355 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:37,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 706 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 15:27:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 203. [2025-01-09 15:27:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3828571428571428) internal successors, (242), 176 states have internal predecessors, (242), 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-01-09 15:27:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 292 transitions. [2025-01-09 15:27:37,124 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 292 transitions. Word has length 179 [2025-01-09 15:27:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:37,124 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 292 transitions. [2025-01-09 15:27:37,124 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-01-09 15:27:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 292 transitions. [2025-01-09 15:27:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:37,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:37,126 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-01-09 15:27:37,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:27:37,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:37,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:37,127 INFO L85 PathProgramCache]: Analyzing trace with hash 29572209, now seen corresponding path program 1 times [2025-01-09 15:27:37,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:37,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612602909] [2025-01-09 15:27:37,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:37,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:37,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:37,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:37,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:37,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612602909] [2025-01-09 15:27:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612602909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:37,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:37,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:37,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035831870] [2025-01-09 15:27:37,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:37,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:37,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:37,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:37,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:37,339 INFO L87 Difference]: Start difference. First operand 203 states and 292 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-01-09 15:27:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:37,561 INFO L93 Difference]: Finished difference Result 587 states and 846 transitions. [2025-01-09 15:27:37,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:37,562 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-01-09 15:27:37,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:37,565 INFO L225 Difference]: With dead ends: 587 [2025-01-09 15:27:37,565 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 15:27:37,566 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-01-09 15:27:37,566 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 160 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:37,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 508 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 15:27:37,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 207. [2025-01-09 15:27:37,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 179 states have (on average 1.3743016759776536) internal successors, (246), 180 states have internal predecessors, (246), 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-01-09 15:27:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2025-01-09 15:27:37,593 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 180 [2025-01-09 15:27:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:37,594 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2025-01-09 15:27:37,594 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-01-09 15:27:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2025-01-09 15:27:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:37,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:37,595 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-01-09 15:27:37,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:27:37,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:37,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 351462728, now seen corresponding path program 1 times [2025-01-09 15:27:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:37,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721337911] [2025-01-09 15:27:37,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:37,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:37,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:37,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:37,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:37,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:38,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:27:38,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721337911] [2025-01-09 15:27:38,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721337911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:38,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127878643] [2025-01-09 15:27:38,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:38,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:38,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:27:38,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:27:38,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:27:38,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:38,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:38,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:38,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:38,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 15:27:38,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:27:38,620 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-01-09 15:27:38,679 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-01-09 15:27:38,713 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-01-09 15:27:38,738 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-01-09 15:27:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:27:38,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:27:38,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:38,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127878643] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:27:38,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:27:38,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 12] total 19 [2025-01-09 15:27:38,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510110589] [2025-01-09 15:27:38,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:38,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:38,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:38,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:27:38,950 INFO L87 Difference]: Start difference. First operand 207 states and 296 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-01-09 15:27:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:39,300 INFO L93 Difference]: Finished difference Result 570 states and 813 transitions. [2025-01-09 15:27:39,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:27:39,300 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-01-09 15:27:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:39,302 INFO L225 Difference]: With dead ends: 570 [2025-01-09 15:27:39,302 INFO L226 Difference]: Without dead ends: 366 [2025-01-09 15:27:39,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:27:39,303 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 144 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:39,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1451 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-01-09 15:27:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 221. [2025-01-09 15:27:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 193 states have (on average 1.3575129533678756) internal successors, (262), 194 states have internal predecessors, (262), 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-01-09 15:27:39,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 312 transitions. [2025-01-09 15:27:39,315 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 312 transitions. Word has length 180 [2025-01-09 15:27:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:39,316 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 312 transitions. [2025-01-09 15:27:39,316 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-01-09 15:27:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 312 transitions. [2025-01-09 15:27:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:39,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:39,317 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-01-09 15:27:39,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:27:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:27:39,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:39,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -669605626, now seen corresponding path program 1 times [2025-01-09 15:27:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21679878] [2025-01-09 15:27:39,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:39,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:39,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:39,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:39,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:39,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21679878] [2025-01-09 15:27:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21679878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:39,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:39,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:39,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573253499] [2025-01-09 15:27:39,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:39,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:39,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:39,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:39,831 INFO L87 Difference]: Start difference. First operand 221 states and 312 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-01-09 15:27:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:40,193 INFO L93 Difference]: Finished difference Result 826 states and 1170 transitions. [2025-01-09 15:27:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:40,193 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-01-09 15:27:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:40,196 INFO L225 Difference]: With dead ends: 826 [2025-01-09 15:27:40,196 INFO L226 Difference]: Without dead ends: 608 [2025-01-09 15:27:40,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:40,197 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 320 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:40,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1700 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-01-09 15:27:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 271. [2025-01-09 15:27:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 244 states have internal predecessors, (332), 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-01-09 15:27:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 382 transitions. [2025-01-09 15:27:40,211 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 382 transitions. Word has length 180 [2025-01-09 15:27:40,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:40,211 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 382 transitions. [2025-01-09 15:27:40,211 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-01-09 15:27:40,211 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 382 transitions. [2025-01-09 15:27:40,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:40,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:40,213 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-01-09 15:27:40,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:27:40,213 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:40,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:40,213 INFO L85 PathProgramCache]: Analyzing trace with hash -466185722, now seen corresponding path program 1 times [2025-01-09 15:27:40,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:40,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405186976] [2025-01-09 15:27:40,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:40,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:40,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:40,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:40,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:40,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:40,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:40,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:40,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405186976] [2025-01-09 15:27:40,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405186976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:40,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:40,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:27:40,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60401015] [2025-01-09 15:27:40,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:40,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:27:40,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:40,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:27:40,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:27:40,505 INFO L87 Difference]: Start difference. First operand 271 states and 382 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-01-09 15:27:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:40,852 INFO L93 Difference]: Finished difference Result 884 states and 1250 transitions. [2025-01-09 15:27:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:40,853 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-01-09 15:27:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:40,856 INFO L225 Difference]: With dead ends: 884 [2025-01-09 15:27:40,856 INFO L226 Difference]: Without dead ends: 616 [2025-01-09 15:27:40,856 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-01-09 15:27:40,857 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 403 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:40,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1027 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:40,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-01-09 15:27:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 279. [2025-01-09 15:27:40,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 251 states have (on average 1.3545816733067728) internal successors, (340), 252 states have internal predecessors, (340), 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-01-09 15:27:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 390 transitions. [2025-01-09 15:27:40,870 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 390 transitions. Word has length 180 [2025-01-09 15:27:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:40,871 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 390 transitions. [2025-01-09 15:27:40,871 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-01-09 15:27:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 390 transitions. [2025-01-09 15:27:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:40,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:40,872 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-01-09 15:27:40,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:27:40,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:40,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1487254076, now seen corresponding path program 1 times [2025-01-09 15:27:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919707373] [2025-01-09 15:27:40,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:40,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:40,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:40,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:40,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:41,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919707373] [2025-01-09 15:27:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919707373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:41,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:41,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:41,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499600281] [2025-01-09 15:27:41,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:41,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:41,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:41,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:41,180 INFO L87 Difference]: Start difference. First operand 279 states and 390 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-01-09 15:27:41,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:41,284 INFO L93 Difference]: Finished difference Result 801 states and 1130 transitions. [2025-01-09 15:27:41,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:41,285 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-01-09 15:27:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:41,287 INFO L225 Difference]: With dead ends: 801 [2025-01-09 15:27:41,287 INFO L226 Difference]: Without dead ends: 525 [2025-01-09 15:27:41,288 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-01-09 15:27:41,288 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-01-09 15:27:41,288 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-01-09 15:27:41,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-01-09 15:27:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 281. [2025-01-09 15:27:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 253 states have (on average 1.359683794466403) internal successors, (344), 254 states have internal predecessors, (344), 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-01-09 15:27:41,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 394 transitions. [2025-01-09 15:27:41,300 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 394 transitions. Word has length 180 [2025-01-09 15:27:41,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:41,301 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 394 transitions. [2025-01-09 15:27:41,301 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-01-09 15:27:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 394 transitions. [2025-01-09 15:27:41,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:41,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:41,302 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-01-09 15:27:41,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:27:41,302 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:41,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:41,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1323460236, now seen corresponding path program 1 times [2025-01-09 15:27:41,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:41,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574385329] [2025-01-09 15:27:41,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:41,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:41,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:41,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:41,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:41,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:41,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:41,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574385329] [2025-01-09 15:27:41,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574385329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:41,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:41,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440590483] [2025-01-09 15:27:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:41,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:41,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:41,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:41,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:41,617 INFO L87 Difference]: Start difference. First operand 281 states and 394 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-01-09 15:27:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:41,739 INFO L93 Difference]: Finished difference Result 721 states and 1016 transitions. [2025-01-09 15:27:41,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:41,740 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-01-09 15:27:41,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:41,742 INFO L225 Difference]: With dead ends: 721 [2025-01-09 15:27:41,742 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 15:27:41,743 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-01-09 15:27:41,743 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 147 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:41,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1196 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:27:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 15:27:41,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 289. [2025-01-09 15:27:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.3639846743295019) internal successors, (356), 262 states have internal predecessors, (356), 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-01-09 15:27:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 406 transitions. [2025-01-09 15:27:41,758 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 406 transitions. Word has length 180 [2025-01-09 15:27:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:41,759 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 406 transitions. [2025-01-09 15:27:41,759 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-01-09 15:27:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 406 transitions. [2025-01-09 15:27:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:41,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:41,761 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-01-09 15:27:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:27:41,761 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:41,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash 302391882, now seen corresponding path program 1 times [2025-01-09 15:27:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:41,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55477294] [2025-01-09 15:27:41,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:41,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:41,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:41,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:41,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55477294] [2025-01-09 15:27:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55477294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:42,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850983218] [2025-01-09 15:27:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:42,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:42,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:42,050 INFO L87 Difference]: Start difference. First operand 289 states and 406 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-01-09 15:27:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:42,360 INFO L93 Difference]: Finished difference Result 861 states and 1208 transitions. [2025-01-09 15:27:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:42,361 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-01-09 15:27:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:42,363 INFO L225 Difference]: With dead ends: 861 [2025-01-09 15:27:42,363 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 15:27:42,364 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-01-09 15:27:42,364 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 157 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 987 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:42,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 987 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:42,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 15:27:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 357. [2025-01-09 15:27:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 329 states have (on average 1.3799392097264438) internal successors, (454), 330 states have internal predecessors, (454), 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-01-09 15:27:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 504 transitions. [2025-01-09 15:27:42,379 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 504 transitions. Word has length 180 [2025-01-09 15:27:42,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:42,379 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 504 transitions. [2025-01-09 15:27:42,379 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-01-09 15:27:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 504 transitions. [2025-01-09 15:27:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:42,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:42,381 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-01-09 15:27:42,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:27:42,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1645350755, now seen corresponding path program 1 times [2025-01-09 15:27:42,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:42,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512330488] [2025-01-09 15:27:42,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:42,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:42,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:42,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512330488] [2025-01-09 15:27:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512330488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:42,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410006008] [2025-01-09 15:27:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:42,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:42,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:42,517 INFO L87 Difference]: Start difference. First operand 357 states and 504 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-01-09 15:27:42,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:42,819 INFO L93 Difference]: Finished difference Result 975 states and 1384 transitions. [2025-01-09 15:27:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:42,823 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-01-09 15:27:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:42,827 INFO L225 Difference]: With dead ends: 975 [2025-01-09 15:27:42,827 INFO L226 Difference]: Without dead ends: 621 [2025-01-09 15:27:42,829 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-01-09 15:27:42,830 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 158 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 837 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-01-09 15:27:42,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 837 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-01-09 15:27:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 355. [2025-01-09 15:27:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 327 states have (on average 1.3577981651376148) internal successors, (444), 328 states have internal predecessors, (444), 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-01-09 15:27:42,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 494 transitions. [2025-01-09 15:27:42,855 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 494 transitions. Word has length 180 [2025-01-09 15:27:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:42,856 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 494 transitions. [2025-01-09 15:27:42,856 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-01-09 15:27:42,856 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 494 transitions. [2025-01-09 15:27:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 15:27:42,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:42,858 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-01-09 15:27:42,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:27:42,859 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1003991756, now seen corresponding path program 1 times [2025-01-09 15:27:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:42,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817168440] [2025-01-09 15:27:42,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:42,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 15:27:42,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 15:27:42,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:42,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:42,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:42,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817168440] [2025-01-09 15:27:42,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817168440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:42,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:42,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298402944] [2025-01-09 15:27:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:42,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:42,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:42,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:42,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:42,945 INFO L87 Difference]: Start difference. First operand 355 states and 494 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-01-09 15:27:42,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:42,967 INFO L93 Difference]: Finished difference Result 669 states and 930 transitions. [2025-01-09 15:27:42,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:42,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-01-09 15:27:42,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:42,969 INFO L225 Difference]: With dead ends: 669 [2025-01-09 15:27:42,969 INFO L226 Difference]: Without dead ends: 317 [2025-01-09 15:27:42,969 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-01-09 15:27:42,969 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-01-09 15:27:42,970 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-01-09 15:27:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-01-09 15:27:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-01-09 15:27:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 289 states have (on average 1.3391003460207613) internal successors, (387), 290 states have internal predecessors, (387), 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-01-09 15:27:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 437 transitions. [2025-01-09 15:27:42,981 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 437 transitions. Word has length 180 [2025-01-09 15:27:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 437 transitions. [2025-01-09 15:27:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 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-01-09 15:27:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 437 transitions. [2025-01-09 15:27:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:27:42,983 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:42,983 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-01-09 15:27:42,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:27:42,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:42,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -244476763, now seen corresponding path program 1 times [2025-01-09 15:27:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:42,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178602650] [2025-01-09 15:27:42,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:43,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:27:43,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:27:43,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:43,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:43,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178602650] [2025-01-09 15:27:43,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178602650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:43,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:43,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781262607] [2025-01-09 15:27:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:43,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:43,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:43,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:43,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:43,358 INFO L87 Difference]: Start difference. First operand 317 states and 437 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-01-09 15:27:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:43,801 INFO L93 Difference]: Finished difference Result 795 states and 1100 transitions. [2025-01-09 15:27:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:43,805 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-01-09 15:27:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:43,807 INFO L225 Difference]: With dead ends: 795 [2025-01-09 15:27:43,807 INFO L226 Difference]: Without dead ends: 481 [2025-01-09 15:27:43,807 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-01-09 15:27:43,811 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 309 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:43,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 758 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-01-09 15:27:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 314. [2025-01-09 15:27:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 286 states have (on average 1.3391608391608392) internal successors, (383), 287 states have internal predecessors, (383), 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-01-09 15:27:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 433 transitions. [2025-01-09 15:27:43,830 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 433 transitions. Word has length 181 [2025-01-09 15:27:43,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:43,831 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 433 transitions. [2025-01-09 15:27:43,831 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-01-09 15:27:43,831 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 433 transitions. [2025-01-09 15:27:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:27:43,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:43,833 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-01-09 15:27:43,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:27:43,833 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:43,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:43,833 INFO L85 PathProgramCache]: Analyzing trace with hash -912352151, now seen corresponding path program 1 times [2025-01-09 15:27:43,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:43,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124126809] [2025-01-09 15:27:43,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:43,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:27:43,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:27:43,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:43,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:44,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:44,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124126809] [2025-01-09 15:27:44,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124126809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:44,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95858243] [2025-01-09 15:27:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:44,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:44,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:44,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:44,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:44,196 INFO L87 Difference]: Start difference. First operand 314 states and 433 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-01-09 15:27:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:44,525 INFO L93 Difference]: Finished difference Result 743 states and 1029 transitions. [2025-01-09 15:27:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:44,525 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-01-09 15:27:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:44,528 INFO L225 Difference]: With dead ends: 743 [2025-01-09 15:27:44,528 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 15:27:44,529 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-01-09 15:27:44,529 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 393 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:44,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 489 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 15:27:44,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 314. [2025-01-09 15:27:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 286 states have (on average 1.3356643356643356) internal successors, (382), 287 states have internal predecessors, (382), 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-01-09 15:27:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 432 transitions. [2025-01-09 15:27:44,545 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 432 transitions. Word has length 181 [2025-01-09 15:27:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 432 transitions. [2025-01-09 15:27:44,545 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-01-09 15:27:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 432 transitions. [2025-01-09 15:27:44,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:27:44,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:44,547 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-01-09 15:27:44,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:27:44,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:44,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1933420505, now seen corresponding path program 1 times [2025-01-09 15:27:44,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:44,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061074054] [2025-01-09 15:27:44,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:44,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:44,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:27:44,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:27:44,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:44,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:44,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061074054] [2025-01-09 15:27:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061074054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173546186] [2025-01-09 15:27:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:44,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:44,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:44,942 INFO L87 Difference]: Start difference. First operand 314 states and 432 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-01-09 15:27:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,217 INFO L93 Difference]: Finished difference Result 947 states and 1312 transitions. [2025-01-09 15:27:45,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:27:45,217 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-01-09 15:27:45,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:45,220 INFO L225 Difference]: With dead ends: 947 [2025-01-09 15:27:45,220 INFO L226 Difference]: Without dead ends: 636 [2025-01-09 15:27:45,222 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-01-09 15:27:45,223 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 330 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:45,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 2450 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-01-09 15:27:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 318. [2025-01-09 15:27:45,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 290 states have (on average 1.3344827586206895) internal successors, (387), 291 states have internal predecessors, (387), 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-01-09 15:27:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 437 transitions. [2025-01-09 15:27:45,239 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 437 transitions. Word has length 181 [2025-01-09 15:27:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:45,240 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 437 transitions. [2025-01-09 15:27:45,240 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-01-09 15:27:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 437 transitions. [2025-01-09 15:27:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 15:27:45,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:45,242 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-01-09 15:27:45,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:27:45,242 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash -734853569, now seen corresponding path program 1 times [2025-01-09 15:27:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393551901] [2025-01-09 15:27:45,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:45,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:45,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 15:27:45,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 15:27:45,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393551901] [2025-01-09 15:27:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393551901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:45,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:27:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885093717] [2025-01-09 15:27:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:27:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:45,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:27:45,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:27:45,302 INFO L87 Difference]: Start difference. First operand 318 states and 437 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-01-09 15:27:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,318 INFO L93 Difference]: Finished difference Result 634 states and 873 transitions. [2025-01-09 15:27:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:27:45,319 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-01-09 15:27:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:45,320 INFO L225 Difference]: With dead ends: 634 [2025-01-09 15:27:45,320 INFO L226 Difference]: Without dead ends: 319 [2025-01-09 15:27:45,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:27:45,322 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-01-09 15:27:45,322 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-01-09 15:27:45,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-01-09 15:27:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2025-01-09 15:27:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 291 states have (on average 1.3333333333333333) internal successors, (388), 292 states have internal predecessors, (388), 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-01-09 15:27:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 438 transitions. [2025-01-09 15:27:45,345 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 438 transitions. Word has length 182 [2025-01-09 15:27:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:45,345 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 438 transitions. [2025-01-09 15:27:45,346 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-01-09 15:27:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 438 transitions. [2025-01-09 15:27:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 15:27:45,347 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:45,347 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-01-09 15:27:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:27:45,347 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:45,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:45,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1764212867, now seen corresponding path program 1 times [2025-01-09 15:27:45,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:45,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572100045] [2025-01-09 15:27:45,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:45,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 15:27:45,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 15:27:45,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:45,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:45,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572100045] [2025-01-09 15:27:45,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572100045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171475971] [2025-01-09 15:27:45,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:45,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:45,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:45,515 INFO L87 Difference]: Start difference. First operand 319 states and 438 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-01-09 15:27:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,566 INFO L93 Difference]: Finished difference Result 549 states and 753 transitions. [2025-01-09 15:27:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:45,566 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-01-09 15:27:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:45,568 INFO L225 Difference]: With dead ends: 549 [2025-01-09 15:27:45,568 INFO L226 Difference]: Without dead ends: 233 [2025-01-09 15:27:45,568 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-01-09 15:27:45,568 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-01-09 15:27:45,568 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-01-09 15:27:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-01-09 15:27:45,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2025-01-09 15:27:45,581 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-01-09 15:27:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-01-09 15:27:45,582 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 182 [2025-01-09 15:27:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:45,582 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-01-09 15:27:45,582 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-01-09 15:27:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-01-09 15:27:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 15:27:45,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:45,583 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-01-09 15:27:45,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:27:45,584 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1659051136, now seen corresponding path program 1 times [2025-01-09 15:27:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445388695] [2025-01-09 15:27:45,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:45,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 15:27:45,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 15:27:45,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:45,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:45,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445388695] [2025-01-09 15:27:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445388695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:45,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:45,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:27:45,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790091331] [2025-01-09 15:27:45,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:45,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:27:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:45,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:27:45,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:27:45,877 INFO L87 Difference]: Start difference. First operand 232 states and 316 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-01-09 15:27:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:45,999 INFO L93 Difference]: Finished difference Result 523 states and 716 transitions. [2025-01-09 15:27:45,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:46,000 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-01-09 15:27:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:46,002 INFO L225 Difference]: With dead ends: 523 [2025-01-09 15:27:46,002 INFO L226 Difference]: Without dead ends: 294 [2025-01-09 15:27:46,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:27:46,003 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-01-09 15:27:46,003 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-01-09 15:27:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-01-09 15:27:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 238. [2025-01-09 15:27:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 210 states have (on average 1.2952380952380953) internal successors, (272), 211 states have internal predecessors, (272), 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-01-09 15:27:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 322 transitions. [2025-01-09 15:27:46,016 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 322 transitions. Word has length 183 [2025-01-09 15:27:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 322 transitions. [2025-01-09 15:27:46,017 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-01-09 15:27:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 322 transitions. [2025-01-09 15:27:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 15:27:46,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:46,019 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-01-09 15:27:46,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:27:46,019 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:46,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:46,020 INFO L85 PathProgramCache]: Analyzing trace with hash -940780987, now seen corresponding path program 1 times [2025-01-09 15:27:46,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:46,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000475630] [2025-01-09 15:27:46,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:46,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:46,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 15:27:46,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 15:27:46,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:46,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:46,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:46,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000475630] [2025-01-09 15:27:46,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000475630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:46,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:46,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:27:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568706567] [2025-01-09 15:27:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:46,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:27:46,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:46,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:27:46,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:27:46,077 INFO L87 Difference]: Start difference. First operand 238 states and 322 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-01-09 15:27:46,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:46,092 INFO L93 Difference]: Finished difference Result 475 states and 645 transitions. [2025-01-09 15:27:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:27:46,092 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-01-09 15:27:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:46,093 INFO L225 Difference]: With dead ends: 475 [2025-01-09 15:27:46,093 INFO L226 Difference]: Without dead ends: 240 [2025-01-09 15:27:46,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:27:46,094 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-01-09 15:27:46,094 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-01-09 15:27:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-01-09 15:27:46,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-01-09 15:27:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 212 states have (on average 1.2924528301886793) internal successors, (274), 213 states have internal predecessors, (274), 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-01-09 15:27:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 324 transitions. [2025-01-09 15:27:46,105 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 324 transitions. Word has length 185 [2025-01-09 15:27:46,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:46,106 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 324 transitions. [2025-01-09 15:27:46,106 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-01-09 15:27:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 324 transitions. [2025-01-09 15:27:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-01-09 15:27:46,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:46,107 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-01-09 15:27:46,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:27:46,108 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:46,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:46,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1765838407, now seen corresponding path program 1 times [2025-01-09 15:27:46,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:46,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422589545] [2025-01-09 15:27:46,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 15:27:46,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 15:27:46,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:46,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422589545] [2025-01-09 15:27:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422589545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:46,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:46,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152351144] [2025-01-09 15:27:46,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:46,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:46,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:46,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:46,224 INFO L87 Difference]: Start difference. First operand 240 states and 324 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-01-09 15:27:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:46,265 INFO L93 Difference]: Finished difference Result 467 states and 631 transitions. [2025-01-09 15:27:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:46,266 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-01-09 15:27:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:46,267 INFO L225 Difference]: With dead ends: 467 [2025-01-09 15:27:46,267 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 15:27:46,268 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-01-09 15:27:46,268 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-01-09 15:27:46,268 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-01-09 15:27:46,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 15:27:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2025-01-09 15:27:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 200 states have (on average 1.28) internal successors, (256), 201 states have internal predecessors, (256), 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-01-09 15:27:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 306 transitions. [2025-01-09 15:27:46,277 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 306 transitions. Word has length 185 [2025-01-09 15:27:46,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:46,278 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 306 transitions. [2025-01-09 15:27:46,278 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-01-09 15:27:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 306 transitions. [2025-01-09 15:27:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 15:27:46,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:46,279 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-01-09 15:27:46,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:27:46,279 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:46,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:46,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2039541320, now seen corresponding path program 1 times [2025-01-09 15:27:46,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:46,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093070547] [2025-01-09 15:27:46,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:46,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 15:27:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 15:27:46,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:46,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:46,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:46,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093070547] [2025-01-09 15:27:46,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093070547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:46,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:46,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:27:46,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691421275] [2025-01-09 15:27:46,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:46,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:46,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:46,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:46,747 INFO L87 Difference]: Start difference. First operand 228 states and 306 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-01-09 15:27:46,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:46,989 INFO L93 Difference]: Finished difference Result 576 states and 774 transitions. [2025-01-09 15:27:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:46,990 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-01-09 15:27:46,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:46,992 INFO L225 Difference]: With dead ends: 576 [2025-01-09 15:27:46,992 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 15:27:46,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-01-09 15:27:46,993 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 148 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:46,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1420 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:46,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 15:27:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 260. [2025-01-09 15:27:47,003 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-01-09 15:27:47,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 343 transitions. [2025-01-09 15:27:47,005 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 343 transitions. Word has length 187 [2025-01-09 15:27:47,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:47,005 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 343 transitions. [2025-01-09 15:27:47,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-01-09 15:27:47,005 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 343 transitions. [2025-01-09 15:27:47,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 15:27:47,006 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:47,006 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-01-09 15:27:47,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:27:47,006 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:47,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:47,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1781375882, now seen corresponding path program 1 times [2025-01-09 15:27:47,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:47,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55037056] [2025-01-09 15:27:47,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:47,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:47,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 15:27:47,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 15:27:47,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:47,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:47,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55037056] [2025-01-09 15:27:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55037056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:47,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856446224] [2025-01-09 15:27:47,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:47,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:47,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:47,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:47,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:47,068 INFO L87 Difference]: Start difference. First operand 260 states and 343 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-01-09 15:27:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:47,089 INFO L93 Difference]: Finished difference Result 524 states and 693 transitions. [2025-01-09 15:27:47,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:47,089 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-01-09 15:27:47,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:47,091 INFO L225 Difference]: With dead ends: 524 [2025-01-09 15:27:47,091 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 15:27:47,091 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-01-09 15:27:47,092 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-01-09 15:27:47,092 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-01-09 15:27:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 15:27:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2025-01-09 15:27:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 238 states have (on average 1.2563025210084033) internal successors, (299), 239 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-01-09 15:27:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2025-01-09 15:27:47,103 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 349 transitions. Word has length 187 [2025-01-09 15:27:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:47,103 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 349 transitions. [2025-01-09 15:27:47,103 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-01-09 15:27:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 349 transitions. [2025-01-09 15:27:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-09 15:27:47,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:47,104 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-01-09 15:27:47,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:27:47,104 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:47,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:47,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1563714247, now seen corresponding path program 1 times [2025-01-09 15:27:47,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893210690] [2025-01-09 15:27:47,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:47,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 15:27:47,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 15:27:47,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:47,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:47,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:47,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893210690] [2025-01-09 15:27:47,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893210690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349418230] [2025-01-09 15:27:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:47,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:47,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:47,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:47,741 INFO L87 Difference]: Start difference. First operand 266 states and 349 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-01-09 15:27:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:47,901 INFO L93 Difference]: Finished difference Result 532 states and 696 transitions. [2025-01-09 15:27:47,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:47,902 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-01-09 15:27:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:47,903 INFO L225 Difference]: With dead ends: 532 [2025-01-09 15:27:47,903 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 15:27:47,904 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-01-09 15:27:47,904 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:47,904 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.1s Time] [2025-01-09 15:27:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 15:27:47,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 227. [2025-01-09 15:27:47,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 201 states have (on average 1.2338308457711442) internal successors, (248), 201 states have internal predecessors, (248), 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-01-09 15:27:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 294 transitions. [2025-01-09 15:27:47,916 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 294 transitions. Word has length 188 [2025-01-09 15:27:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:47,916 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 294 transitions. [2025-01-09 15:27:47,917 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-01-09 15:27:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 294 transitions. [2025-01-09 15:27:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 15:27:47,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:47,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] [2025-01-09 15:27:47,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:27:47,918 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:47,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1656655184, now seen corresponding path program 1 times [2025-01-09 15:27:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129707526] [2025-01-09 15:27:47,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 15:27:47,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 15:27:47,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:47,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:47,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:47,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:47,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129707526] [2025-01-09 15:27:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129707526] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769928089] [2025-01-09 15:27:47,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:47,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:47,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:47,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:47,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:47,998 INFO L87 Difference]: Start difference. First operand 227 states and 294 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 15:27:48,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:48,026 INFO L93 Difference]: Finished difference Result 458 states and 594 transitions. [2025-01-09 15:27:48,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:48,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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 189 [2025-01-09 15:27:48,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:48,027 INFO L225 Difference]: With dead ends: 458 [2025-01-09 15:27:48,027 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 15:27:48,028 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-01-09 15:27:48,028 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:48,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 664 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 15:27:48,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2025-01-09 15:27:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 205 states have (on average 1.2292682926829268) internal successors, (252), 205 states have internal predecessors, (252), 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-01-09 15:27:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 298 transitions. [2025-01-09 15:27:48,040 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 298 transitions. Word has length 189 [2025-01-09 15:27:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 298 transitions. [2025-01-09 15:27:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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-01-09 15:27:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 298 transitions. [2025-01-09 15:27:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-01-09 15:27:48,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:48,041 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-01-09 15:27:48,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:27:48,041 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:48,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:48,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1358448434, now seen corresponding path program 1 times [2025-01-09 15:27:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:48,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821553438] [2025-01-09 15:27:48,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:48,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:48,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 15:27:48,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 15:27:48,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:48,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:48,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:48,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821553438] [2025-01-09 15:27:48,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821553438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:48,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:48,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:48,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555989774] [2025-01-09 15:27:48,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:48,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:48,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:48,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:48,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:48,620 INFO L87 Difference]: Start difference. First operand 231 states and 298 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-01-09 15:27:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:48,806 INFO L93 Difference]: Finished difference Result 496 states and 639 transitions. [2025-01-09 15:27:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:48,806 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-01-09 15:27:48,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:48,808 INFO L225 Difference]: With dead ends: 496 [2025-01-09 15:27:48,808 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 15:27:48,808 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-01-09 15:27:48,810 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-01-09 15:27:48,811 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-01-09 15:27:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 15:27:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 231. [2025-01-09 15:27:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 205 states have (on average 1.224390243902439) internal successors, (251), 205 states have internal predecessors, (251), 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-01-09 15:27:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 297 transitions. [2025-01-09 15:27:48,820 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 297 transitions. Word has length 189 [2025-01-09 15:27:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:48,820 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 297 transitions. [2025-01-09 15:27:48,821 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-01-09 15:27:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 297 transitions. [2025-01-09 15:27:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:48,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:48,822 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-01-09 15:27:48,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:27:48,822 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:48,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash 912132081, now seen corresponding path program 1 times [2025-01-09 15:27:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:48,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970791416] [2025-01-09 15:27:48,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:48,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:48,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:49,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970791416] [2025-01-09 15:27:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970791416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:49,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:49,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:27:49,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571294924] [2025-01-09 15:27:49,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:49,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:27:49,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:49,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:27:49,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:49,525 INFO L87 Difference]: Start difference. First operand 231 states and 297 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-01-09 15:27:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:49,863 INFO L93 Difference]: Finished difference Result 555 states and 711 transitions. [2025-01-09 15:27:49,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:27:49,863 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-01-09 15:27:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:49,865 INFO L225 Difference]: With dead ends: 555 [2025-01-09 15:27:49,865 INFO L226 Difference]: Without dead ends: 327 [2025-01-09 15:27:49,866 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-01-09 15:27:49,866 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 196 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:49,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1451 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:49,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-01-09 15:27:49,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 320. [2025-01-09 15:27:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 286 states have (on average 1.2307692307692308) internal successors, (352), 287 states have internal predecessors, (352), 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-01-09 15:27:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 410 transitions. [2025-01-09 15:27:49,879 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 410 transitions. Word has length 190 [2025-01-09 15:27:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 410 transitions. [2025-01-09 15:27:49,880 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-01-09 15:27:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 410 transitions. [2025-01-09 15:27:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:49,881 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:49,881 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-01-09 15:27:49,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:27:49,881 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 88463155, now seen corresponding path program 1 times [2025-01-09 15:27:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496413789] [2025-01-09 15:27:49,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:49,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:49,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:49,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496413789] [2025-01-09 15:27:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496413789] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:50,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324154659] [2025-01-09 15:27:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:50,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:50,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:50,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:50,404 INFO L87 Difference]: Start difference. First operand 320 states and 410 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-01-09 15:27:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:50,580 INFO L93 Difference]: Finished difference Result 729 states and 931 transitions. [2025-01-09 15:27:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:50,580 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-01-09 15:27:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:50,582 INFO L225 Difference]: With dead ends: 729 [2025-01-09 15:27:50,582 INFO L226 Difference]: Without dead ends: 412 [2025-01-09 15:27:50,583 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-01-09 15:27:50,583 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.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:50,583 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.2s Time] [2025-01-09 15:27:50,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-09 15:27:50,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 409. [2025-01-09 15:27:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 368 states have (on average 1.233695652173913) internal successors, (454), 370 states have internal predecessors, (454), 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-01-09 15:27:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 520 transitions. [2025-01-09 15:27:50,602 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 520 transitions. Word has length 190 [2025-01-09 15:27:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:50,603 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 520 transitions. [2025-01-09 15:27:50,603 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-01-09 15:27:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 520 transitions. [2025-01-09 15:27:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:50,604 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:50,604 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-01-09 15:27:50,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:27:50,604 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1191400523, now seen corresponding path program 1 times [2025-01-09 15:27:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829955926] [2025-01-09 15:27:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:50,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:50,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:50,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:50,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:51,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:51,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829955926] [2025-01-09 15:27:51,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829955926] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:51,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:51,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:27:51,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010944934] [2025-01-09 15:27:51,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:27:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:51,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:27:51,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:51,193 INFO L87 Difference]: Start difference. First operand 409 states and 520 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-01-09 15:27:51,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:51,482 INFO L93 Difference]: Finished difference Result 862 states and 1097 transitions. [2025-01-09 15:27:51,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:27:51,482 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-01-09 15:27:51,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:51,485 INFO L225 Difference]: With dead ends: 862 [2025-01-09 15:27:51,485 INFO L226 Difference]: Without dead ends: 456 [2025-01-09 15:27:51,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-01-09 15:27:51,486 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:51,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1246 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:51,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-01-09 15:27:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 453. [2025-01-09 15:27:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 404 states have (on average 1.2326732673267327) internal successors, (498), 407 states have internal predecessors, (498), 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-01-09 15:27:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 576 transitions. [2025-01-09 15:27:51,506 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 576 transitions. Word has length 190 [2025-01-09 15:27:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:51,507 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 576 transitions. [2025-01-09 15:27:51,507 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-01-09 15:27:51,507 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 576 transitions. [2025-01-09 15:27:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:51,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:51,508 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-01-09 15:27:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:27:51,508 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:51,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:51,508 INFO L85 PathProgramCache]: Analyzing trace with hash -933235085, now seen corresponding path program 1 times [2025-01-09 15:27:51,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:51,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989390974] [2025-01-09 15:27:51,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:51,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:51,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:51,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:51,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989390974] [2025-01-09 15:27:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989390974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470988014] [2025-01-09 15:27:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:52,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:52,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:52,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:52,655 INFO L87 Difference]: Start difference. First operand 453 states and 576 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-01-09 15:27:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:53,083 INFO L93 Difference]: Finished difference Result 986 states and 1253 transitions. [2025-01-09 15:27:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:53,084 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-01-09 15:27:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:53,086 INFO L225 Difference]: With dead ends: 986 [2025-01-09 15:27:53,086 INFO L226 Difference]: Without dead ends: 536 [2025-01-09 15:27:53,087 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-01-09 15:27:53,089 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 119 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:53,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1683 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-01-09 15:27:53,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 488. [2025-01-09 15:27:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 439 states have (on average 1.2209567198177675) internal successors, (536), 442 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-01-09 15:27:53,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 614 transitions. [2025-01-09 15:27:53,110 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 614 transitions. Word has length 190 [2025-01-09 15:27:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:53,110 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 614 transitions. [2025-01-09 15:27:53,110 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-01-09 15:27:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 614 transitions. [2025-01-09 15:27:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:53,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:53,111 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-01-09 15:27:53,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:27:53,112 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:53,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1302159565, now seen corresponding path program 1 times [2025-01-09 15:27:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:53,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101082900] [2025-01-09 15:27:53,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:53,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:53,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:53,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:53,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:54,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:54,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101082900] [2025-01-09 15:27:54,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101082900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:54,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:54,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:27:54,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231359045] [2025-01-09 15:27:54,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:54,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:27:54,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:54,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:27:54,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:27:54,252 INFO L87 Difference]: Start difference. First operand 488 states and 614 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-01-09 15:27:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:54,573 INFO L93 Difference]: Finished difference Result 1055 states and 1330 transitions. [2025-01-09 15:27:54,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:54,574 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-01-09 15:27:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:54,576 INFO L225 Difference]: With dead ends: 1055 [2025-01-09 15:27:54,576 INFO L226 Difference]: Without dead ends: 570 [2025-01-09 15:27:54,576 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-01-09 15:27:54,577 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 168 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:54,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1247 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-01-09 15:27:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 496. [2025-01-09 15:27:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 447 states have (on average 1.221476510067114) internal successors, (546), 450 states have internal predecessors, (546), 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-01-09 15:27:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 624 transitions. [2025-01-09 15:27:54,597 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 624 transitions. Word has length 190 [2025-01-09 15:27:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:54,597 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 624 transitions. [2025-01-09 15:27:54,597 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-01-09 15:27:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 624 transitions. [2025-01-09 15:27:54,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:54,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:54,599 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-01-09 15:27:54,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:27:54,599 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:54,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:54,599 INFO L85 PathProgramCache]: Analyzing trace with hash 663985587, now seen corresponding path program 1 times [2025-01-09 15:27:54,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:54,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750294771] [2025-01-09 15:27:54,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:54,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:54,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:54,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:54,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:54,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:55,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:55,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:55,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750294771] [2025-01-09 15:27:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750294771] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:55,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:55,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:55,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329080112] [2025-01-09 15:27:55,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:55,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:55,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:55,139 INFO L87 Difference]: Start difference. First operand 496 states and 624 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-01-09 15:27:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:55,397 INFO L93 Difference]: Finished difference Result 1027 states and 1290 transitions. [2025-01-09 15:27:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:27:55,398 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-01-09 15:27:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:55,400 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 15:27:55,400 INFO L226 Difference]: Without dead ends: 534 [2025-01-09 15:27:55,400 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-01-09 15:27:55,401 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 137 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:55,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 723 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-01-09 15:27:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 427. [2025-01-09 15:27:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 386 states have (on average 1.2124352331606219) internal successors, (468), 388 states have internal predecessors, (468), 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-01-09 15:27:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 534 transitions. [2025-01-09 15:27:55,417 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 534 transitions. Word has length 190 [2025-01-09 15:27:55,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:55,418 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 534 transitions. [2025-01-09 15:27:55,418 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-01-09 15:27:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 534 transitions. [2025-01-09 15:27:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 15:27:55,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:55,419 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-01-09 15:27:55,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:27:55,419 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:55,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:55,419 INFO L85 PathProgramCache]: Analyzing trace with hash -528607819, now seen corresponding path program 1 times [2025-01-09 15:27:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:55,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2777206] [2025-01-09 15:27:55,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:55,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 15:27:55,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 15:27:55,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:55,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:55,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:55,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2777206] [2025-01-09 15:27:55,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2777206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:55,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:55,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:27:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354532659] [2025-01-09 15:27:55,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:55,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:27:55,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:55,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:27:55,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:27:55,508 INFO L87 Difference]: Start difference. First operand 427 states and 534 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-01-09 15:27:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:55,544 INFO L93 Difference]: Finished difference Result 796 states and 999 transitions. [2025-01-09 15:27:55,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:27:55,544 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-01-09 15:27:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:55,546 INFO L225 Difference]: With dead ends: 796 [2025-01-09 15:27:55,546 INFO L226 Difference]: Without dead ends: 372 [2025-01-09 15:27:55,548 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-01-09 15:27:55,548 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-01-09 15:27:55,548 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-01-09 15:27:55,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-01-09 15:27:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2025-01-09 15:27:55,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 331 states have (on average 1.2114803625377644) internal successors, (401), 333 states have internal predecessors, (401), 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-01-09 15:27:55,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 467 transitions. [2025-01-09 15:27:55,568 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 467 transitions. Word has length 190 [2025-01-09 15:27:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 467 transitions. [2025-01-09 15:27:55,568 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-01-09 15:27:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 467 transitions. [2025-01-09 15:27:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:55,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:55,570 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-01-09 15:27:55,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:27:55,570 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:55,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1483362512, now seen corresponding path program 1 times [2025-01-09 15:27:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969825673] [2025-01-09 15:27:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:55,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:55,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:55,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:55,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969825673] [2025-01-09 15:27:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969825673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:27:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936279966] [2025-01-09 15:27:56,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:56,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:27:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:56,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:27:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:27:56,074 INFO L87 Difference]: Start difference. First operand 372 states and 467 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-01-09 15:27:56,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:56,277 INFO L93 Difference]: Finished difference Result 1049 states and 1309 transitions. [2025-01-09 15:27:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:27:56,278 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-01-09 15:27:56,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:56,280 INFO L225 Difference]: With dead ends: 1049 [2025-01-09 15:27:56,280 INFO L226 Difference]: Without dead ends: 680 [2025-01-09 15:27:56,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-01-09 15:27:56,281 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 83 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:56,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 628 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-01-09 15:27:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2025-01-09 15:27:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 606 states have (on average 1.2062706270627064) internal successors, (731), 611 states have internal predecessors, (731), 53 states have call successors, (53), 14 states have call predecessors, (53), 14 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 15:27:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 837 transitions. [2025-01-09 15:27:56,309 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 837 transitions. Word has length 191 [2025-01-09 15:27:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 837 transitions. [2025-01-09 15:27:56,310 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-01-09 15:27:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 837 transitions. [2025-01-09 15:27:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:56,311 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:56,311 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-01-09 15:27:56,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:27:56,311 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1741527950, now seen corresponding path program 1 times [2025-01-09 15:27:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11693249] [2025-01-09 15:27:56,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:56,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:56,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:56,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11693249] [2025-01-09 15:27:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11693249] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:27:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985559904] [2025-01-09 15:27:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:56,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:27:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:56,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:27:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:27:56,373 INFO L87 Difference]: Start difference. First operand 674 states and 837 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-01-09 15:27:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:56,415 INFO L93 Difference]: Finished difference Result 1354 states and 1683 transitions. [2025-01-09 15:27:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:27:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-01-09 15:27:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:56,418 INFO L225 Difference]: With dead ends: 1354 [2025-01-09 15:27:56,418 INFO L226 Difference]: Without dead ends: 683 [2025-01-09 15:27:56,419 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-01-09 15:27:56,419 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:56,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:27:56,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-01-09 15:27:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 680. [2025-01-09 15:27:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 612 states have (on average 1.1993464052287581) internal successors, (734), 617 states have internal predecessors, (734), 53 states have call successors, (53), 14 states have call predecessors, (53), 14 states have return successors, (53), 48 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 15:27:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 840 transitions. [2025-01-09 15:27:56,461 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 840 transitions. Word has length 191 [2025-01-09 15:27:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:56,461 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 840 transitions. [2025-01-09 15:27:56,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 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-01-09 15:27:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 840 transitions. [2025-01-09 15:27:56,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:56,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:56,463 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-01-09 15:27:56,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:27:56,464 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:56,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1348500940, now seen corresponding path program 1 times [2025-01-09 15:27:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:56,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914126557] [2025-01-09 15:27:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:56,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:56,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:56,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:56,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:56,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914126557] [2025-01-09 15:27:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914126557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:27:56,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869054722] [2025-01-09 15:27:56,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:56,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:56,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:56,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:56,799 INFO L87 Difference]: Start difference. First operand 680 states and 840 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-01-09 15:27:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:57,082 INFO L93 Difference]: Finished difference Result 1792 states and 2217 transitions. [2025-01-09 15:27:57,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:27:57,082 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-01-09 15:27:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:57,086 INFO L225 Difference]: With dead ends: 1792 [2025-01-09 15:27:57,086 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 15:27:57,087 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-01-09 15:27:57,087 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 146 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1308 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-01-09 15:27:57,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1308 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:27:57,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 15:27:57,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 914. [2025-01-09 15:27:57,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 832 states have (on average 1.1887019230769231) internal successors, (989), 838 states have internal predecessors, (989), 63 states have call successors, (63), 18 states have call predecessors, (63), 18 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 15:27:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1115 transitions. [2025-01-09 15:27:57,124 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1115 transitions. Word has length 191 [2025-01-09 15:27:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:57,124 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1115 transitions. [2025-01-09 15:27:57,124 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-01-09 15:27:57,124 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1115 transitions. [2025-01-09 15:27:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:57,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:57,126 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-01-09 15:27:57,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:27:57,126 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:57,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -410438188, now seen corresponding path program 1 times [2025-01-09 15:27:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:57,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57095131] [2025-01-09 15:27:57,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:57,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:57,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:57,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:57,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:57,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57095131] [2025-01-09 15:27:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57095131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:27:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851767167] [2025-01-09 15:27:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:27:57,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:57,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:27:57,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:27:57,929 INFO L87 Difference]: Start difference. First operand 914 states and 1115 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 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-01-09 15:27:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:58,402 INFO L93 Difference]: Finished difference Result 2081 states and 2538 transitions. [2025-01-09 15:27:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:27:58,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 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-01-09 15:27:58,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:58,406 INFO L225 Difference]: With dead ends: 2081 [2025-01-09 15:27:58,406 INFO L226 Difference]: Without dead ends: 1207 [2025-01-09 15:27:58,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:27:58,408 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 189 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:58,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1443 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:27:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2025-01-09 15:27:58,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1204. [2025-01-09 15:27:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1097 states have (on average 1.186873290793072) internal successors, (1302), 1106 states have internal predecessors, (1302), 81 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 72 states have call predecessors, (81), 81 states have call successors, (81) [2025-01-09 15:27:58,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1464 transitions. [2025-01-09 15:27:58,457 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1464 transitions. Word has length 191 [2025-01-09 15:27:58,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:58,458 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1464 transitions. [2025-01-09 15:27:58,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 10 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-01-09 15:27:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1464 transitions. [2025-01-09 15:27:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:58,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:58,460 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-01-09 15:27:58,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:27:58,460 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:58,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1439797486, now seen corresponding path program 1 times [2025-01-09 15:27:58,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944974671] [2025-01-09 15:27:58,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:58,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:58,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:58,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:58,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:27:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:27:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:27:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944974671] [2025-01-09 15:27:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944974671] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:27:59,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:27:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:27:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521326719] [2025-01-09 15:27:59,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:27:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:27:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:27:59,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:27:59,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:27:59,091 INFO L87 Difference]: Start difference. First operand 1204 states and 1464 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-01-09 15:27:59,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:27:59,544 INFO L93 Difference]: Finished difference Result 2496 states and 3043 transitions. [2025-01-09 15:27:59,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:27:59,544 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-01-09 15:27:59,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:27:59,551 INFO L225 Difference]: With dead ends: 2496 [2025-01-09 15:27:59,551 INFO L226 Difference]: Without dead ends: 1332 [2025-01-09 15:27:59,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 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-01-09 15:27:59,553 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 273 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:27:59,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1126 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:27:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-01-09 15:27:59,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1317. [2025-01-09 15:27:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1181 states have (on average 1.187129551227773) internal successors, (1402), 1193 states have internal predecessors, (1402), 103 states have call successors, (103), 32 states have call predecessors, (103), 32 states have return successors, (103), 91 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 15:27:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1608 transitions. [2025-01-09 15:27:59,636 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1608 transitions. Word has length 191 [2025-01-09 15:27:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:27:59,637 INFO L471 AbstractCegarLoop]: Abstraction has 1317 states and 1608 transitions. [2025-01-09 15:27:59,637 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-01-09 15:27:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1608 transitions. [2025-01-09 15:27:59,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-09 15:27:59,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:27:59,640 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-01-09 15:27:59,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:27:59,640 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:27:59,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:27:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1996030828, now seen corresponding path program 1 times [2025-01-09 15:27:59,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:27:59,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735597049] [2025-01-09 15:27:59,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:27:59,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:27:59,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 15:27:59,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 15:27:59,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:27:59,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:00,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:00,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:00,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735597049] [2025-01-09 15:28:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735597049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:00,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:28:00,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723590966] [2025-01-09 15:28:00,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:00,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:00,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:00,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:00,470 INFO L87 Difference]: Start difference. First operand 1317 states and 1608 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-01-09 15:28:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:01,007 INFO L93 Difference]: Finished difference Result 3423 states and 4206 transitions. [2025-01-09 15:28:01,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:28:01,008 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-01-09 15:28:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:01,015 INFO L225 Difference]: With dead ends: 3423 [2025-01-09 15:28:01,015 INFO L226 Difference]: Without dead ends: 2146 [2025-01-09 15:28:01,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:01,017 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 382 mSDsluCounter, 835 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:01,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1142 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2146 states. [2025-01-09 15:28:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2146 to 2007. [2025-01-09 15:28:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1770 states have (on average 1.1677966101694914) internal successors, (2067), 1790 states have internal predecessors, (2067), 180 states have call successors, (180), 56 states have call predecessors, (180), 56 states have return successors, (180), 160 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 15:28:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2427 transitions. [2025-01-09 15:28:01,127 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2427 transitions. Word has length 191 [2025-01-09 15:28:01,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:01,127 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 2427 transitions. [2025-01-09 15:28:01,127 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-01-09 15:28:01,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2427 transitions. [2025-01-09 15:28:01,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-09 15:28:01,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:01,130 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-01-09 15:28:01,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:28:01,130 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:01,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:01,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1099125207, now seen corresponding path program 1 times [2025-01-09 15:28:01,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:01,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053243500] [2025-01-09 15:28:01,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:01,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:01,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-09 15:28:01,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-09 15:28:01,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:01,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:02,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053243500] [2025-01-09 15:28:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053243500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:28:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604633730] [2025-01-09 15:28:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:28:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:28:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:28:02,426 INFO L87 Difference]: Start difference. First operand 2007 states and 2427 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-01-09 15:28:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:02,908 INFO L93 Difference]: Finished difference Result 4178 states and 5068 transitions. [2025-01-09 15:28:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:28:02,914 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-01-09 15:28:02,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:02,924 INFO L225 Difference]: With dead ends: 4178 [2025-01-09 15:28:02,924 INFO L226 Difference]: Without dead ends: 2211 [2025-01-09 15:28:02,926 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-01-09 15:28:02,929 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 59 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:02,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1510 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2025-01-09 15:28:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 1941. [2025-01-09 15:28:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1704 states have (on average 1.1678403755868545) internal successors, (1990), 1724 states have internal predecessors, (1990), 180 states have call successors, (180), 56 states have call predecessors, (180), 56 states have return successors, (180), 160 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 15:28:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2350 transitions. [2025-01-09 15:28:03,083 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2350 transitions. Word has length 192 [2025-01-09 15:28:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:03,087 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2350 transitions. [2025-01-09 15:28:03,087 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-01-09 15:28:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2350 transitions. [2025-01-09 15:28:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:03,088 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:03,089 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-01-09 15:28:03,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:28:03,089 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:03,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash 569021918, now seen corresponding path program 1 times [2025-01-09 15:28:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894103883] [2025-01-09 15:28:03,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:03,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:03,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:03,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:03,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:03,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894103883] [2025-01-09 15:28:03,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894103883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:03,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279895006] [2025-01-09 15:28:03,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:03,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:03,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:03,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:28:03,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:03,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:03,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:03,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:28:03,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:03,815 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-01-09 15:28:03,862 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-01-09 15:28:03,887 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-01-09 15:28:03,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 31 treesize of output 15 [2025-01-09 15:28:03,935 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-01-09 15:28:04,069 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-01-09 15:28:04,072 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-01-09 15:28:04,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,097 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-01-09 15:28:04,156 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 82 treesize of output 62 [2025-01-09 15:28:04,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,159 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 62 treesize of output 90 [2025-01-09 15:28:04,178 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 53 treesize of output 50 [2025-01-09 15:28:04,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,292 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 127 treesize of output 84 [2025-01-09 15:28:04,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:04,352 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 132 treesize of output 54 [2025-01-09 15:28:04,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-01-09 15:28:04,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:04,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279895006] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:04,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:04,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 17 [2025-01-09 15:28:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342355857] [2025-01-09 15:28:04,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:04,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:28:04,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:04,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:28:04,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:28:04,691 INFO L87 Difference]: Start difference. First operand 1941 states and 2350 transitions. Second operand has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-01-09 15:28:06,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:06,803 INFO L93 Difference]: Finished difference Result 3605 states and 4375 transitions. [2025-01-09 15:28:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-09 15:28:06,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) Word has length 193 [2025-01-09 15:28:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:06,808 INFO L225 Difference]: With dead ends: 3605 [2025-01-09 15:28:06,809 INFO L226 Difference]: Without dead ends: 1698 [2025-01-09 15:28:06,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 373 SyntacticMatches, 10 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=712, Invalid=3448, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 15:28:06,812 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 394 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:06,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 1417 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:28:06,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2025-01-09 15:28:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 858. [2025-01-09 15:28:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 762 states have (on average 1.1732283464566928) internal successors, (894), 768 states have internal predecessors, (894), 71 states have call successors, (71), 24 states have call predecessors, (71), 24 states have return successors, (71), 65 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 15:28:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1036 transitions. [2025-01-09 15:28:06,892 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1036 transitions. Word has length 193 [2025-01-09 15:28:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:06,892 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1036 transitions. [2025-01-09 15:28:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.857142857142858) internal successors, (138), 17 states have internal predecessors, (138), 6 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (63), 3 states have call predecessors, (63), 6 states have call successors, (63) [2025-01-09 15:28:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1036 transitions. [2025-01-09 15:28:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:06,894 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:06,894 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-01-09 15:28:06,903 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-01-09 15:28:07,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:07,095 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:07,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -172418782, now seen corresponding path program 1 times [2025-01-09 15:28:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:07,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918403914] [2025-01-09 15:28:07,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:07,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:07,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:07,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:07,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:07,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918403914] [2025-01-09 15:28:07,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918403914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:07,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251086637] [2025-01-09 15:28:07,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:07,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:07,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:07,655 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:07,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:28:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:07,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:07,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:07,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:07,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:28:07,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:07,916 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-01-09 15:28:07,940 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-01-09 15:28:08,085 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-01-09 15:28:08,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 15:28:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-01-09 15:28:08,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:08,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251086637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:08,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:08,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 21 [2025-01-09 15:28:08,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073085375] [2025-01-09 15:28:08,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:08,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 15:28:08,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:08,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 15:28:08,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:28:08,521 INFO L87 Difference]: Start difference. First operand 858 states and 1036 transitions. Second operand has 21 states, 19 states have (on average 5.842105263157895) internal successors, (111), 21 states have internal predecessors, (111), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 15:28:09,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:09,630 INFO L93 Difference]: Finished difference Result 1676 states and 2016 transitions. [2025-01-09 15:28:09,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 15:28:09,630 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.842105263157895) internal successors, (111), 21 states have internal predecessors, (111), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) Word has length 193 [2025-01-09 15:28:09,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:09,633 INFO L225 Difference]: With dead ends: 1676 [2025-01-09 15:28:09,633 INFO L226 Difference]: Without dead ends: 858 [2025-01-09 15:28:09,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 375 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=1249, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 15:28:09,635 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 899 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:09,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1072 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:28:09,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-01-09 15:28:09,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 785. [2025-01-09 15:28:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 666 states have (on average 1.162162162162162) internal successors, (774), 672 states have internal predecessors, (774), 86 states have call successors, (86), 32 states have call predecessors, (86), 32 states have return successors, (86), 80 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 15:28:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 946 transitions. [2025-01-09 15:28:09,692 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 946 transitions. Word has length 193 [2025-01-09 15:28:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:09,692 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 946 transitions. [2025-01-09 15:28:09,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.842105263157895) internal successors, (111), 21 states have internal predecessors, (111), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (38), 2 states have call predecessors, (38), 4 states have call successors, (38) [2025-01-09 15:28:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 946 transitions. [2025-01-09 15:28:09,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:09,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:09,693 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-01-09 15:28:09,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:09,894 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,SelfDestructingSolverStorable40 [2025-01-09 15:28:09,894 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:09,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:09,894 INFO L85 PathProgramCache]: Analyzing trace with hash -239886377, now seen corresponding path program 1 times [2025-01-09 15:28:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:09,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067851121] [2025-01-09 15:28:09,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:09,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:09,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:09,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:09,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:09,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:10,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-01-09 15:28:10,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:10,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067851121] [2025-01-09 15:28:10,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067851121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:10,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:10,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:28:10,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955840694] [2025-01-09 15:28:10,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:10,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:28:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:10,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:28:10,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:10,733 INFO L87 Difference]: Start difference. First operand 785 states and 946 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-01-09 15:28:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:11,215 INFO L93 Difference]: Finished difference Result 1793 states and 2154 transitions. [2025-01-09 15:28:11,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:28:11,216 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-01-09 15:28:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:11,220 INFO L225 Difference]: With dead ends: 1793 [2025-01-09 15:28:11,220 INFO L226 Difference]: Without dead ends: 1090 [2025-01-09 15:28:11,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 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-01-09 15:28:11,221 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 134 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:11,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1463 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:11,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-01-09 15:28:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 891. [2025-01-09 15:28:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 759 states have (on average 1.1594202898550725) internal successors, (880), 766 states have internal predecessors, (880), 94 states have call successors, (94), 37 states have call predecessors, (94), 37 states have return successors, (94), 87 states have call predecessors, (94), 94 states have call successors, (94) [2025-01-09 15:28:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1068 transitions. [2025-01-09 15:28:11,333 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1068 transitions. Word has length 193 [2025-01-09 15:28:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:11,333 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1068 transitions. [2025-01-09 15:28:11,333 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-01-09 15:28:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1068 transitions. [2025-01-09 15:28:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:11,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:11,335 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-01-09 15:28:11,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:28:11,335 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:11,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -632913387, now seen corresponding path program 1 times [2025-01-09 15:28:11,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:11,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774034565] [2025-01-09 15:28:11,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:11,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:11,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:11,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:11,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:11,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:11,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:11,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774034565] [2025-01-09 15:28:11,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774034565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:11,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:11,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:28:11,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528472852] [2025-01-09 15:28:11,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:11,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:28:11,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:28:11,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:28:11,792 INFO L87 Difference]: Start difference. First operand 891 states and 1068 transitions. Second operand has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 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-01-09 15:28:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:12,177 INFO L93 Difference]: Finished difference Result 1707 states and 2044 transitions. [2025-01-09 15:28:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:28:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 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-01-09 15:28:12,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:12,181 INFO L225 Difference]: With dead ends: 1707 [2025-01-09 15:28:12,181 INFO L226 Difference]: Without dead ends: 898 [2025-01-09 15:28:12,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:12,184 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 141 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:12,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1237 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:12,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2025-01-09 15:28:12,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 869. [2025-01-09 15:28:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 748 states have (on average 1.1577540106951871) internal successors, (866), 755 states have internal predecessors, (866), 83 states have call successors, (83), 37 states have call predecessors, (83), 37 states have return successors, (83), 76 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 15:28:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1032 transitions. [2025-01-09 15:28:12,278 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1032 transitions. Word has length 193 [2025-01-09 15:28:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1032 transitions. [2025-01-09 15:28:12,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 9 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-01-09 15:28:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1032 transitions. [2025-01-09 15:28:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:12,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:12,280 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-01-09 15:28:12,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:28:12,280 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash -374747949, now seen corresponding path program 1 times [2025-01-09 15:28:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716963480] [2025-01-09 15:28:12,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:12,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:12,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:12,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:12,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:12,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716963480] [2025-01-09 15:28:12,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716963480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:12,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:12,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:12,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190252750] [2025-01-09 15:28:12,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:12,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:12,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:12,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:12,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:12,721 INFO L87 Difference]: Start difference. First operand 869 states and 1032 transitions. Second operand has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-01-09 15:28:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:12,931 INFO L93 Difference]: Finished difference Result 1675 states and 1991 transitions. [2025-01-09 15:28:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:12,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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 193 [2025-01-09 15:28:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:12,934 INFO L225 Difference]: With dead ends: 1675 [2025-01-09 15:28:12,935 INFO L226 Difference]: Without dead ends: 862 [2025-01-09 15:28:12,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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-01-09 15:28:12,936 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 77 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:12,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 602 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-01-09 15:28:12,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 832. [2025-01-09 15:28:12,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 719 states have (on average 1.1502086230876216) internal successors, (827), 726 states have internal predecessors, (827), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 71 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:28:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 983 transitions. [2025-01-09 15:28:12,997 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 983 transitions. Word has length 193 [2025-01-09 15:28:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:12,997 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 983 transitions. [2025-01-09 15:28:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.2) internal successors, (81), 6 states have internal predecessors, (81), 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-01-09 15:28:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 983 transitions. [2025-01-09 15:28:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 15:28:12,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:12,998 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-01-09 15:28:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:28:12,998 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:12,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1286060642, now seen corresponding path program 1 times [2025-01-09 15:28:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:12,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319489965] [2025-01-09 15:28:12,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:12,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:13,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:13,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:13,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:13,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319489965] [2025-01-09 15:28:13,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319489965] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:13,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719271732] [2025-01-09 15:28:13,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:13,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:13,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:13,417 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:13,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:28:13,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 15:28:13,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 15:28:13,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:13,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 15:28:13,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:13,824 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-01-09 15:28:13,826 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-01-09 15:28:13,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:13,835 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 29 treesize of output 29 [2025-01-09 15:28:13,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:13,863 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-01-09 15:28:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 526 proven. 30 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-01-09 15:28:13,878 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:14,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719271732] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:14,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 13 [2025-01-09 15:28:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565833104] [2025-01-09 15:28:14,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:14,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:28:14,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:14,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:28:14,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:28:14,088 INFO L87 Difference]: Start difference. First operand 832 states and 983 transitions. Second operand has 13 states, 10 states have (on average 9.4) internal successors, (94), 13 states have internal predecessors, (94), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-01-09 15:28:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:14,668 INFO L93 Difference]: Finished difference Result 1273 states and 1494 transitions. [2025-01-09 15:28:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:28:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 9.4) internal successors, (94), 13 states have internal predecessors, (94), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) Word has length 193 [2025-01-09 15:28:14,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:14,671 INFO L225 Difference]: With dead ends: 1273 [2025-01-09 15:28:14,671 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 15:28:14,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 383 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:14,672 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 273 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:14,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 736 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 15:28:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 430. [2025-01-09 15:28:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 363 states have (on average 1.1267217630853994) internal successors, (409), 366 states have internal predecessors, (409), 46 states have call successors, (46), 20 states have call predecessors, (46), 20 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:28:14,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 501 transitions. [2025-01-09 15:28:14,708 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 501 transitions. Word has length 193 [2025-01-09 15:28:14,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:14,708 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 501 transitions. [2025-01-09 15:28:14,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 9.4) internal successors, (94), 13 states have internal predecessors, (94), 5 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (35), 2 states have call predecessors, (35), 5 states have call successors, (35) [2025-01-09 15:28:14,708 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 501 transitions. [2025-01-09 15:28:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-09 15:28:14,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:14,709 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-01-09 15:28:14,720 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-01-09 15:28:14,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-01-09 15:28:14,913 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:14,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1157799639, now seen corresponding path program 1 times [2025-01-09 15:28:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165852420] [2025-01-09 15:28:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:14,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 15:28:14,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 15:28:14,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:14,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:15,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:15,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165852420] [2025-01-09 15:28:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165852420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005899108] [2025-01-09 15:28:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:15,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:15,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:15,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:15,225 INFO L87 Difference]: Start difference. First operand 430 states and 501 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-01-09 15:28:15,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:15,429 INFO L93 Difference]: Finished difference Result 822 states and 959 transitions. [2025-01-09 15:28:15,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:15,430 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-01-09 15:28:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:15,435 INFO L225 Difference]: With dead ends: 822 [2025-01-09 15:28:15,435 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 15:28:15,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:15,436 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 200 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:15,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 311 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 15:28:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 15:28:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 363 states have (on average 1.118457300275482) internal successors, (406), 366 states have internal predecessors, (406), 46 states have call successors, (46), 20 states have call predecessors, (46), 20 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:28:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 498 transitions. [2025-01-09 15:28:15,501 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 498 transitions. Word has length 195 [2025-01-09 15:28:15,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:15,502 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 498 transitions. [2025-01-09 15:28:15,502 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-01-09 15:28:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 498 transitions. [2025-01-09 15:28:15,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 15:28:15,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:15,503 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-01-09 15:28:15,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:28:15,503 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:15,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1800914386, now seen corresponding path program 1 times [2025-01-09 15:28:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:15,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530053594] [2025-01-09 15:28:15,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:15,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:15,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:15,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:15,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:15,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:15,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:15,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530053594] [2025-01-09 15:28:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530053594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:15,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:15,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176381212] [2025-01-09 15:28:15,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:15,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:15,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:15,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:15,702 INFO L87 Difference]: Start difference. First operand 430 states and 498 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-01-09 15:28:15,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:15,871 INFO L93 Difference]: Finished difference Result 1158 states and 1337 transitions. [2025-01-09 15:28:15,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:15,871 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-01-09 15:28:15,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:15,874 INFO L225 Difference]: With dead ends: 1158 [2025-01-09 15:28:15,874 INFO L226 Difference]: Without dead ends: 766 [2025-01-09 15:28:15,877 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-01-09 15:28:15,877 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 88 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:15,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 884 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-01-09 15:28:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 763. [2025-01-09 15:28:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 650 states have (on average 1.1153846153846154) internal successors, (725), 656 states have internal predecessors, (725), 76 states have call successors, (76), 36 states have call predecessors, (76), 36 states have return successors, (76), 70 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 15:28:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 877 transitions. [2025-01-09 15:28:15,950 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 877 transitions. Word has length 197 [2025-01-09 15:28:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:15,951 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 877 transitions. [2025-01-09 15:28:15,951 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-01-09 15:28:15,951 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 877 transitions. [2025-01-09 15:28:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 15:28:15,952 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:15,952 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-01-09 15:28:15,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 15:28:15,952 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:15,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1120856016, now seen corresponding path program 1 times [2025-01-09 15:28:15,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:15,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114284941] [2025-01-09 15:28:15,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:15,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:15,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:15,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:15,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:15,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:16,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114284941] [2025-01-09 15:28:16,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114284941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:16,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313107764] [2025-01-09 15:28:16,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:16,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:16,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:16,354 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:16,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 15:28:16,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:16,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:16,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:16,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:16,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:28:16,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:16,603 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-01-09 15:28:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:16,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:16,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313107764] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:16,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:28:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 11] total 17 [2025-01-09 15:28:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395231957] [2025-01-09 15:28:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:28:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:16,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:28:16,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:28:16,841 INFO L87 Difference]: Start difference. First operand 763 states and 877 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-01-09 15:28:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:17,100 INFO L93 Difference]: Finished difference Result 1559 states and 1795 transitions. [2025-01-09 15:28:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:28:17,101 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-01-09 15:28:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:17,106 INFO L225 Difference]: With dead ends: 1559 [2025-01-09 15:28:17,106 INFO L226 Difference]: Without dead ends: 834 [2025-01-09 15:28:17,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:17,108 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 130 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:17,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1872 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-01-09 15:28:17,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 781. [2025-01-09 15:28:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 660 states have (on average 1.1090909090909091) internal successors, (732), 666 states have internal predecessors, (732), 83 states have call successors, (83), 37 states have call predecessors, (83), 37 states have return successors, (83), 77 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 15:28:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 898 transitions. [2025-01-09 15:28:17,174 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 898 transitions. Word has length 197 [2025-01-09 15:28:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:17,174 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 898 transitions. [2025-01-09 15:28:17,174 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-01-09 15:28:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 898 transitions. [2025-01-09 15:28:17,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 15:28:17,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:17,175 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-01-09 15:28:17,183 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-01-09 15:28:17,376 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,SelfDestructingSolverStorable47 [2025-01-09 15:28:17,376 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 2070406188, now seen corresponding path program 1 times [2025-01-09 15:28:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:17,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699900786] [2025-01-09 15:28:17,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:17,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:17,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:17,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:17,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699900786] [2025-01-09 15:28:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699900786] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253317044] [2025-01-09 15:28:17,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:17,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:17,899 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-01-09 15:28:17,904 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-01-09 15:28:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:18,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:18,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:18,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:18,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 15:28:18,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:18,156 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-01-09 15:28:18,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:18,450 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-01-09 15:28:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:18,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:18,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-01-09 15:28:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253317044] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:28:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 11] total 17 [2025-01-09 15:28:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884853906] [2025-01-09 15:28:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:28:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:18,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:28:18,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:28:18,927 INFO L87 Difference]: Start difference. First operand 781 states and 898 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-01-09 15:28:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:19,277 INFO L93 Difference]: Finished difference Result 1573 states and 1806 transitions. [2025-01-09 15:28:19,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:28:19,278 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-01-09 15:28:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:19,281 INFO L225 Difference]: With dead ends: 1573 [2025-01-09 15:28:19,281 INFO L226 Difference]: Without dead ends: 830 [2025-01-09 15:28:19,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:28:19,282 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 95 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1873 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:19,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1873 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-01-09 15:28:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 827. [2025-01-09 15:28:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 694 states have (on average 1.1037463976945245) internal successors, (766), 700 states have internal predecessors, (766), 90 states have call successors, (90), 42 states have call predecessors, (90), 42 states have return successors, (90), 84 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 15:28:19,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 946 transitions. [2025-01-09 15:28:19,373 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 946 transitions. Word has length 197 [2025-01-09 15:28:19,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:19,374 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 946 transitions. [2025-01-09 15:28:19,374 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-01-09 15:28:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 946 transitions. [2025-01-09 15:28:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-01-09 15:28:19,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:19,375 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-01-09 15:28:19,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 15:28:19,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:19,576 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:19,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:19,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1544502738, now seen corresponding path program 1 times [2025-01-09 15:28:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91186306] [2025-01-09 15:28:19,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:19,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 15:28:19,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 15:28:19,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:19,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:19,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-01-09 15:28:19,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:19,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91186306] [2025-01-09 15:28:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91186306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:19,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214202570] [2025-01-09 15:28:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:19,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:19,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:19,783 INFO L87 Difference]: Start difference. First operand 827 states and 946 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-01-09 15:28:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:19,951 INFO L93 Difference]: Finished difference Result 1580 states and 1805 transitions. [2025-01-09 15:28:19,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:19,951 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-01-09 15:28:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:19,954 INFO L225 Difference]: With dead ends: 1580 [2025-01-09 15:28:19,954 INFO L226 Difference]: Without dead ends: 821 [2025-01-09 15:28:19,955 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-01-09 15:28:19,955 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 89 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:19,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 917 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2025-01-09 15:28:19,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 604. [2025-01-09 15:28:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 536 states have (on average 1.1063432835820894) internal successors, (593), 539 states have internal predecessors, (593), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:28:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 685 transitions. [2025-01-09 15:28:19,998 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 685 transitions. Word has length 197 [2025-01-09 15:28:19,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:19,998 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 685 transitions. [2025-01-09 15:28:19,998 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-01-09 15:28:19,998 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 685 transitions. [2025-01-09 15:28:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 15:28:19,999 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:19,999 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-01-09 15:28:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-01-09 15:28:20,000 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:20,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -598456926, now seen corresponding path program 1 times [2025-01-09 15:28:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986586331] [2025-01-09 15:28:20,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:20,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 15:28:20,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 15:28:20,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:20,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986586331] [2025-01-09 15:28:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986586331] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094091976] [2025-01-09 15:28:20,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:20,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:20,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:20,462 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-01-09 15:28:20,464 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-01-09 15:28:20,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 15:28:20,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 15:28:20,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:20,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:20,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 15:28:20,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:20,752 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-01-09 15:28:20,790 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-01-09 15:28:20,810 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-01-09 15:28:20,831 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-01-09 15:28:20,853 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-01-09 15:28:21,000 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-01-09 15:28:21,002 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-01-09 15:28:21,025 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-01-09 15:28:21,067 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 82 treesize of output 62 [2025-01-09 15:28:21,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,072 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 62 treesize of output 90 [2025-01-09 15:28:21,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 50 [2025-01-09 15:28:21,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,210 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 127 treesize of output 75 [2025-01-09 15:28:21,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:21,536 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 137 treesize of output 65 [2025-01-09 15:28:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 256 proven. 57 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-01-09 15:28:21,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:21,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:21,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094091976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:21,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:21,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 7] total 13 [2025-01-09 15:28:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413379986] [2025-01-09 15:28:21,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:21,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:28:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:21,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:28:21,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:28:21,823 INFO L87 Difference]: Start difference. First operand 604 states and 685 transitions. Second operand has 13 states, 11 states have (on average 13.818181818181818) internal successors, (152), 13 states have internal predecessors, (152), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 2 states have call predecessors, (43), 4 states have call successors, (43) [2025-01-09 15:28:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:22,277 INFO L93 Difference]: Finished difference Result 1133 states and 1281 transitions. [2025-01-09 15:28:22,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:28:22,283 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 13.818181818181818) internal successors, (152), 13 states have internal predecessors, (152), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 2 states have call predecessors, (43), 4 states have call successors, (43) Word has length 199 [2025-01-09 15:28:22,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:22,285 INFO L225 Difference]: With dead ends: 1133 [2025-01-09 15:28:22,286 INFO L226 Difference]: Without dead ends: 567 [2025-01-09 15:28:22,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 390 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:28:22,288 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 125 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:22,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 528 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-01-09 15:28:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 537. [2025-01-09 15:28:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 469 states have (on average 1.1002132196162047) internal successors, (516), 472 states have internal predecessors, (516), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:28:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 608 transitions. [2025-01-09 15:28:22,344 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 608 transitions. Word has length 199 [2025-01-09 15:28:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:22,344 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 608 transitions. [2025-01-09 15:28:22,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 13.818181818181818) internal successors, (152), 13 states have internal predecessors, (152), 4 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (43), 2 states have call predecessors, (43), 4 states have call successors, (43) [2025-01-09 15:28:22,345 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 608 transitions. [2025-01-09 15:28:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 15:28:22,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:22,346 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-01-09 15:28:22,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:22,550 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:22,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 757532523, now seen corresponding path program 1 times [2025-01-09 15:28:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739666977] [2025-01-09 15:28:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 15:28:22,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 15:28:22,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:22,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:22,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739666977] [2025-01-09 15:28:22,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739666977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:22,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:22,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:28:22,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059738566] [2025-01-09 15:28:22,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:22,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:28:22,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:22,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:28:22,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:28:22,957 INFO L87 Difference]: Start difference. First operand 537 states and 608 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-01-09 15:28:23,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:23,389 INFO L93 Difference]: Finished difference Result 930 states and 1055 transitions. [2025-01-09 15:28:23,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:28:23,390 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-01-09 15:28:23,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:23,393 INFO L225 Difference]: With dead ends: 930 [2025-01-09 15:28:23,393 INFO L226 Difference]: Without dead ends: 928 [2025-01-09 15:28:23,393 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-01-09 15:28:23,393 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 137 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:23,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1413 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-09 15:28:23,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 702. [2025-01-09 15:28:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 634 states have (on average 1.088328075709779) internal successors, (690), 637 states have internal predecessors, (690), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:28:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 782 transitions. [2025-01-09 15:28:23,439 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 782 transitions. Word has length 202 [2025-01-09 15:28:23,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:23,440 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 782 transitions. [2025-01-09 15:28:23,440 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-01-09 15:28:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 782 transitions. [2025-01-09 15:28:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:23,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:23,441 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-01-09 15:28:23,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 15:28:23,441 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:23,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:23,441 INFO L85 PathProgramCache]: Analyzing trace with hash 594077456, now seen corresponding path program 1 times [2025-01-09 15:28:23,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:23,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12043982] [2025-01-09 15:28:23,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:23,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:23,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:23,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:23,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:23,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:23,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12043982] [2025-01-09 15:28:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12043982] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987871968] [2025-01-09 15:28:23,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:23,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:23,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:23,820 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-01-09 15:28:23,823 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-01-09 15:28:24,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:24,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:24,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:24,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:24,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:28:24,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:24,113 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-01-09 15:28:24,137 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-01-09 15:28:24,157 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-01-09 15:28:24,272 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 41 treesize of output 23 [2025-01-09 15:28:24,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 456 proven. 45 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2025-01-09 15:28:24,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:24,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987871968] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:24,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:24,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-01-09 15:28:24,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599286721] [2025-01-09 15:28:24,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:24,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:28:24,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:24,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:28:24,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:28:24,487 INFO L87 Difference]: Start difference. First operand 702 states and 782 transitions. Second operand has 12 states, 10 states have (on average 10.2) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 2 states have call predecessors, (39), 4 states have call successors, (39) [2025-01-09 15:28:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:24,862 INFO L93 Difference]: Finished difference Result 1209 states and 1342 transitions. [2025-01-09 15:28:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:28:24,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 10.2) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 2 states have call predecessors, (39), 4 states have call successors, (39) Word has length 204 [2025-01-09 15:28:24,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:24,865 INFO L225 Difference]: With dead ends: 1209 [2025-01-09 15:28:24,865 INFO L226 Difference]: Without dead ends: 545 [2025-01-09 15:28:24,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 406 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:28:24,866 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 176 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:24,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 591 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:24,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-01-09 15:28:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 382. [2025-01-09 15:28:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 347 states have (on average 1.0979827089337175) internal successors, (381), 347 states have internal predecessors, (381), 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-01-09 15:28:24,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 427 transitions. [2025-01-09 15:28:24,891 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 427 transitions. Word has length 204 [2025-01-09 15:28:24,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:24,892 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 427 transitions. [2025-01-09 15:28:24,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 10.2) internal successors, (102), 12 states have internal predecessors, (102), 4 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (39), 2 states have call predecessors, (39), 4 states have call successors, (39) [2025-01-09 15:28:24,892 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 427 transitions. [2025-01-09 15:28:24,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:24,893 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:24,893 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-01-09 15:28:24,901 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-01-09 15:28:25,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:25,094 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:25,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash 903964624, now seen corresponding path program 1 times [2025-01-09 15:28:25,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:25,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317435340] [2025-01-09 15:28:25,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:25,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:25,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:25,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:25,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:25,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:25,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:25,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317435340] [2025-01-09 15:28:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317435340] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170425061] [2025-01-09 15:28:25,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:25,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:25,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:25,746 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-01-09 15:28:25,747 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-01-09 15:28:25,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:26,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:26,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:26,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 15:28:26,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:26,052 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-01-09 15:28:26,072 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-01-09 15:28:26,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 29 treesize of output 13 [2025-01-09 15:28:26,113 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-01-09 15:28:26,133 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-01-09 15:28:26,154 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-01-09 15:28:26,277 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-01-09 15:28:26,302 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-01-09 15:28:26,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:26,305 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-01-09 15:28:26,319 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-01-09 15:28:26,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:26,391 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 77 treesize of output 51 [2025-01-09 15:28:26,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-01-09 15:28:26,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:26,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170425061] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:26,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:26,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 18 [2025-01-09 15:28:26,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830230066] [2025-01-09 15:28:26,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:26,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:28:26,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:28:26,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:28:26,721 INFO L87 Difference]: Start difference. First operand 382 states and 427 transitions. Second operand has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 15:28:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:27,362 INFO L93 Difference]: Finished difference Result 948 states and 1055 transitions. [2025-01-09 15:28:27,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 15:28:27,362 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) Word has length 204 [2025-01-09 15:28:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:27,364 INFO L225 Difference]: With dead ends: 948 [2025-01-09 15:28:27,364 INFO L226 Difference]: Without dead ends: 569 [2025-01-09 15:28:27,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 403 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=206, Invalid=786, Unknown=0, NotChecked=0, Total=992 [2025-01-09 15:28:27,365 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 420 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:27,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 800 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:28:27,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-01-09 15:28:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 376. [2025-01-09 15:28:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 341 states have (on average 1.093841642228739) internal successors, (373), 341 states have internal predecessors, (373), 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-01-09 15:28:27,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 419 transitions. [2025-01-09 15:28:27,392 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 419 transitions. Word has length 204 [2025-01-09 15:28:27,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:27,393 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 419 transitions. [2025-01-09 15:28:27,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.0625) internal successors, (129), 18 states have internal predecessors, (129), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 15:28:27,393 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 419 transitions. [2025-01-09 15:28:27,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:27,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:27,394 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-01-09 15:28:27,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:27,594 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-01-09 15:28:27,595 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:27,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:27,595 INFO L85 PathProgramCache]: Analyzing trace with hash 191688848, now seen corresponding path program 1 times [2025-01-09 15:28:27,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:27,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734512986] [2025-01-09 15:28:27,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:27,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:27,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:27,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:27,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:27,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:28,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:28,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734512986] [2025-01-09 15:28:28,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734512986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:28,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:28:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857718530] [2025-01-09 15:28:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:28,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:28:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:28,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:28:28,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:28:28,268 INFO L87 Difference]: Start difference. First operand 376 states and 419 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-01-09 15:28:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:28,928 INFO L93 Difference]: Finished difference Result 529 states and 588 transitions. [2025-01-09 15:28:28,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:28:28,932 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-01-09 15:28:28,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:28,933 INFO L225 Difference]: With dead ends: 529 [2025-01-09 15:28:28,933 INFO L226 Difference]: Without dead ends: 527 [2025-01-09 15:28:28,934 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-01-09 15:28:28,934 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 130 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:28,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 2295 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:28:28,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-01-09 15:28:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 405. [2025-01-09 15:28:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 370 states have (on average 1.0918918918918918) internal successors, (404), 370 states have internal predecessors, (404), 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-01-09 15:28:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 450 transitions. [2025-01-09 15:28:28,988 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 450 transitions. Word has length 204 [2025-01-09 15:28:28,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:28,989 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 450 transitions. [2025-01-09 15:28:28,989 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-01-09 15:28:28,989 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 450 transitions. [2025-01-09 15:28:28,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:28,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:28,990 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-01-09 15:28:28,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 15:28:28,991 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:28,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:28,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1966696210, now seen corresponding path program 1 times [2025-01-09 15:28:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:28,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627496331] [2025-01-09 15:28:28,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:28,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:29,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:29,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:29,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:29,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627496331] [2025-01-09 15:28:29,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627496331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113228269] [2025-01-09 15:28:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:29,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:29,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:29,218 INFO L87 Difference]: Start difference. First operand 405 states and 450 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-01-09 15:28:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:29,334 INFO L93 Difference]: Finished difference Result 865 states and 959 transitions. [2025-01-09 15:28:29,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:29,335 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-01-09 15:28:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:29,337 INFO L225 Difference]: With dead ends: 865 [2025-01-09 15:28:29,337 INFO L226 Difference]: Without dead ends: 463 [2025-01-09 15:28:29,337 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-01-09 15:28:29,337 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 49 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:29,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 406 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-09 15:28:29,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 433. [2025-01-09 15:28:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 398 states have (on average 1.085427135678392) internal successors, (432), 398 states have internal predecessors, (432), 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-01-09 15:28:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 478 transitions. [2025-01-09 15:28:29,368 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 478 transitions. Word has length 204 [2025-01-09 15:28:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:29,368 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 478 transitions. [2025-01-09 15:28:29,368 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-01-09 15:28:29,368 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 478 transitions. [2025-01-09 15:28:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:29,372 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:29,373 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-01-09 15:28:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-01-09 15:28:29,373 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -431545009, now seen corresponding path program 1 times [2025-01-09 15:28:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293953755] [2025-01-09 15:28:29,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:29,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:29,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:29,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293953755] [2025-01-09 15:28:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293953755] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:28:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142130210] [2025-01-09 15:28:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:29,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:28:29,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:29,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:28:29,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:29,799 INFO L87 Difference]: Start difference. First operand 433 states and 478 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-01-09 15:28:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:30,111 INFO L93 Difference]: Finished difference Result 1109 states and 1233 transitions. [2025-01-09 15:28:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:28:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-01-09 15:28:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:30,114 INFO L225 Difference]: With dead ends: 1109 [2025-01-09 15:28:30,114 INFO L226 Difference]: Without dead ends: 679 [2025-01-09 15:28:30,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:30,115 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 293 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:30,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 967 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-01-09 15:28:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 425. [2025-01-09 15:28:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 390 states have (on average 1.082051282051282) internal successors, (422), 390 states have internal predecessors, (422), 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-01-09 15:28:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 468 transitions. [2025-01-09 15:28:30,144 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 468 transitions. Word has length 204 [2025-01-09 15:28:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 468 transitions. [2025-01-09 15:28:30,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 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-01-09 15:28:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 468 transitions. [2025-01-09 15:28:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:30,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:30,146 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-01-09 15:28:30,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-01-09 15:28:30,146 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1174049619, now seen corresponding path program 1 times [2025-01-09 15:28:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:30,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275893944] [2025-01-09 15:28:30,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:30,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:30,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:30,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:30,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:30,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275893944] [2025-01-09 15:28:30,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275893944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126000528] [2025-01-09 15:28:30,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:30,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:30,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:30,779 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-01-09 15:28:30,780 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-01-09 15:28:31,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:31,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:31,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:31,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:31,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 15:28:31,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:31,084 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-01-09 15:28:31,102 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-01-09 15:28:31,121 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-01-09 15:28:31,141 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-01-09 15:28:31,161 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-01-09 15:28:31,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 29 treesize of output 13 [2025-01-09 15:28:31,297 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-01-09 15:28:31,299 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-01-09 15:28:31,309 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-01-09 15:28:31,347 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 78 treesize of output 58 [2025-01-09 15:28:31,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:31,351 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 58 treesize of output 86 [2025-01-09 15:28:31,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:31,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 49 treesize of output 48 [2025-01-09 15:28:31,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:31,501 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 117 treesize of output 82 [2025-01-09 15:28:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 63 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-01-09 15:28:31,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 3 proven. 63 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126000528] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:31,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 15 [2025-01-09 15:28:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479694114] [2025-01-09 15:28:31,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:31,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:28:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:28:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:28:31,822 INFO L87 Difference]: Start difference. First operand 425 states and 468 transitions. Second operand has 15 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 15:28:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:32,676 INFO L93 Difference]: Finished difference Result 1146 states and 1267 transitions. [2025-01-09 15:28:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 15:28:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) Word has length 204 [2025-01-09 15:28:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:32,679 INFO L225 Difference]: With dead ends: 1146 [2025-01-09 15:28:32,679 INFO L226 Difference]: Without dead ends: 724 [2025-01-09 15:28:32,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 402 SyntacticMatches, 11 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2025-01-09 15:28:32,680 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 359 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:32,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1075 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:28:32,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-09 15:28:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 425. [2025-01-09 15:28:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 390 states have (on average 1.082051282051282) internal successors, (422), 390 states have internal predecessors, (422), 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-01-09 15:28:32,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 468 transitions. [2025-01-09 15:28:32,722 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 468 transitions. Word has length 204 [2025-01-09 15:28:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:32,722 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 468 transitions. [2025-01-09 15:28:32,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.846153846153847) internal successors, (115), 15 states have internal predecessors, (115), 4 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (45), 2 states have call predecessors, (45), 4 states have call successors, (45) [2025-01-09 15:28:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 468 transitions. [2025-01-09 15:28:32,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:32,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:32,724 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-01-09 15:28:32,731 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-01-09 15:28:32,924 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,SelfDestructingSolverStorable57 [2025-01-09 15:28:32,924 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1422196113, now seen corresponding path program 1 times [2025-01-09 15:28:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882971784] [2025-01-09 15:28:32,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:32,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:32,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:32,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:33,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-01-09 15:28:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882971784] [2025-01-09 15:28:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882971784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:33,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:33,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365489552] [2025-01-09 15:28:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:33,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:33,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:33,431 INFO L87 Difference]: Start difference. First operand 425 states and 468 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-01-09 15:28:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:33,577 INFO L93 Difference]: Finished difference Result 798 states and 880 transitions. [2025-01-09 15:28:33,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:33,578 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-01-09 15:28:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:33,579 INFO L225 Difference]: With dead ends: 798 [2025-01-09 15:28:33,579 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 15:28:33,580 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-01-09 15:28:33,580 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:33,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 593 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 15:28:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 353. [2025-01-09 15:28:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 318 states have (on average 1.0754716981132075) internal successors, (342), 318 states have internal predecessors, (342), 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-01-09 15:28:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 388 transitions. [2025-01-09 15:28:33,610 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 388 transitions. Word has length 204 [2025-01-09 15:28:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:33,610 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 388 transitions. [2025-01-09 15:28:33,610 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-01-09 15:28:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 388 transitions. [2025-01-09 15:28:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:33,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:33,615 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-01-09 15:28:33,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-01-09 15:28:33,615 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:33,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:33,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1369825328, now seen corresponding path program 1 times [2025-01-09 15:28:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844363494] [2025-01-09 15:28:33,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:33,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:33,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:33,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:33,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:33,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 15:28:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:33,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844363494] [2025-01-09 15:28:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844363494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:28:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329794548] [2025-01-09 15:28:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:33,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:28:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:33,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:28:33,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:28:33,946 INFO L87 Difference]: Start difference. First operand 353 states and 388 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-01-09 15:28:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:34,085 INFO L93 Difference]: Finished difference Result 726 states and 798 transitions. [2025-01-09 15:28:34,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:28:34,085 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-01-09 15:28:34,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:34,087 INFO L225 Difference]: With dead ends: 726 [2025-01-09 15:28:34,087 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 15:28:34,087 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-01-09 15:28:34,088 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 26 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:34,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 606 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:28:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 15:28:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 353. [2025-01-09 15:28:34,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 318 states have (on average 1.0723270440251573) internal successors, (341), 318 states have internal predecessors, (341), 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-01-09 15:28:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 387 transitions. [2025-01-09 15:28:34,118 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 387 transitions. Word has length 204 [2025-01-09 15:28:34,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:34,119 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 387 transitions. [2025-01-09 15:28:34,119 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-01-09 15:28:34,119 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 387 transitions. [2025-01-09 15:28:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 15:28:34,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:34,120 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-01-09 15:28:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-01-09 15:28:34,120 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:34,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:34,120 INFO L85 PathProgramCache]: Analyzing trace with hash 405182034, now seen corresponding path program 1 times [2025-01-09 15:28:34,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:34,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094029549] [2025-01-09 15:28:34,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:34,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:34,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:34,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:34,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:34,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:34,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:34,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094029549] [2025-01-09 15:28:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094029549] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132285899] [2025-01-09 15:28:34,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:34,502 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:34,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 15:28:34,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 15:28:34,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 15:28:34,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:34,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 15:28:34,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:34,798 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-01-09 15:28:34,809 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-01-09 15:28:34,827 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-01-09 15:28:34,845 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-01-09 15:28:34,864 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-01-09 15:28:34,962 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 41 treesize of output 23 [2025-01-09 15:28:34,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-01-09 15:28:34,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 15:28:35,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132285899] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:35,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:35,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-09 15:28:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804612732] [2025-01-09 15:28:35,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:35,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:28:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:35,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:28:35,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:28:35,160 INFO L87 Difference]: Start difference. First operand 353 states and 387 transitions. Second operand has 10 states, 8 states have (on average 12.75) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2025-01-09 15:28:35,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:35,471 INFO L93 Difference]: Finished difference Result 551 states and 605 transitions. [2025-01-09 15:28:35,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:28:35,471 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 12.75) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) Word has length 204 [2025-01-09 15:28:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:35,472 INFO L225 Difference]: With dead ends: 551 [2025-01-09 15:28:35,472 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 15:28:35,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 406 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:28:35,473 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 137 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:35,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 332 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 15:28:35,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 15:28:35,473 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-01-09 15:28:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 15:28:35,474 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-01-09 15:28:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:35,474 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 15:28:35,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 12.75) internal successors, (102), 10 states have internal predecessors, (102), 4 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (41), 2 states have call predecessors, (41), 4 states have call successors, (41) [2025-01-09 15:28:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 15:28:35,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 15:28:35,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:28:35,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 15:28:35,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:35,680 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, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:35,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.