./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:33:24,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:33:24,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:33:24,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:33:24,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:33:24,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:33:24,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:33:24,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:33:24,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:33:24,475 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:33:24,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:33:24,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:33:24,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:33:24,476 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:33:24,476 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:33:24,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:33:24,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:33:24,476 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:33:24,477 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:33:24,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:24,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:33:24,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:33:24,478 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/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 -> 5e929c4003dd56b80bb766773f31b5c9376f023636b5de2c888cd8fd3433b56e [2025-03-04 01:33:24,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:33:24,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:33:24,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:33:24,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:33:24,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:33:24,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i [2025-03-04 01:33:25,821 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d654aaed/b61d18c479164e5d817c414d88566c8c/FLAGf9a989d4e [2025-03-04 01:33:26,070 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:33:26,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i [2025-03-04 01:33:26,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d654aaed/b61d18c479164e5d817c414d88566c8c/FLAGf9a989d4e [2025-03-04 01:33:26,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d654aaed/b61d18c479164e5d817c414d88566c8c [2025-03-04 01:33:26,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:33:26,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:33:26,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:26,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:33:26,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:33:26,398 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26, skipping insertion in model container [2025-03-04 01:33:26,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,410 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:33:26,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i[916,929] [2025-03-04 01:33:26,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:26,558 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:33:26,565 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-85.i[916,929] [2025-03-04 01:33:26,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:26,596 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:33:26,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26 WrapperNode [2025-03-04 01:33:26,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:26,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:26,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:33:26,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:33:26,603 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,658 INFO L138 Inliner]: procedures = 26, calls = 190, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 558 [2025-03-04 01:33:26,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:26,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:33:26,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:33:26,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:33:26,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,692 INFO L175 MemorySlicer]: Split 139 memory accesses to 18 slices as follows [2, 7, 15, 14, 5, 8, 10, 6, 8, 5, 6, 6, 6, 9, 10, 6, 9, 7]. 11 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 22 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1]. [2025-03-04 01:33:26,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:33:26,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:33:26,714 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:33:26,714 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:33:26,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (1/1) ... [2025-03-04 01:33:26,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:26,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:26,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:33:26,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:33:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-03-04 01:33:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:33:26,769 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-03-04 01:33:26,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:33:26,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:33:26,906 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:33:26,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:33:27,342 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem80#1;havoc property_#t~ite93#1;havoc property_#t~mem86#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem90#1;havoc property_#t~mem101#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1;havoc property_#t~mem110#1;havoc property_#t~mem106#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short105#1;havoc property_#t~short107#1;havoc property_#t~mem108#1;havoc property_#t~short109#1;havoc property_#t~short111#1;havoc property_#t~mem117#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite127#1;havoc property_#t~mem123#1;havoc property_#t~mem120#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite141#1;havoc property_#t~mem133#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-04 01:33:27,398 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2025-03-04 01:33:27,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:33:27,411 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:33:27,411 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:33:27,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:27 BoogieIcfgContainer [2025-03-04 01:33:27,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:33:27,413 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:33:27,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:33:27,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:33:27,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:33:26" (1/3) ... [2025-03-04 01:33:27,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a7de4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:27, skipping insertion in model container [2025-03-04 01:33:27,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:26" (2/3) ... [2025-03-04 01:33:27,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a7de4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:27, skipping insertion in model container [2025-03-04 01:33:27,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:27" (3/3) ... [2025-03-04 01:33:27,419 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-85.i [2025-03-04 01:33:27,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:33:27,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-85.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:33:27,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:33:27,493 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;@7d7cbcf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:33:27,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:33:27,496 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-03-04 01:33:27,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:33:27,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:27,507 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-03-04 01:33:27,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:27,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:27,513 INFO L85 PathProgramCache]: Analyzing trace with hash -378510325, now seen corresponding path program 1 times [2025-03-04 01:33:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:27,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684817120] [2025-03-04 01:33:27,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:27,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:27,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:33:27,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:33:27,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:27,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:33:27,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:27,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684817120] [2025-03-04 01:33:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684817120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188078343] [2025-03-04 01:33:27,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:27,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:27,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:27,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:27,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:33:27,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:33:28,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:33:28,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:28,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:28,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:33:28,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 01:33:28,080 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188078343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:28,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:28,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:33:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031804420] [2025-03-04 01:33:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:28,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:33:28,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:28,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:33:28,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:28,099 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-03-04 01:33:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:28,127 INFO L93 Difference]: Finished difference Result 254 states and 396 transitions. [2025-03-04 01:33:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:33:28,129 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-03-04 01:33:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:28,134 INFO L225 Difference]: With dead ends: 254 [2025-03-04 01:33:28,134 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:33:28,137 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-03-04 01:33:28,138 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-03-04 01:33:28,139 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-03-04 01:33:28,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:33:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 01:33:28,169 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-03-04 01:33:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 184 transitions. [2025-03-04 01:33:28,175 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 184 transitions. Word has length 179 [2025-03-04 01:33:28,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:28,176 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 184 transitions. [2025-03-04 01:33:28,176 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-03-04 01:33:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 184 transitions. [2025-03-04 01:33:28,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:33:28,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:28,181 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-03-04 01:33:28,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:28,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:33:28,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:28,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:28,383 INFO L85 PathProgramCache]: Analyzing trace with hash -308756012, now seen corresponding path program 1 times [2025-03-04 01:33:28,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:28,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706852616] [2025-03-04 01:33:28,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:28,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:33:28,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:33:28,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:28,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:28,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706852616] [2025-03-04 01:33:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706852616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445507107] [2025-03-04 01:33:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:28,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:28,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:28,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:28,733 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-03-04 01:33:28,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:28,761 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2025-03-04 01:33:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:28,762 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-03-04 01:33:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:28,763 INFO L225 Difference]: With dead ends: 254 [2025-03-04 01:33:28,764 INFO L226 Difference]: Without dead ends: 130 [2025-03-04 01:33:28,764 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-03-04 01:33:28,765 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-03-04 01:33:28,765 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-03-04 01:33:28,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-04 01:33:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2025-03-04 01:33:28,775 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-03-04 01:33:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 186 transitions. [2025-03-04 01:33:28,779 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 186 transitions. Word has length 179 [2025-03-04 01:33:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:28,781 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 186 transitions. [2025-03-04 01:33:28,782 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-03-04 01:33:28,783 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2025-03-04 01:33:28,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:33:28,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:28,788 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-03-04 01:33:28,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:33:28,788 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:28,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:28,789 INFO L85 PathProgramCache]: Analyzing trace with hash -297439885, now seen corresponding path program 1 times [2025-03-04 01:33:28,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:28,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-03-04 01:33:28,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:28,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:33:28,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:33:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:28,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:29,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509701515] [2025-03-04 01:33:29,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509701515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226672765] [2025-03-04 01:33:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:29,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:29,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:29,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:29,206 INFO L87 Difference]: Start difference. First operand 129 states and 186 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:29,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:29,379 INFO L93 Difference]: Finished difference Result 374 states and 541 transitions. [2025-03-04 01:33:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:29,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2025-03-04 01:33:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:29,382 INFO L225 Difference]: With dead ends: 374 [2025-03-04 01:33:29,382 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 01:33:29,385 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-03-04 01:33:29,386 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 167 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:29,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 961 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 01:33:29,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 131. [2025-03-04 01:33:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:33:29,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 188 transitions. [2025-03-04 01:33:29,406 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 188 transitions. Word has length 179 [2025-03-04 01:33:29,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:29,406 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 188 transitions. [2025-03-04 01:33:29,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:29,406 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 188 transitions. [2025-03-04 01:33:29,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-04 01:33:29,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:29,408 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-03-04 01:33:29,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:33:29,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:29,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 513934839, now seen corresponding path program 1 times [2025-03-04 01:33:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:29,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61220628] [2025-03-04 01:33:29,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:29,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:29,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-04 01:33:29,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-04 01:33:29,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:29,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:30,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61220628] [2025-03-04 01:33:30,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61220628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:30,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:30,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853534405] [2025-03-04 01:33:30,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:30,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:30,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:30,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:30,298 INFO L87 Difference]: Start difference. First operand 131 states and 188 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:30,785 INFO L93 Difference]: Finished difference Result 478 states and 685 transitions. [2025-03-04 01:33:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:33:30,786 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 179 [2025-03-04 01:33:30,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:30,788 INFO L225 Difference]: With dead ends: 478 [2025-03-04 01:33:30,788 INFO L226 Difference]: Without dead ends: 350 [2025-03-04 01:33:30,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:30,790 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 925 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:30,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 1094 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-03-04 01:33:30,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 203. [2025-03-04 01:33:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 175 states have (on average 1.3771428571428572) internal successors, (241), 176 states have internal predecessors, (241), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:30,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 291 transitions. [2025-03-04 01:33:30,825 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 291 transitions. Word has length 179 [2025-03-04 01:33:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:30,826 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 291 transitions. [2025-03-04 01:33:30,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 291 transitions. [2025-03-04 01:33:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:30,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:30,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:30,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:33:30,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:30,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:30,830 INFO L85 PathProgramCache]: Analyzing trace with hash 588004448, now seen corresponding path program 1 times [2025-03-04 01:33:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:30,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305201160] [2025-03-04 01:33:30,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:30,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:30,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:30,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:30,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:30,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:31,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:31,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305201160] [2025-03-04 01:33:31,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305201160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:31,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:31,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:31,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962941730] [2025-03-04 01:33:31,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:31,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:31,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:31,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:31,348 INFO L87 Difference]: Start difference. First operand 203 states and 291 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:31,447 INFO L93 Difference]: Finished difference Result 560 states and 801 transitions. [2025-03-04 01:33:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:31,447 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-03-04 01:33:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:31,450 INFO L225 Difference]: With dead ends: 560 [2025-03-04 01:33:31,450 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 01:33:31,451 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-03-04 01:33:31,451 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 144 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:31,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1197 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 01:33:31,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 215. [2025-03-04 01:33:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 187 states have (on average 1.3636363636363635) internal successors, (255), 188 states have internal predecessors, (255), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 305 transitions. [2025-03-04 01:33:31,467 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 305 transitions. Word has length 180 [2025-03-04 01:33:31,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:31,468 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 305 transitions. [2025-03-04 01:33:31,468 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-03-04 01:33:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 305 transitions. [2025-03-04 01:33:31,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:31,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:31,469 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-03-04 01:33:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:33:31,469 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:31,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:31,470 INFO L85 PathProgramCache]: Analyzing trace with hash 77470271, now seen corresponding path program 1 times [2025-03-04 01:33:31,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:31,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-03-04 01:33:31,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:31,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:31,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:31,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:31,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:31,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:31,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:31,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:31,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804364886] [2025-03-04 01:33:31,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804364886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:31,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:31,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:31,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739902580] [2025-03-04 01:33:31,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:31,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:31,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:31,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:31,760 INFO L87 Difference]: Start difference. First operand 215 states and 305 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:31,896 INFO L93 Difference]: Finished difference Result 560 states and 798 transitions. [2025-03-04 01:33:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:31,896 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-03-04 01:33:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:31,902 INFO L225 Difference]: With dead ends: 560 [2025-03-04 01:33:31,903 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 01:33:31,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03-04 01:33:31,904 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 166 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:31,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1098 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 01:33:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 235. [2025-03-04 01:33:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 207 states have (on average 1.357487922705314) internal successors, (281), 208 states have internal predecessors, (281), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 331 transitions. [2025-03-04 01:33:31,922 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 331 transitions. Word has length 180 [2025-03-04 01:33:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 331 transitions. [2025-03-04 01:33:31,923 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-03-04 01:33:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 331 transitions. [2025-03-04 01:33:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:31,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:31,925 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-03-04 01:33:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:33:31,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -953879141, now seen corresponding path program 1 times [2025-03-04 01:33:31,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:31,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463943282] [2025-03-04 01:33:31,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:31,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:31,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:31,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:31,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:32,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463943282] [2025-03-04 01:33:32,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463943282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:32,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854811656] [2025-03-04 01:33:32,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:32,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:32,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:32,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:32,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:33:32,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:32,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:32,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:32,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:32,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 01:33:32,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:32,650 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 11 treesize of output 7 [2025-03-04 01:33:32,728 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 17 treesize of output 13 [2025-03-04 01:33:32,758 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 21 treesize of output 13 [2025-03-04 01:33:32,788 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 19 treesize of output 11 [2025-03-04 01:33:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:32,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:32,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854811656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:32,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:32,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-04 01:33:32,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769345762] [2025-03-04 01:33:32,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:32,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:32,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:32,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:33:32,837 INFO L87 Difference]: Start difference. First operand 235 states and 331 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 01:33:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:33,340 INFO L93 Difference]: Finished difference Result 900 states and 1272 transitions. [2025-03-04 01:33:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:33:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 01:33:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:33,343 INFO L225 Difference]: With dead ends: 900 [2025-03-04 01:33:33,343 INFO L226 Difference]: Without dead ends: 668 [2025-03-04 01:33:33,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:33:33,345 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 419 mSDsluCounter, 1744 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 2023 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:33,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 2023 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2025-03-04 01:33:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 300. [2025-03-04 01:33:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3897058823529411) internal successors, (378), 273 states have internal predecessors, (378), 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-03-04 01:33:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 428 transitions. [2025-03-04 01:33:33,369 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 428 transitions. Word has length 180 [2025-03-04 01:33:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:33,370 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 428 transitions. [2025-03-04 01:33:33,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 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-03-04 01:33:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 428 transitions. [2025-03-04 01:33:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:33,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:33,371 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-03-04 01:33:33,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:33,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 01:33:33,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:33,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1464413318, now seen corresponding path program 1 times [2025-03-04 01:33:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:33,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955535275] [2025-03-04 01:33:33,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:33,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:33,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:33,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955535275] [2025-03-04 01:33:33,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955535275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:33,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:33,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:33,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029064163] [2025-03-04 01:33:33,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:33,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:33,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:33,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:33,890 INFO L87 Difference]: Start difference. First operand 300 states and 428 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-03-04 01:33:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:34,215 INFO L93 Difference]: Finished difference Result 963 states and 1365 transitions. [2025-03-04 01:33:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:34,215 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-03-04 01:33:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:34,218 INFO L225 Difference]: With dead ends: 963 [2025-03-04 01:33:34,218 INFO L226 Difference]: Without dead ends: 666 [2025-03-04 01:33:34,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:34,220 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 414 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:34,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1263 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:34,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2025-03-04 01:33:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 300. [2025-03-04 01:33:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 272 states have (on average 1.3823529411764706) internal successors, (376), 273 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:34,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 426 transitions. [2025-03-04 01:33:34,242 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 426 transitions. Word has length 180 [2025-03-04 01:33:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:34,242 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 426 transitions. [2025-03-04 01:33:34,242 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-03-04 01:33:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 426 transitions. [2025-03-04 01:33:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:34,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:34,243 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-03-04 01:33:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:33:34,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:34,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:34,244 INFO L85 PathProgramCache]: Analyzing trace with hash -142504417, now seen corresponding path program 1 times [2025-03-04 01:33:34,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:34,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684652619] [2025-03-04 01:33:34,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:34,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:34,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:34,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:34,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:34,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:34,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:34,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:34,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684652619] [2025-03-04 01:33:34,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684652619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:34,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:34,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175844460] [2025-03-04 01:33:34,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:34,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:34,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:34,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:34,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:34,428 INFO L87 Difference]: Start difference. First operand 300 states and 426 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-03-04 01:33:34,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:34,574 INFO L93 Difference]: Finished difference Result 820 states and 1174 transitions. [2025-03-04 01:33:34,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:34,575 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-03-04 01:33:34,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:34,577 INFO L225 Difference]: With dead ends: 820 [2025-03-04 01:33:34,577 INFO L226 Difference]: Without dead ends: 523 [2025-03-04 01:33:34,578 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-03-04 01:33:34,578 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 169 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:34,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 665 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-04 01:33:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 289. [2025-03-04 01:33:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 261 states have (on average 1.367816091954023) internal successors, (357), 262 states have internal predecessors, (357), 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-03-04 01:33:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 407 transitions. [2025-03-04 01:33:34,603 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 407 transitions. Word has length 180 [2025-03-04 01:33:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:34,603 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 407 transitions. [2025-03-04 01:33:34,603 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-03-04 01:33:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 407 transitions. [2025-03-04 01:33:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:34,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:34,606 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-03-04 01:33:34,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:33:34,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:34,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1362703366, now seen corresponding path program 1 times [2025-03-04 01:33:34,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:34,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592704428] [2025-03-04 01:33:34,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:34,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:34,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:34,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:34,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:34,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592704428] [2025-03-04 01:33:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592704428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614368837] [2025-03-04 01:33:34,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:34,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:34,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:34,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:34,952 INFO L87 Difference]: Start difference. First operand 289 states and 407 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-03-04 01:33:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:35,291 INFO L93 Difference]: Finished difference Result 924 states and 1301 transitions. [2025-03-04 01:33:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:35,292 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-03-04 01:33:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:35,295 INFO L225 Difference]: With dead ends: 924 [2025-03-04 01:33:35,295 INFO L226 Difference]: Without dead ends: 638 [2025-03-04 01:33:35,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:35,296 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 407 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:35,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1127 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-03-04 01:33:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 297. [2025-03-04 01:33:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 269 states have (on average 1.3568773234200744) internal successors, (365), 270 states have internal predecessors, (365), 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-03-04 01:33:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 415 transitions. [2025-03-04 01:33:35,323 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 415 transitions. Word has length 180 [2025-03-04 01:33:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:35,324 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 415 transitions. [2025-03-04 01:33:35,324 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-03-04 01:33:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 415 transitions. [2025-03-04 01:33:35,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 01:33:35,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:35,325 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-03-04 01:33:35,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:33:35,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1873237543, now seen corresponding path program 1 times [2025-03-04 01:33:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:35,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106715368] [2025-03-04 01:33:35,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:35,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-04 01:33:35,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-04 01:33:35,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:35,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:35,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:35,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106715368] [2025-03-04 01:33:35,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106715368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:35,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:35,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:33:35,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759893288] [2025-03-04 01:33:35,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:35,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:33:35,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:35,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:33:35,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:35,592 INFO L87 Difference]: Start difference. First operand 297 states and 415 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-03-04 01:33:35,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:35,740 INFO L93 Difference]: Finished difference Result 862 states and 1216 transitions. [2025-03-04 01:33:35,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:35,741 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-03-04 01:33:35,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:35,743 INFO L225 Difference]: With dead ends: 862 [2025-03-04 01:33:35,743 INFO L226 Difference]: Without dead ends: 568 [2025-03-04 01:33:35,744 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-03-04 01:33:35,744 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 178 mSDsluCounter, 1890 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-04 01:33:35,744 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-03-04 01:33:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2025-03-04 01:33:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 305. [2025-03-04 01:33:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 425 transitions. [2025-03-04 01:33:35,765 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 425 transitions. Word has length 180 [2025-03-04 01:33:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:35,766 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 425 transitions. [2025-03-04 01:33:35,766 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-03-04 01:33:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 425 transitions. [2025-03-04 01:33:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:33:35,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:35,767 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-03-04 01:33:35,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:33:35,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:35,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:35,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1343091623, now seen corresponding path program 1 times [2025-03-04 01:33:35,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:35,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241638613] [2025-03-04 01:33:35,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:35,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:33:35,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:33:35,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:35,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:36,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241638613] [2025-03-04 01:33:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241638613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:36,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:36,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146977867] [2025-03-04 01:33:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:36,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:36,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:36,051 INFO L87 Difference]: Start difference. First operand 305 states and 425 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:36,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:36,299 INFO L93 Difference]: Finished difference Result 771 states and 1076 transitions. [2025-03-04 01:33:36,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:36,300 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-03-04 01:33:36,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:36,302 INFO L225 Difference]: With dead ends: 771 [2025-03-04 01:33:36,302 INFO L226 Difference]: Without dead ends: 469 [2025-03-04 01:33:36,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:36,303 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 321 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:36,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 965 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:36,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-04 01:33:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 302. [2025-03-04 01:33:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.354014598540146) internal successors, (371), 275 states have internal predecessors, (371), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 421 transitions. [2025-03-04 01:33:36,323 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 421 transitions. Word has length 181 [2025-03-04 01:33:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:36,324 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 421 transitions. [2025-03-04 01:33:36,324 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-03-04 01:33:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 421 transitions. [2025-03-04 01:33:36,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:33:36,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:36,325 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-03-04 01:33:36,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:33:36,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:36,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:36,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1677029317, now seen corresponding path program 1 times [2025-03-04 01:33:36,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:36,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932525638] [2025-03-04 01:33:36,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:36,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:36,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:33:36,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:33:36,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:36,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:36,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:36,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:36,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932525638] [2025-03-04 01:33:36,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932525638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:36,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:36,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:36,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445489863] [2025-03-04 01:33:36,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:36,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:36,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:36,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:36,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:36,621 INFO L87 Difference]: Start difference. First operand 302 states and 421 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:36,855 INFO L93 Difference]: Finished difference Result 719 states and 1005 transitions. [2025-03-04 01:33:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:36,855 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-03-04 01:33:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:36,857 INFO L225 Difference]: With dead ends: 719 [2025-03-04 01:33:36,857 INFO L226 Difference]: Without dead ends: 420 [2025-03-04 01:33:36,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03-04 01:33:36,858 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:36,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 640 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-04 01:33:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 302. [2025-03-04 01:33:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 274 states have (on average 1.3503649635036497) internal successors, (370), 275 states have internal predecessors, (370), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-04 01:33:36,878 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 181 [2025-03-04 01:33:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:36,879 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-04 01:33:36,879 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-03-04 01:33:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-04 01:33:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-04 01:33:36,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:36,880 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-03-04 01:33:36,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:33:36,880 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:36,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2107403802, now seen corresponding path program 1 times [2025-03-04 01:33:36,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:36,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172110489] [2025-03-04 01:33:36,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:36,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:36,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:33:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:33:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:37,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172110489] [2025-03-04 01:33:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172110489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:37,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318543246] [2025-03-04 01:33:37,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:37,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:37,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:37,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:33:37,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 01:33:37,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 01:33:37,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:37,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:37,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:33:37,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:37,500 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 11 treesize of output 7 [2025-03-04 01:33:37,538 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 11 treesize of output 7 [2025-03-04 01:33:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:37,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318543246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:37,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:37,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-04 01:33:37,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304576322] [2025-03-04 01:33:37,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:37,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:33:37,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:37,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:33:37,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:37,608 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:37,888 INFO L93 Difference]: Finished difference Result 917 states and 1282 transitions. [2025-03-04 01:33:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:37,888 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-03-04 01:33:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:37,892 INFO L225 Difference]: With dead ends: 917 [2025-03-04 01:33:37,892 INFO L226 Difference]: Without dead ends: 618 [2025-03-04 01:33:37,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:33:37,894 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 331 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:37,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 2685 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:37,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-04 01:33:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 306. [2025-03-04 01:33:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 278 states have (on average 1.3489208633093526) internal successors, (375), 279 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 425 transitions. [2025-03-04 01:33:37,919 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 425 transitions. Word has length 181 [2025-03-04 01:33:37,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:37,919 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 425 transitions. [2025-03-04 01:33:37,920 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-03-04 01:33:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 425 transitions. [2025-03-04 01:33:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 01:33:37,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:37,922 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-03-04 01:33:37,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:33:38,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:38,123 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:38,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:38,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1919763688, now seen corresponding path program 1 times [2025-03-04 01:33:38,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:38,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830338767] [2025-03-04 01:33:38,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:38,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:38,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:33:38,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:33:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:38,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:38,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:38,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830338767] [2025-03-04 01:33:38,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830338767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:38,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:38,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:33:38,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458542118] [2025-03-04 01:33:38,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:38,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:33:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:38,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:33:38,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:33:38,193 INFO L87 Difference]: Start difference. First operand 306 states and 425 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:38,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:38,212 INFO L93 Difference]: Finished difference Result 610 states and 849 transitions. [2025-03-04 01:33:38,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:33:38,214 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-03-04 01:33:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:38,215 INFO L225 Difference]: With dead ends: 610 [2025-03-04 01:33:38,215 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 01:33:38,216 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-03-04 01:33:38,216 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-03-04 01:33:38,216 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-03-04 01:33:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 01:33:38,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-04 01:33:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3476702508960574) internal successors, (376), 280 states have internal predecessors, (376), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 426 transitions. [2025-03-04 01:33:38,233 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 426 transitions. Word has length 182 [2025-03-04 01:33:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:38,233 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 426 transitions. [2025-03-04 01:33:38,233 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-03-04 01:33:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 426 transitions. [2025-03-04 01:33:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 01:33:38,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:38,236 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-03-04 01:33:38,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:33:38,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:38,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:38,236 INFO L85 PathProgramCache]: Analyzing trace with hash -286959689, now seen corresponding path program 1 times [2025-03-04 01:33:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436311830] [2025-03-04 01:33:38,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:38,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:38,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:33:38,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:33:38,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:38,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:38,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:38,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436311830] [2025-03-04 01:33:38,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436311830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:38,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:38,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429445449] [2025-03-04 01:33:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:38,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:38,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:38,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:38,374 INFO L87 Difference]: Start difference. First operand 307 states and 426 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:38,416 INFO L93 Difference]: Finished difference Result 611 states and 849 transitions. [2025-03-04 01:33:38,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:38,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:38,418 INFO L225 Difference]: With dead ends: 611 [2025-03-04 01:33:38,418 INFO L226 Difference]: Without dead ends: 307 [2025-03-04 01:33:38,419 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-03-04 01:33:38,419 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:38,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-03-04 01:33:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2025-03-04 01:33:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 279 states have (on average 1.3440860215053763) internal successors, (375), 280 states have internal predecessors, (375), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 425 transitions. [2025-03-04 01:33:38,435 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 425 transitions. Word has length 182 [2025-03-04 01:33:38,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:38,435 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 425 transitions. [2025-03-04 01:33:38,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 425 transitions. [2025-03-04 01:33:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-04 01:33:38,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:38,437 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-03-04 01:33:38,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:33:38,437 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:38,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:38,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2057707352, now seen corresponding path program 1 times [2025-03-04 01:33:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206776625] [2025-03-04 01:33:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:38,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-04 01:33:38,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-04 01:33:38,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:38,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206776625] [2025-03-04 01:33:38,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206776625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:38,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876525099] [2025-03-04 01:33:38,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:38,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:38,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:38,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:38,548 INFO L87 Difference]: Start difference. First operand 307 states and 425 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:38,609 INFO L93 Difference]: Finished difference Result 695 states and 958 transitions. [2025-03-04 01:33:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:38,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:38,611 INFO L225 Difference]: With dead ends: 695 [2025-03-04 01:33:38,612 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 01:33:38,612 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-03-04 01:33:38,612 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 101 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:38,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 961 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:38,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 01:33:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 226. [2025-03-04 01:33:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 199 states have internal predecessors, (260), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 310 transitions. [2025-03-04 01:33:38,628 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 310 transitions. Word has length 182 [2025-03-04 01:33:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:38,628 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 310 transitions. [2025-03-04 01:33:38,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 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-03-04 01:33:38,629 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 310 transitions. [2025-03-04 01:33:38,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-04 01:33:38,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:38,630 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:38,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:33:38,630 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:38,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:38,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2057496074, now seen corresponding path program 1 times [2025-03-04 01:33:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036979575] [2025-03-04 01:33:38,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:38,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:38,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-04 01:33:38,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-04 01:33:38,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:38,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036979575] [2025-03-04 01:33:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036979575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:38,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:38,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:33:38,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838157349] [2025-03-04 01:33:38,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:38,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:33:38,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:38,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:33:38,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:38,896 INFO L87 Difference]: Start difference. First operand 226 states and 310 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:39,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,010 INFO L93 Difference]: Finished difference Result 511 states and 704 transitions. [2025-03-04 01:33:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:39,010 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-03-04 01:33:39,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,012 INFO L225 Difference]: With dead ends: 511 [2025-03-04 01:33:39,012 INFO L226 Difference]: Without dead ends: 288 [2025-03-04 01:33:39,012 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-03-04 01:33:39,012 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 164 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 1502 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-04 01:33:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2025-03-04 01:33:39,027 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-03-04 01:33:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 316 transitions. [2025-03-04 01:33:39,028 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 316 transitions. Word has length 183 [2025-03-04 01:33:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,028 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 316 transitions. [2025-03-04 01:33:39,028 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-03-04 01:33:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 316 transitions. [2025-03-04 01:33:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:33:39,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,030 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-03-04 01:33:39,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:33:39,030 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2022915892, now seen corresponding path program 1 times [2025-03-04 01:33:39,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938286875] [2025-03-04 01:33:39,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:33:39,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:33:39,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938286875] [2025-03-04 01:33:39,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938286875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:39,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:39,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:33:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818015808] [2025-03-04 01:33:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:33:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:39,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:33:39,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:33:39,086 INFO L87 Difference]: Start difference. First operand 232 states and 316 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:39,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,105 INFO L93 Difference]: Finished difference Result 463 states and 633 transitions. [2025-03-04 01:33:39,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:33:39,106 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-03-04 01:33:39,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,107 INFO L225 Difference]: With dead ends: 463 [2025-03-04 01:33:39,107 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 01:33:39,107 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-03-04 01:33:39,108 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-03-04 01:33:39,108 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-03-04 01:33:39,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 01:33:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-03-04 01:33:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 206 states have (on average 1.3009708737864079) internal successors, (268), 207 states have internal predecessors, (268), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 318 transitions. [2025-03-04 01:33:39,122 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 318 transitions. Word has length 185 [2025-03-04 01:33:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,122 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 318 transitions. [2025-03-04 01:33:39,122 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-03-04 01:33:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 318 transitions. [2025-03-04 01:33:39,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:33:39,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,123 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-03-04 01:33:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:33:39,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash -669606195, now seen corresponding path program 1 times [2025-03-04 01:33:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182048853] [2025-03-04 01:33:39,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:33:39,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:33:39,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182048853] [2025-03-04 01:33:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182048853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524240962] [2025-03-04 01:33:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:39,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:39,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:39,258 INFO L87 Difference]: Start difference. First operand 234 states and 318 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,312 INFO L93 Difference]: Finished difference Result 625 states and 847 transitions. [2025-03-04 01:33:39,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:39,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,314 INFO L225 Difference]: With dead ends: 625 [2025-03-04 01:33:39,314 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:33:39,315 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-03-04 01:33:39,315 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 74 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 765 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:33:39,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 324. [2025-03-04 01:33:39,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 296 states have (on average 1.3006756756756757) internal successors, (385), 297 states have internal predecessors, (385), 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-03-04 01:33:39,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 435 transitions. [2025-03-04 01:33:39,331 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 435 transitions. Word has length 185 [2025-03-04 01:33:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,331 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 435 transitions. [2025-03-04 01:33:39,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,331 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 435 transitions. [2025-03-04 01:33:39,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:33:39,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,332 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-03-04 01:33:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:33:39,332 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1689700814, now seen corresponding path program 1 times [2025-03-04 01:33:39,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235588299] [2025-03-04 01:33:39,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:33:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:33:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:39,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:39,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235588299] [2025-03-04 01:33:39,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235588299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:39,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:39,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415017386] [2025-03-04 01:33:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:39,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:39,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:39,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:39,450 INFO L87 Difference]: Start difference. First operand 324 states and 435 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,506 INFO L93 Difference]: Finished difference Result 715 states and 962 transitions. [2025-03-04 01:33:39,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,508 INFO L225 Difference]: With dead ends: 715 [2025-03-04 01:33:39,508 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:33:39,509 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-03-04 01:33:39,509 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 75 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 843 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:33:39,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 324. [2025-03-04 01:33:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 296 states have (on average 1.2939189189189189) internal successors, (383), 297 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-03-04 01:33:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 433 transitions. [2025-03-04 01:33:39,525 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 433 transitions. Word has length 185 [2025-03-04 01:33:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,525 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 433 transitions. [2025-03-04 01:33:39,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 433 transitions. [2025-03-04 01:33:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:33:39,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,526 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-03-04 01:33:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:33:39,526 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1097714673, now seen corresponding path program 1 times [2025-03-04 01:33:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949283039] [2025-03-04 01:33:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:33:39,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:33:39,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:39,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:39,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949283039] [2025-03-04 01:33:39,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949283039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:39,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:39,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454357761] [2025-03-04 01:33:39,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:39,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:39,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:39,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:39,743 INFO L87 Difference]: Start difference. First operand 324 states and 433 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,810 INFO L93 Difference]: Finished difference Result 705 states and 946 transitions. [2025-03-04 01:33:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,813 INFO L225 Difference]: With dead ends: 705 [2025-03-04 01:33:39,813 INFO L226 Difference]: Without dead ends: 384 [2025-03-04 01:33:39,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:39,814 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 72 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 924 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-04 01:33:39,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 312. [2025-03-04 01:33:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 284 states have (on average 1.2922535211267605) internal successors, (367), 285 states have internal predecessors, (367), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 417 transitions. [2025-03-04 01:33:39,839 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 417 transitions. Word has length 185 [2025-03-04 01:33:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,839 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 417 transitions. [2025-03-04 01:33:39,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 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-03-04 01:33:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 417 transitions. [2025-03-04 01:33:39,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:33:39,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,842 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-03-04 01:33:39,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:33:39,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,843 INFO L85 PathProgramCache]: Analyzing trace with hash 532581411, now seen corresponding path program 1 times [2025-03-04 01:33:39,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035644892] [2025-03-04 01:33:39,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:33:39,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:33:39,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:39,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:39,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035644892] [2025-03-04 01:33:39,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035644892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:39,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:39,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340911652] [2025-03-04 01:33:39,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:39,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:39,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:39,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:39,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:39,910 INFO L87 Difference]: Start difference. First operand 312 states and 417 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-03-04 01:33:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,940 INFO L93 Difference]: Finished difference Result 627 states and 839 transitions. [2025-03-04 01:33:39,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:39,941 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-03-04 01:33:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,942 INFO L225 Difference]: With dead ends: 627 [2025-03-04 01:33:39,942 INFO L226 Difference]: Without dead ends: 318 [2025-03-04 01:33:39,943 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-03-04 01:33:39,943 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-03-04 01:33:39,943 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-03-04 01:33:39,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-04 01:33:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2025-03-04 01:33:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 288 states have (on average 1.2881944444444444) internal successors, (371), 289 states have internal predecessors, (371), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:33:39,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 421 transitions. [2025-03-04 01:33:39,959 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 421 transitions. Word has length 187 [2025-03-04 01:33:39,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 421 transitions. [2025-03-04 01:33:39,960 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-03-04 01:33:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 421 transitions. [2025-03-04 01:33:39,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:33:39,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,961 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-03-04 01:33:39,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:33:39,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash 661664130, now seen corresponding path program 1 times [2025-03-04 01:33:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897270935] [2025-03-04 01:33:39,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:39,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:33:39,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:33:39,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:40,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:40,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897270935] [2025-03-04 01:33:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897270935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:40,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:40,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:33:40,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256530932] [2025-03-04 01:33:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:40,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:40,364 INFO L87 Difference]: Start difference. First operand 316 states and 421 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:40,547 INFO L93 Difference]: Finished difference Result 783 states and 1039 transitions. [2025-03-04 01:33:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:40,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 187 [2025-03-04 01:33:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:40,549 INFO L225 Difference]: With dead ends: 783 [2025-03-04 01:33:40,549 INFO L226 Difference]: Without dead ends: 470 [2025-03-04 01:33:40,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:33:40,551 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 162 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:40,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1644 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-04 01:33:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 367. [2025-03-04 01:33:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 339 states have (on average 1.2625368731563422) internal successors, (428), 340 states have internal predecessors, (428), 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-03-04 01:33:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 478 transitions. [2025-03-04 01:33:40,568 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 478 transitions. Word has length 187 [2025-03-04 01:33:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 478 transitions. [2025-03-04 01:33:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 01:33:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 478 transitions. [2025-03-04 01:33:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 01:33:40,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:40,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] [2025-03-04 01:33:40,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:33:40,570 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:40,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash 302419496, now seen corresponding path program 1 times [2025-03-04 01:33:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:40,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642226223] [2025-03-04 01:33:40,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 01:33:40,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 01:33:40,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:40,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:40,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-03-04 01:33:40,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:40,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642226223] [2025-03-04 01:33:40,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642226223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:40,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:40,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:40,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308118053] [2025-03-04 01:33:40,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:40,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:40,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:40,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:40,746 INFO L87 Difference]: Start difference. First operand 367 states and 478 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-04 01:33:40,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:40,803 INFO L93 Difference]: Finished difference Result 734 states and 954 transitions. [2025-03-04 01:33:40,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:40,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 188 [2025-03-04 01:33:40,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:40,805 INFO L225 Difference]: With dead ends: 734 [2025-03-04 01:33:40,805 INFO L226 Difference]: Without dead ends: 370 [2025-03-04 01:33:40,806 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-03-04 01:33:40,806 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 149 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:40,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 638 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:40,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-04 01:33:40,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 328. [2025-03-04 01:33:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 302 states have internal predecessors, (377), 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-03-04 01:33:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 423 transitions. [2025-03-04 01:33:40,820 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 423 transitions. Word has length 188 [2025-03-04 01:33:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:40,820 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 423 transitions. [2025-03-04 01:33:40,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-03-04 01:33:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 423 transitions. [2025-03-04 01:33:40,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 01:33:40,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:40,821 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-03-04 01:33:40,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:33:40,822 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:40,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash 112763781, now seen corresponding path program 1 times [2025-03-04 01:33:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071053671] [2025-03-04 01:33:40,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:40,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 01:33:40,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 01:33:40,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:40,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:40,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071053671] [2025-03-04 01:33:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071053671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695478679] [2025-03-04 01:33:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:40,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:40,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:40,982 INFO L87 Difference]: Start difference. First operand 328 states and 423 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-03-04 01:33:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:41,049 INFO L93 Difference]: Finished difference Result 688 states and 887 transitions. [2025-03-04 01:33:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:41,049 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-03-04 01:33:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:41,051 INFO L225 Difference]: With dead ends: 688 [2025-03-04 01:33:41,051 INFO L226 Difference]: Without dead ends: 363 [2025-03-04 01:33:41,051 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-03-04 01:33:41,052 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 65 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:41,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 718 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-04 01:33:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 328. [2025-03-04 01:33:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 302 states have (on average 1.2450331125827814) internal successors, (376), 302 states have internal predecessors, (376), 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-03-04 01:33:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 422 transitions. [2025-03-04 01:33:41,068 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 422 transitions. Word has length 189 [2025-03-04 01:33:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 422 transitions. [2025-03-04 01:33:41,068 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-03-04 01:33:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 422 transitions. [2025-03-04 01:33:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:41,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:41,069 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-03-04 01:33:41,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:33:41,070 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:41,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:41,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1523945813, now seen corresponding path program 1 times [2025-03-04 01:33:41,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:41,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581542509] [2025-03-04 01:33:41,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:41,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:41,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:41,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:41,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:41,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:41,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:41,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:41,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581542509] [2025-03-04 01:33:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581542509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:41,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:33:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316356421] [2025-03-04 01:33:41,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:41,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:41,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:41,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:41,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:41,603 INFO L87 Difference]: Start difference. First operand 328 states and 422 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:41,891 INFO L93 Difference]: Finished difference Result 772 states and 993 transitions. [2025-03-04 01:33:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:41,894 INFO L225 Difference]: With dead ends: 772 [2025-03-04 01:33:41,894 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 01:33:41,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:33:41,895 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 236 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:41,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1530 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 01:33:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2025-03-04 01:33:41,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 360 states have (on average 1.2416666666666667) internal successors, (447), 361 states have internal predecessors, (447), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:33:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 509 transitions. [2025-03-04 01:33:41,917 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 509 transitions. Word has length 190 [2025-03-04 01:33:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:41,917 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 509 transitions. [2025-03-04 01:33:41,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 509 transitions. [2025-03-04 01:33:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:41,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:41,919 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-03-04 01:33:41,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:33:41,919 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:41,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:41,919 INFO L85 PathProgramCache]: Analyzing trace with hash 439075595, now seen corresponding path program 1 times [2025-03-04 01:33:41,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:41,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161326678] [2025-03-04 01:33:41,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:41,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:41,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:41,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:41,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:41,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161326678] [2025-03-04 01:33:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161326678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:33:42,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647552698] [2025-03-04 01:33:42,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:42,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:42,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:42,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:42,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:42,454 INFO L87 Difference]: Start difference. First operand 396 states and 509 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:42,692 INFO L93 Difference]: Finished difference Result 862 states and 1106 transitions. [2025-03-04 01:33:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:42,695 INFO L225 Difference]: With dead ends: 862 [2025-03-04 01:33:42,695 INFO L226 Difference]: Without dead ends: 469 [2025-03-04 01:33:42,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:33:42,697 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 274 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:42,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1127 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-04 01:33:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 364. [2025-03-04 01:33:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 337 states have (on average 1.2373887240356083) internal successors, (417), 337 states have internal predecessors, (417), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 01:33:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 463 transitions. [2025-03-04 01:33:42,725 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 463 transitions. Word has length 190 [2025-03-04 01:33:42,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:42,726 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 463 transitions. [2025-03-04 01:33:42,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 10 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-03-04 01:33:42,726 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 463 transitions. [2025-03-04 01:33:42,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:42,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:42,727 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-03-04 01:33:42,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:33:42,727 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:42,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:42,728 INFO L85 PathProgramCache]: Analyzing trace with hash 568158314, now seen corresponding path program 1 times [2025-03-04 01:33:42,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:42,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542427821] [2025-03-04 01:33:42,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:42,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:42,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:42,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542427821] [2025-03-04 01:33:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542427821] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:42,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:42,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65460435] [2025-03-04 01:33:42,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:42,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:42,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:42,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:42,985 INFO L87 Difference]: Start difference. First operand 364 states and 463 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:43,093 INFO L93 Difference]: Finished difference Result 784 states and 998 transitions. [2025-03-04 01:33:43,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:43,095 INFO L225 Difference]: With dead ends: 784 [2025-03-04 01:33:43,095 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 01:33:43,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:43,096 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 163 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:43,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1306 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:43,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 01:33:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 417. [2025-03-04 01:33:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 382 states have (on average 1.2356020942408377) internal successors, (472), 383 states have internal predecessors, (472), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:33:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 530 transitions. [2025-03-04 01:33:43,121 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 530 transitions. Word has length 190 [2025-03-04 01:33:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:43,122 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 530 transitions. [2025-03-04 01:33:43,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 530 transitions. [2025-03-04 01:33:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:43,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:43,123 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-03-04 01:33:43,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:33:43,123 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:43,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:43,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2075710123, now seen corresponding path program 1 times [2025-03-04 01:33:43,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:43,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597494475] [2025-03-04 01:33:43,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:43,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:43,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:43,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:43,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:43,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597494475] [2025-03-04 01:33:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597494475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:43,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:43,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247500675] [2025-03-04 01:33:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:43,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:43,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:43,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:43,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:43,303 INFO L87 Difference]: Start difference. First operand 417 states and 530 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-03-04 01:33:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:43,382 INFO L93 Difference]: Finished difference Result 1104 states and 1398 transitions. [2025-03-04 01:33:43,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:43,383 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-03-04 01:33:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:43,385 INFO L225 Difference]: With dead ends: 1104 [2025-03-04 01:33:43,385 INFO L226 Difference]: Without dead ends: 690 [2025-03-04 01:33:43,386 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-03-04 01:33:43,386 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 151 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:43,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 587 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-03-04 01:33:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 672. [2025-03-04 01:33:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 625 states have (on average 1.24) internal successors, (775), 628 states have internal predecessors, (775), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 01:33:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 849 transitions. [2025-03-04 01:33:43,420 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 849 transitions. Word has length 190 [2025-03-04 01:33:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:43,420 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 849 transitions. [2025-03-04 01:33:43,420 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-03-04 01:33:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 849 transitions. [2025-03-04 01:33:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:43,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:43,421 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-03-04 01:33:43,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:33:43,421 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1848337900, now seen corresponding path program 1 times [2025-03-04 01:33:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017598260] [2025-03-04 01:33:43,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:43,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:43,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:43,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:43,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:43,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:43,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017598260] [2025-03-04 01:33:43,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017598260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:43,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978620118] [2025-03-04 01:33:43,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:43,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:43,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:43,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:43,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:43,675 INFO L87 Difference]: Start difference. First operand 672 states and 849 transitions. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:43,827 INFO L93 Difference]: Finished difference Result 1354 states and 1708 transitions. [2025-03-04 01:33:43,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:33:43,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:43,829 INFO L225 Difference]: With dead ends: 1354 [2025-03-04 01:33:43,829 INFO L226 Difference]: Without dead ends: 685 [2025-03-04 01:33:43,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:43,830 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 273 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1501 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:43,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1501 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:43,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-03-04 01:33:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 675. [2025-03-04 01:33:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 625 states have (on average 1.232) internal successors, (770), 628 states have internal predecessors, (770), 39 states have call successors, (39), 10 states have call predecessors, (39), 10 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 01:33:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 848 transitions. [2025-03-04 01:33:43,865 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 848 transitions. Word has length 190 [2025-03-04 01:33:43,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:43,865 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 848 transitions. [2025-03-04 01:33:43,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 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-03-04 01:33:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 848 transitions. [2025-03-04 01:33:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:43,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:43,866 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-03-04 01:33:43,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:33:43,866 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:43,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash -2095183926, now seen corresponding path program 1 times [2025-03-04 01:33:43,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:43,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789408541] [2025-03-04 01:33:43,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:43,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:43,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:43,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:43,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:43,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:43,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-03-04 01:33:43,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:43,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789408541] [2025-03-04 01:33:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789408541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:43,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:43,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:43,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140805263] [2025-03-04 01:33:43,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:43,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:43,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:43,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:43,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:43,949 INFO L87 Difference]: Start difference. First operand 675 states and 848 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-03-04 01:33:43,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:43,996 INFO L93 Difference]: Finished difference Result 1196 states and 1505 transitions. [2025-03-04 01:33:43,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:43,997 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-03-04 01:33:43,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:43,999 INFO L225 Difference]: With dead ends: 1196 [2025-03-04 01:33:43,999 INFO L226 Difference]: Without dead ends: 524 [2025-03-04 01:33:44,000 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-03-04 01:33:44,000 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-03-04 01:33:44,000 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-03-04 01:33:44,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-04 01:33:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 476. [2025-03-04 01:33:44,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 440 states have (on average 1.2272727272727273) internal successors, (540), 441 states have internal predecessors, (540), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-04 01:33:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 598 transitions. [2025-03-04 01:33:44,031 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 598 transitions. Word has length 190 [2025-03-04 01:33:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:44,032 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 598 transitions. [2025-03-04 01:33:44,032 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-03-04 01:33:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 598 transitions. [2025-03-04 01:33:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:33:44,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:44,034 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-03-04 01:33:44,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:33:44,034 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:44,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:44,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1972411147, now seen corresponding path program 1 times [2025-03-04 01:33:44,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:44,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737178557] [2025-03-04 01:33:44,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:44,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:44,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:33:44,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:33:44,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:44,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:44,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737178557] [2025-03-04 01:33:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737178557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:44,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440049523] [2025-03-04 01:33:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:44,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:44,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:44,201 INFO L87 Difference]: Start difference. First operand 476 states and 598 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-03-04 01:33:44,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:44,277 INFO L93 Difference]: Finished difference Result 988 states and 1240 transitions. [2025-03-04 01:33:44,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:44,277 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-03-04 01:33:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:44,279 INFO L225 Difference]: With dead ends: 988 [2025-03-04 01:33:44,279 INFO L226 Difference]: Without dead ends: 515 [2025-03-04 01:33:44,280 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-03-04 01:33:44,280 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 137 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:44,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 671 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-04 01:33:44,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 512. [2025-03-04 01:33:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 470 states have (on average 1.225531914893617) internal successors, (576), 472 states have internal predecessors, (576), 33 states have call successors, (33), 8 states have call predecessors, (33), 8 states have return successors, (33), 31 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 01:33:44,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 642 transitions. [2025-03-04 01:33:44,307 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 642 transitions. Word has length 190 [2025-03-04 01:33:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:44,308 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 642 transitions. [2025-03-04 01:33:44,308 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-03-04 01:33:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 642 transitions. [2025-03-04 01:33:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:33:44,309 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:44,309 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-03-04 01:33:44,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:33:44,309 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:44,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:44,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1686158701, now seen corresponding path program 1 times [2025-03-04 01:33:44,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:44,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955702073] [2025-03-04 01:33:44,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:33:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:33:44,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:44,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:44,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955702073] [2025-03-04 01:33:44,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955702073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:44,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:44,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:44,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064842658] [2025-03-04 01:33:44,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:44,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:44,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:44,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:44,635 INFO L87 Difference]: Start difference. First operand 512 states and 642 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:45,075 INFO L93 Difference]: Finished difference Result 1367 states and 1731 transitions. [2025-03-04 01:33:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:33:45,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 191 [2025-03-04 01:33:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:45,078 INFO L225 Difference]: With dead ends: 1367 [2025-03-04 01:33:45,078 INFO L226 Difference]: Without dead ends: 858 [2025-03-04 01:33:45,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:45,079 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 530 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:45,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1360 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2025-03-04 01:33:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 705. [2025-03-04 01:33:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 643 states have (on average 1.2006220839813375) internal successors, (772), 647 states have internal predecessors, (772), 47 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:33:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 866 transitions. [2025-03-04 01:33:45,156 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 866 transitions. Word has length 191 [2025-03-04 01:33:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:45,156 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 866 transitions. [2025-03-04 01:33:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 866 transitions. [2025-03-04 01:33:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:33:45,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:45,158 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-03-04 01:33:45,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:33:45,159 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:45,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:45,159 INFO L85 PathProgramCache]: Analyzing trace with hash 807360159, now seen corresponding path program 1 times [2025-03-04 01:33:45,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:45,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493513263] [2025-03-04 01:33:45,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:45,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:45,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:33:45,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:33:45,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:45,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:45,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:45,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493513263] [2025-03-04 01:33:45,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493513263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:45,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537099684] [2025-03-04 01:33:45,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:45,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:45,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:45,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:45,379 INFO L87 Difference]: Start difference. First operand 705 states and 866 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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-03-04 01:33:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:45,504 INFO L93 Difference]: Finished difference Result 2060 states and 2522 transitions. [2025-03-04 01:33:45,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:45,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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-03-04 01:33:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:45,509 INFO L225 Difference]: With dead ends: 2060 [2025-03-04 01:33:45,509 INFO L226 Difference]: Without dead ends: 1358 [2025-03-04 01:33:45,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:45,511 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 95 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:45,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 975 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-04 01:33:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1350. [2025-03-04 01:33:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1238 states have (on average 1.1922455573505655) internal successors, (1476), 1247 states have internal predecessors, (1476), 83 states have call successors, (83), 28 states have call predecessors, (83), 28 states have return successors, (83), 74 states have call predecessors, (83), 83 states have call successors, (83) [2025-03-04 01:33:45,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1642 transitions. [2025-03-04 01:33:45,605 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1642 transitions. Word has length 191 [2025-03-04 01:33:45,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:45,605 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 1642 transitions. [2025-03-04 01:33:45,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 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-03-04 01:33:45,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1642 transitions. [2025-03-04 01:33:45,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:33:45,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:45,607 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-03-04 01:33:45,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:33:45,607 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:45,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash 610846654, now seen corresponding path program 1 times [2025-03-04 01:33:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:45,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233798716] [2025-03-04 01:33:45,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:45,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:33:45,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:33:45,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:45,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233798716] [2025-03-04 01:33:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233798716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:45,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:33:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689582007] [2025-03-04 01:33:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:45,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:45,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:45,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:45,940 INFO L87 Difference]: Start difference. First operand 1350 states and 1642 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-03-04 01:33:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:46,213 INFO L93 Difference]: Finished difference Result 3479 states and 4229 transitions. [2025-03-04 01:33:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:46,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-03-04 01:33:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:46,220 INFO L225 Difference]: With dead ends: 3479 [2025-03-04 01:33:46,220 INFO L226 Difference]: Without dead ends: 2132 [2025-03-04 01:33:46,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:33:46,222 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 152 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:46,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1754 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2132 states. [2025-03-04 01:33:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2132 to 1779. [2025-03-04 01:33:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1655 states have (on average 1.1649546827794561) internal successors, (1928), 1665 states have internal predecessors, (1928), 91 states have call successors, (91), 32 states have call predecessors, (91), 32 states have return successors, (91), 81 states have call predecessors, (91), 91 states have call successors, (91) [2025-03-04 01:33:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2110 transitions. [2025-03-04 01:33:46,318 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2110 transitions. Word has length 191 [2025-03-04 01:33:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:46,318 INFO L471 AbstractCegarLoop]: Abstraction has 1779 states and 2110 transitions. [2025-03-04 01:33:46,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 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-03-04 01:33:46,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2110 transitions. [2025-03-04 01:33:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:33:46,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:46,321 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-03-04 01:33:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 01:33:46,321 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:46,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -825443840, now seen corresponding path program 1 times [2025-03-04 01:33:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070546157] [2025-03-04 01:33:46,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:46,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:33:46,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:33:46,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:46,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:46,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:46,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070546157] [2025-03-04 01:33:46,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070546157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:46,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:46,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:46,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245166190] [2025-03-04 01:33:46,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:46,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:46,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:46,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:46,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:46,758 INFO L87 Difference]: Start difference. First operand 1779 states and 2110 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-03-04 01:33:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:47,092 INFO L93 Difference]: Finished difference Result 4141 states and 4919 transitions. [2025-03-04 01:33:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:47,093 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-03-04 01:33:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:47,098 INFO L225 Difference]: With dead ends: 4141 [2025-03-04 01:33:47,098 INFO L226 Difference]: Without dead ends: 2398 [2025-03-04 01:33:47,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:33:47,100 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 167 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:47,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1692 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2025-03-04 01:33:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2382. [2025-03-04 01:33:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2206 states have (on average 1.1627379873073436) internal successors, (2565), 2221 states have internal predecessors, (2565), 129 states have call successors, (129), 46 states have call predecessors, (129), 46 states have return successors, (129), 114 states have call predecessors, (129), 129 states have call successors, (129) [2025-03-04 01:33:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 2823 transitions. [2025-03-04 01:33:47,244 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 2823 transitions. Word has length 191 [2025-03-04 01:33:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:47,244 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 2823 transitions. [2025-03-04 01:33:47,245 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-03-04 01:33:47,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2823 transitions. [2025-03-04 01:33:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-04 01:33:47,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:47,248 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-03-04 01:33:47,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 01:33:47,248 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:47,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2026027138, now seen corresponding path program 1 times [2025-03-04 01:33:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:47,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353424079] [2025-03-04 01:33:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:47,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-04 01:33:47,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-04 01:33:47,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:47,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353424079] [2025-03-04 01:33:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353424079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:47,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:47,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:47,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611801797] [2025-03-04 01:33:47,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:47,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:47,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:47,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:47,403 INFO L87 Difference]: Start difference. First operand 2382 states and 2823 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-04 01:33:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:47,638 INFO L93 Difference]: Finished difference Result 5936 states and 7031 transitions. [2025-03-04 01:33:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-04 01:33:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:47,646 INFO L225 Difference]: With dead ends: 5936 [2025-03-04 01:33:47,647 INFO L226 Difference]: Without dead ends: 3590 [2025-03-04 01:33:47,649 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-03-04 01:33:47,649 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 158 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:47,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 645 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2025-03-04 01:33:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3580. [2025-03-04 01:33:47,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3305 states have (on average 1.1576399394856278) internal successors, (3826), 3330 states have internal predecessors, (3826), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-04 01:33:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 4224 transitions. [2025-03-04 01:33:47,959 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 4224 transitions. Word has length 191 [2025-03-04 01:33:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:47,959 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 4224 transitions. [2025-03-04 01:33:47,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 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-03-04 01:33:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 4224 transitions. [2025-03-04 01:33:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:33:47,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:47,964 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-03-04 01:33:47,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 01:33:47,964 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:47,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:47,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1812358288, now seen corresponding path program 1 times [2025-03-04 01:33:47,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:47,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596862404] [2025-03-04 01:33:47,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:47,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:47,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:33:48,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:33:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596862404] [2025-03-04 01:33:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596862404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:33:48,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757211686] [2025-03-04 01:33:48,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:33:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:48,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:33:48,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:33:48,680 INFO L87 Difference]: Start difference. First operand 3580 states and 4224 transitions. Second operand has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:49,808 INFO L93 Difference]: Finished difference Result 10242 states and 12048 transitions. [2025-03-04 01:33:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:33:49,808 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 192 [2025-03-04 01:33:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:49,823 INFO L225 Difference]: With dead ends: 10242 [2025-03-04 01:33:49,823 INFO L226 Difference]: Without dead ends: 6706 [2025-03-04 01:33:49,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:33:49,827 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 697 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:49,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 2315 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:33:49,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2025-03-04 01:33:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 3724. [2025-03-04 01:33:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3449 states have (on average 1.1580168164685416) internal successors, (3994), 3474 states have internal predecessors, (3994), 199 states have call successors, (199), 75 states have call predecessors, (199), 75 states have return successors, (199), 174 states have call predecessors, (199), 199 states have call successors, (199) [2025-03-04 01:33:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4392 transitions. [2025-03-04 01:33:50,076 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4392 transitions. Word has length 192 [2025-03-04 01:33:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:50,076 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 4392 transitions. [2025-03-04 01:33:50,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.153846153846154) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-03-04 01:33:50,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4392 transitions. [2025-03-04 01:33:50,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:33:50,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:50,080 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-03-04 01:33:50,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-04 01:33:50,080 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:50,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:50,080 INFO L85 PathProgramCache]: Analyzing trace with hash 472505167, now seen corresponding path program 1 times [2025-03-04 01:33:50,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:50,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018028522] [2025-03-04 01:33:50,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:33:50,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:33:50,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:50,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:50,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:50,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:50,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018028522] [2025-03-04 01:33:50,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018028522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:50,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:50,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:50,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371302550] [2025-03-04 01:33:50,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:50,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:50,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:50,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:50,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:50,278 INFO L87 Difference]: Start difference. First operand 3724 states and 4392 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-03-04 01:33:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:50,765 INFO L93 Difference]: Finished difference Result 8220 states and 9798 transitions. [2025-03-04 01:33:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:33:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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 192 [2025-03-04 01:33:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:50,779 INFO L225 Difference]: With dead ends: 8220 [2025-03-04 01:33:50,779 INFO L226 Difference]: Without dead ends: 4540 [2025-03-04 01:33:50,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:50,783 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 246 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:50,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1486 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2025-03-04 01:33:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 4143. [2025-03-04 01:33:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 3808 states have (on average 1.1488970588235294) internal successors, (4375), 3838 states have internal predecessors, (4375), 239 states have call successors, (239), 95 states have call predecessors, (239), 95 states have return successors, (239), 209 states have call predecessors, (239), 239 states have call successors, (239) [2025-03-04 01:33:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 4853 transitions. [2025-03-04 01:33:51,070 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 4853 transitions. Word has length 192 [2025-03-04 01:33:51,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:51,071 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 4853 transitions. [2025-03-04 01:33:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-03-04 01:33:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 4853 transitions. [2025-03-04 01:33:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 01:33:51,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:51,074 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-03-04 01:33:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 01:33:51,074 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash 35510168, now seen corresponding path program 1 times [2025-03-04 01:33:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892294235] [2025-03-04 01:33:51,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:51,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:51,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:51,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:51,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892294235] [2025-03-04 01:33:51,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892294235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:51,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466481861] [2025-03-04 01:33:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:51,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:51,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:51,406 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:51,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:33:51,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:51,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:51,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:51,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:51,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:33:51,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:51,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:33:52,070 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 37 treesize of output 25 [2025-03-04 01:33:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 10 proven. 558 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-04 01:33:52,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:52,294 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 36 treesize of output 32 [2025-03-04 01:33:52,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:52,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466481861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:52,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:33:52,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 15 [2025-03-04 01:33:52,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24452035] [2025-03-04 01:33:52,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:52,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:33:52,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:52,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:33:52,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:33:52,424 INFO L87 Difference]: Start difference. First operand 4143 states and 4853 transitions. Second operand has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 01:33:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:53,254 INFO L93 Difference]: Finished difference Result 7708 states and 9007 transitions. [2025-03-04 01:33:53,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:33:53,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) Word has length 193 [2025-03-04 01:33:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:53,262 INFO L225 Difference]: With dead ends: 7708 [2025-03-04 01:33:53,262 INFO L226 Difference]: Without dead ends: 3609 [2025-03-04 01:33:53,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=543, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:33:53,266 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 237 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:53,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1196 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:33:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3609 states. [2025-03-04 01:33:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3609 to 3454. [2025-03-04 01:33:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 3176 states have (on average 1.147984886649874) internal successors, (3646), 3200 states have internal predecessors, (3646), 197 states have call successors, (197), 80 states have call predecessors, (197), 80 states have return successors, (197), 173 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-04 01:33:53,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4040 transitions. [2025-03-04 01:33:53,522 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4040 transitions. Word has length 193 [2025-03-04 01:33:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:53,522 INFO L471 AbstractCegarLoop]: Abstraction has 3454 states and 4040 transitions. [2025-03-04 01:33:53,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 8.727272727272727) internal successors, (96), 14 states have internal predecessors, (96), 6 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 3 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 01:33:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4040 transitions. [2025-03-04 01:33:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 01:33:53,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:53,526 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-03-04 01:33:53,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:33:53,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:53,726 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:53,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:53,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1177764226, now seen corresponding path program 1 times [2025-03-04 01:33:53,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:53,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464046731] [2025-03-04 01:33:53,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:53,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:53,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:53,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:53,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464046731] [2025-03-04 01:33:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464046731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:54,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61724976] [2025-03-04 01:33:54,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:54,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:54,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:54,298 INFO L87 Difference]: Start difference. First operand 3454 states and 4040 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-03-04 01:33:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:54,739 INFO L93 Difference]: Finished difference Result 7139 states and 8372 transitions. [2025-03-04 01:33:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:54,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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 193 [2025-03-04 01:33:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:54,745 INFO L225 Difference]: With dead ends: 7139 [2025-03-04 01:33:54,745 INFO L226 Difference]: Without dead ends: 3737 [2025-03-04 01:33:54,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:33:54,749 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 167 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:54,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1643 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:54,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2025-03-04 01:33:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3212. [2025-03-04 01:33:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2993 states have (on average 1.1450050116939525) internal successors, (3427), 3011 states have internal predecessors, (3427), 155 states have call successors, (155), 63 states have call predecessors, (155), 63 states have return successors, (155), 137 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-04 01:33:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 3737 transitions. [2025-03-04 01:33:55,022 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 3737 transitions. Word has length 193 [2025-03-04 01:33:55,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:55,022 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 3737 transitions. [2025-03-04 01:33:55,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 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-03-04 01:33:55,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 3737 transitions. [2025-03-04 01:33:55,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 01:33:55,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:55,025 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-03-04 01:33:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-04 01:33:55,025 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:55,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 981250721, now seen corresponding path program 1 times [2025-03-04 01:33:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190167890] [2025-03-04 01:33:55,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:55,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:55,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:55,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:55,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:55,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:55,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190167890] [2025-03-04 01:33:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190167890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:55,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:55,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:55,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376433345] [2025-03-04 01:33:55,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:55,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:55,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:55,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:55,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:55,228 INFO L87 Difference]: Start difference. First operand 3212 states and 3737 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-04 01:33:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:55,485 INFO L93 Difference]: Finished difference Result 6378 states and 7420 transitions. [2025-03-04 01:33:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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 193 [2025-03-04 01:33:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:55,491 INFO L225 Difference]: With dead ends: 6378 [2025-03-04 01:33:55,491 INFO L226 Difference]: Without dead ends: 3218 [2025-03-04 01:33:55,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:55,494 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 159 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:55,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 922 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:55,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2025-03-04 01:33:55,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 3204. [2025-03-04 01:33:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3204 states, 2984 states have (on average 1.1414209115281502) internal successors, (3406), 3002 states have internal predecessors, (3406), 155 states have call successors, (155), 64 states have call predecessors, (155), 64 states have return successors, (155), 137 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-04 01:33:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3204 states to 3204 states and 3716 transitions. [2025-03-04 01:33:55,710 INFO L78 Accepts]: Start accepts. Automaton has 3204 states and 3716 transitions. Word has length 193 [2025-03-04 01:33:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:55,710 INFO L471 AbstractCegarLoop]: Abstraction has 3204 states and 3716 transitions. [2025-03-04 01:33:55,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 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-03-04 01:33:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 3204 states and 3716 transitions. [2025-03-04 01:33:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 01:33:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:55,713 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-03-04 01:33:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-04 01:33:55,713 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1110333440, now seen corresponding path program 1 times [2025-03-04 01:33:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870765571] [2025-03-04 01:33:55,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:55,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:55,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:33:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870765571] [2025-03-04 01:33:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870765571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:55,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:55,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:55,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792194310] [2025-03-04 01:33:55,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:55,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:55,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:55,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:55,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:55,872 INFO L87 Difference]: Start difference. First operand 3204 states and 3716 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-04 01:33:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:56,174 INFO L93 Difference]: Finished difference Result 6321 states and 7331 transitions. [2025-03-04 01:33:56,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:56,175 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 193 [2025-03-04 01:33:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:56,180 INFO L225 Difference]: With dead ends: 6321 [2025-03-04 01:33:56,180 INFO L226 Difference]: Without dead ends: 3169 [2025-03-04 01:33:56,183 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-03-04 01:33:56,183 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 145 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:56,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 561 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:56,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-03-04 01:33:56,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 2493. [2025-03-04 01:33:56,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2332 states have (on average 1.1376500857632934) internal successors, (2653), 2344 states have internal predecessors, (2653), 113 states have call successors, (113), 47 states have call predecessors, (113), 47 states have return successors, (113), 101 states have call predecessors, (113), 113 states have call successors, (113) [2025-03-04 01:33:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2879 transitions. [2025-03-04 01:33:56,413 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2879 transitions. Word has length 193 [2025-03-04 01:33:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:56,413 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2879 transitions. [2025-03-04 01:33:56,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-03-04 01:33:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2879 transitions. [2025-03-04 01:33:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 01:33:56,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:56,416 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-03-04 01:33:56,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 01:33:56,416 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1555152550, now seen corresponding path program 1 times [2025-03-04 01:33:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:56,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828696490] [2025-03-04 01:33:56,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:56,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:56,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:56,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:56,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 9 proven. 57 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:56,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828696490] [2025-03-04 01:33:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828696490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:56,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597916322] [2025-03-04 01:33:56,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:56,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:56,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:56,674 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:56,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 01:33:56,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-04 01:33:56,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 01:33:56,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:56,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:56,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:33:56,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:57,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:33:57,189 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 11 treesize of output 7 [2025-03-04 01:33:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 8 proven. 528 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2025-03-04 01:33:57,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:57,499 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 32 treesize of output 28 [2025-03-04 01:33:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:33:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597916322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:57,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:33:57,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 25 [2025-03-04 01:33:57,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946520365] [2025-03-04 01:33:57,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:57,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:33:57,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:57,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:33:57,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:33:57,592 INFO L87 Difference]: Start difference. First operand 2493 states and 2879 transitions. Second operand has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-04 01:33:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:59,717 INFO L93 Difference]: Finished difference Result 5313 states and 6120 transitions. [2025-03-04 01:33:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 01:33:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) Word has length 193 [2025-03-04 01:33:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:59,723 INFO L225 Difference]: With dead ends: 5313 [2025-03-04 01:33:59,723 INFO L226 Difference]: Without dead ends: 2872 [2025-03-04 01:33:59,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1639 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1120, Invalid=5360, Unknown=0, NotChecked=0, Total=6480 [2025-03-04 01:33:59,726 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1640 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 519 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 2159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 519 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:59,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2717 Invalid, 2159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [519 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:33:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2025-03-04 01:33:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 1544. [2025-03-04 01:33:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 1375 states have (on average 1.1396363636363636) internal successors, (1567), 1383 states have internal predecessors, (1567), 116 states have call successors, (116), 52 states have call predecessors, (116), 52 states have return successors, (116), 108 states have call predecessors, (116), 116 states have call successors, (116) [2025-03-04 01:33:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1799 transitions. [2025-03-04 01:33:59,890 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1799 transitions. Word has length 193 [2025-03-04 01:33:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:59,891 INFO L471 AbstractCegarLoop]: Abstraction has 1544 states and 1799 transitions. [2025-03-04 01:33:59,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.7272727272727275) internal successors, (148), 25 states have internal predecessors, (148), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 5 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-04 01:33:59,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1799 transitions. [2025-03-04 01:33:59,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:33:59,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:59,892 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] [2025-03-04 01:33:59,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:00,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-04 01:34:00,094 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:00,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -552825343, now seen corresponding path program 1 times [2025-03-04 01:34:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775231370] [2025-03-04 01:34:00,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:00,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:00,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:00,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:00,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:00,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775231370] [2025-03-04 01:34:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775231370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079041653] [2025-03-04 01:34:00,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:00,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:00,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:00,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:00,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 01:34:00,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:00,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:00,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:00,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:00,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:34:00,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:00,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 480 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-04 01:34:01,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:01,247 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 36 treesize of output 32 [2025-03-04 01:34:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:01,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079041653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:01,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:01,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 21 [2025-03-04 01:34:01,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995759732] [2025-03-04 01:34:01,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:01,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 01:34:01,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:01,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 01:34:01,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:34:01,347 INFO L87 Difference]: Start difference. First operand 1544 states and 1799 transitions. Second operand has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 01:34:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:01,929 INFO L93 Difference]: Finished difference Result 2888 states and 3361 transitions. [2025-03-04 01:34:01,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:34:01,929 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) Word has length 196 [2025-03-04 01:34:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:01,933 INFO L225 Difference]: With dead ends: 2888 [2025-03-04 01:34:01,933 INFO L226 Difference]: Without dead ends: 1404 [2025-03-04 01:34:01,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 379 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2025-03-04 01:34:01,935 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 145 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:01,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1667 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-04 01:34:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1336. [2025-03-04 01:34:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1189 states have (on average 1.1379310344827587) internal successors, (1353), 1196 states have internal predecessors, (1353), 102 states have call successors, (102), 44 states have call predecessors, (102), 44 states have return successors, (102), 95 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-04 01:34:02,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1557 transitions. [2025-03-04 01:34:02,095 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1557 transitions. Word has length 196 [2025-03-04 01:34:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:02,096 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1557 transitions. [2025-03-04 01:34:02,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 6.352941176470588) internal successors, (108), 19 states have internal predecessors, (108), 6 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 4 states have call predecessors, (48), 6 states have call successors, (48) [2025-03-04 01:34:02,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1557 transitions. [2025-03-04 01:34:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:34:02,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:02,097 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] [2025-03-04 01:34:02,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 01:34:02,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:02,298 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -394982815, now seen corresponding path program 1 times [2025-03-04 01:34:02,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:02,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616998475] [2025-03-04 01:34:02,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:02,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:02,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:02,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:02,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:02,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:02,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616998475] [2025-03-04 01:34:02,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616998475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:02,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629543231] [2025-03-04 01:34:02,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:02,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:02,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:02,722 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:02,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 01:34:02,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:02,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-04 01:34:02,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:03,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:03,192 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 11 treesize of output 7 [2025-03-04 01:34:03,225 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 11 treesize of output 7 [2025-03-04 01:34:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-04 01:34:03,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:03,617 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 27 treesize of output 23 [2025-03-04 01:34:03,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:03,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629543231] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:03,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:03,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 18] total 30 [2025-03-04 01:34:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063816558] [2025-03-04 01:34:03,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:03,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 01:34:03,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:03,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 01:34:03,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:34:03,710 INFO L87 Difference]: Start difference. First operand 1336 states and 1557 transitions. Second operand has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-04 01:34:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:05,196 INFO L93 Difference]: Finished difference Result 2881 states and 3349 transitions. [2025-03-04 01:34:05,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 01:34:05,197 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) Word has length 196 [2025-03-04 01:34:05,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:05,201 INFO L225 Difference]: With dead ends: 2881 [2025-03-04 01:34:05,201 INFO L226 Difference]: Without dead ends: 1631 [2025-03-04 01:34:05,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=920, Invalid=4336, Unknown=0, NotChecked=0, Total=5256 [2025-03-04 01:34:05,204 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2335 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 815 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2335 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 815 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:05,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2335 Valid, 2246 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [815 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:34:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-03-04 01:34:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1417. [2025-03-04 01:34:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1246 states have (on average 1.1324237560192616) internal successors, (1411), 1254 states have internal predecessors, (1411), 117 states have call successors, (117), 53 states have call predecessors, (117), 53 states have return successors, (117), 109 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-04 01:34:05,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1645 transitions. [2025-03-04 01:34:05,400 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1645 transitions. Word has length 196 [2025-03-04 01:34:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:05,401 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 1645 transitions. [2025-03-04 01:34:05,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 5.481481481481482) internal successors, (148), 30 states have internal predecessors, (148), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-04 01:34:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1645 transitions. [2025-03-04 01:34:05,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:34:05,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:05,402 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] [2025-03-04 01:34:05,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 01:34:05,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:05,603 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 981309121, now seen corresponding path program 1 times [2025-03-04 01:34:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639647319] [2025-03-04 01:34:05,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:05,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:05,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:05,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:05,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:05,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639647319] [2025-03-04 01:34:05,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639647319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:05,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137717097] [2025-03-04 01:34:05,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:05,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:05,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:05,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 01:34:06,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:06,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:06,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:06,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:06,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:34:06,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:06,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:06,394 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 307 treesize of output 251 [2025-03-04 01:34:06,397 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 251 treesize of output 195 [2025-03-04 01:34:06,400 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 195 treesize of output 171 [2025-03-04 01:34:06,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:06,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:34:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137717097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:34:06,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-04 01:34:06,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434955099] [2025-03-04 01:34:06,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:06,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:06,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:34:06,426 INFO L87 Difference]: Start difference. First operand 1417 states and 1645 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-03-04 01:34:06,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:06,702 INFO L93 Difference]: Finished difference Result 2808 states and 3260 transitions. [2025-03-04 01:34:06,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:34:06,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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 196 [2025-03-04 01:34:06,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:06,706 INFO L225 Difference]: With dead ends: 2808 [2025-03-04 01:34:06,706 INFO L226 Difference]: Without dead ends: 1457 [2025-03-04 01:34:06,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:34:06,708 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 92 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:06,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1013 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2025-03-04 01:34:06,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1334. [2025-03-04 01:34:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1188 states have (on average 1.132996632996633) internal successors, (1346), 1195 states have internal predecessors, (1346), 98 states have call successors, (98), 47 states have call predecessors, (98), 47 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 01:34:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1542 transitions. [2025-03-04 01:34:06,858 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1542 transitions. Word has length 196 [2025-03-04 01:34:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:06,858 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1542 transitions. [2025-03-04 01:34:06,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-03-04 01:34:06,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1542 transitions. [2025-03-04 01:34:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-04 01:34:06,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:06,860 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] [2025-03-04 01:34:06,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 01:34:07,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-04 01:34:07,060 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:07,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1582608604, now seen corresponding path program 1 times [2025-03-04 01:34:07,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:07,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373285480] [2025-03-04 01:34:07,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:07,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:07,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-04 01:34:07,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-04 01:34:07,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:07,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373285480] [2025-03-04 01:34:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373285480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:07,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:07,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:34:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87796032] [2025-03-04 01:34:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:34:07,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:34:07,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:34:07,117 INFO L87 Difference]: Start difference. First operand 1334 states and 1542 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-04 01:34:07,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:07,276 INFO L93 Difference]: Finished difference Result 2345 states and 2717 transitions. [2025-03-04 01:34:07,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:34:07,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 196 [2025-03-04 01:34:07,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:07,279 INFO L225 Difference]: With dead ends: 2345 [2025-03-04 01:34:07,279 INFO L226 Difference]: Without dead ends: 1077 [2025-03-04 01:34:07,280 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-03-04 01:34:07,280 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:07,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 495 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:07,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-03-04 01:34:07,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1077. [2025-03-04 01:34:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 931 states have (on average 1.1235230934479055) internal successors, (1046), 938 states have internal predecessors, (1046), 98 states have call successors, (98), 47 states have call predecessors, (98), 47 states have return successors, (98), 91 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-04 01:34:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1242 transitions. [2025-03-04 01:34:07,433 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1242 transitions. Word has length 196 [2025-03-04 01:34:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:07,433 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1242 transitions. [2025-03-04 01:34:07,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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-03-04 01:34:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1242 transitions. [2025-03-04 01:34:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 01:34:07,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:07,435 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:07,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-04 01:34:07,435 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:07,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:07,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1263801345, now seen corresponding path program 1 times [2025-03-04 01:34:07,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:07,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878010396] [2025-03-04 01:34:07,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:07,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 01:34:07,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 01:34:07,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:07,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:07,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:07,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878010396] [2025-03-04 01:34:07,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878010396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:07,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60514648] [2025-03-04 01:34:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:07,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:07,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:07,682 INFO L87 Difference]: Start difference. First operand 1077 states and 1242 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-03-04 01:34:07,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:07,991 INFO L93 Difference]: Finished difference Result 2179 states and 2518 transitions. [2025-03-04 01:34:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:07,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 198 [2025-03-04 01:34:07,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:07,995 INFO L225 Difference]: With dead ends: 2179 [2025-03-04 01:34:07,996 INFO L226 Difference]: Without dead ends: 1168 [2025-03-04 01:34:07,997 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-03-04 01:34:07,997 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 132 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:07,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 780 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:07,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-04 01:34:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1095. [2025-03-04 01:34:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 941 states have (on average 1.1190223166843782) internal successors, (1053), 948 states have internal predecessors, (1053), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 01:34:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1263 transitions. [2025-03-04 01:34:08,157 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1263 transitions. Word has length 198 [2025-03-04 01:34:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:08,157 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1263 transitions. [2025-03-04 01:34:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-03-04 01:34:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1263 transitions. [2025-03-04 01:34:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 01:34:08,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:08,159 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] [2025-03-04 01:34:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-04 01:34:08,159 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash 255466051, now seen corresponding path program 1 times [2025-03-04 01:34:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712708139] [2025-03-04 01:34:08,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:08,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 01:34:08,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 01:34:08,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:08,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:08,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-03-04 01:34:08,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:08,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712708139] [2025-03-04 01:34:08,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712708139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:08,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:08,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:34:08,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812788149] [2025-03-04 01:34:08,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:08,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:34:08,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:08,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:34:08,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:34:08,358 INFO L87 Difference]: Start difference. First operand 1095 states and 1263 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-03-04 01:34:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:08,602 INFO L93 Difference]: Finished difference Result 2177 states and 2508 transitions. [2025-03-04 01:34:08,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:34:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 198 [2025-03-04 01:34:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:08,605 INFO L225 Difference]: With dead ends: 2177 [2025-03-04 01:34:08,605 INFO L226 Difference]: Without dead ends: 1148 [2025-03-04 01:34:08,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-03-04 01:34:08,607 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 125 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:08,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1025 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:08,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-03-04 01:34:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1075. [2025-03-04 01:34:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 921 states have (on average 1.1085776330076005) internal successors, (1021), 928 states have internal predecessors, (1021), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 01:34:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1231 transitions. [2025-03-04 01:34:08,762 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1231 transitions. Word has length 198 [2025-03-04 01:34:08,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:08,762 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1231 transitions. [2025-03-04 01:34:08,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-03-04 01:34:08,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1231 transitions. [2025-03-04 01:34:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-04 01:34:08,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:08,763 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] [2025-03-04 01:34:08,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-04 01:34:08,763 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:08,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:08,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1728344955, now seen corresponding path program 1 times [2025-03-04 01:34:08,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:08,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381734220] [2025-03-04 01:34:08,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:08,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:08,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-04 01:34:08,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-04 01:34:08,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:08,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:09,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:09,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381734220] [2025-03-04 01:34:09,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381734220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:09,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:09,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:09,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625400455] [2025-03-04 01:34:09,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:09,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:09,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:09,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:09,138 INFO L87 Difference]: Start difference. First operand 1075 states and 1231 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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-03-04 01:34:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:09,423 INFO L93 Difference]: Finished difference Result 1397 states and 1594 transitions. [2025-03-04 01:34:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:09,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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 198 [2025-03-04 01:34:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:09,426 INFO L225 Difference]: With dead ends: 1397 [2025-03-04 01:34:09,426 INFO L226 Difference]: Without dead ends: 1395 [2025-03-04 01:34:09,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:34:09,427 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 118 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:09,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1251 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-04 01:34:09,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1283. [2025-03-04 01:34:09,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1129 states have (on average 1.1045172719220548) internal successors, (1247), 1136 states have internal predecessors, (1247), 105 states have call successors, (105), 48 states have call predecessors, (105), 48 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2025-03-04 01:34:09,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1457 transitions. [2025-03-04 01:34:09,585 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1457 transitions. Word has length 198 [2025-03-04 01:34:09,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:09,585 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1457 transitions. [2025-03-04 01:34:09,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 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-03-04 01:34:09,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1457 transitions. [2025-03-04 01:34:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:34:09,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:09,586 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] [2025-03-04 01:34:09,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-03-04 01:34:09,587 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:09,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1222109183, now seen corresponding path program 1 times [2025-03-04 01:34:09,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:09,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705923724] [2025-03-04 01:34:09,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:09,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:09,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:09,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:09,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:09,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:10,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:10,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:10,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705923724] [2025-03-04 01:34:10,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705923724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:10,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:10,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:34:10,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186584118] [2025-03-04 01:34:10,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:10,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:34:10,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:10,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:34:10,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:34:10,214 INFO L87 Difference]: Start difference. First operand 1283 states and 1457 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-03-04 01:34:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:10,717 INFO L93 Difference]: Finished difference Result 3040 states and 3455 transitions. [2025-03-04 01:34:10,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:10,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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 200 [2025-03-04 01:34:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:10,721 INFO L225 Difference]: With dead ends: 3040 [2025-03-04 01:34:10,721 INFO L226 Difference]: Without dead ends: 1823 [2025-03-04 01:34:10,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:34:10,723 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 94 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2119 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:10,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 2119 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:10,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2025-03-04 01:34:10,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1820. [2025-03-04 01:34:10,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1820 states, 1620 states have (on average 1.10679012345679) internal successors, (1793), 1630 states have internal predecessors, (1793), 135 states have call successors, (135), 64 states have call predecessors, (135), 64 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 01:34:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 2063 transitions. [2025-03-04 01:34:10,940 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 2063 transitions. Word has length 200 [2025-03-04 01:34:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:10,940 INFO L471 AbstractCegarLoop]: Abstraction has 1820 states and 2063 transitions. [2025-03-04 01:34:10,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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-03-04 01:34:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 2063 transitions. [2025-03-04 01:34:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:34:10,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:10,942 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:10,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-03-04 01:34:10,942 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1265403650, now seen corresponding path program 1 times [2025-03-04 01:34:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102851995] [2025-03-04 01:34:10,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:10,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:10,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:10,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:10,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102851995] [2025-03-04 01:34:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102851995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354643343] [2025-03-04 01:34:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:11,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:11,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:11,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:11,030 INFO L87 Difference]: Start difference. First operand 1820 states and 2063 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 01:34:11,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:11,345 INFO L93 Difference]: Finished difference Result 3559 states and 4031 transitions. [2025-03-04 01:34:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 200 [2025-03-04 01:34:11,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:11,349 INFO L225 Difference]: With dead ends: 3559 [2025-03-04 01:34:11,349 INFO L226 Difference]: Without dead ends: 1805 [2025-03-04 01:34:11,351 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-03-04 01:34:11,351 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 88 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:11,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 782 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states. [2025-03-04 01:34:11,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 1796. [2025-03-04 01:34:11,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1596 states have (on average 1.1008771929824561) internal successors, (1757), 1606 states have internal predecessors, (1757), 135 states have call successors, (135), 64 states have call predecessors, (135), 64 states have return successors, (135), 125 states have call predecessors, (135), 135 states have call successors, (135) [2025-03-04 01:34:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2027 transitions. [2025-03-04 01:34:11,652 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2027 transitions. Word has length 200 [2025-03-04 01:34:11,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:11,652 INFO L471 AbstractCegarLoop]: Abstraction has 1796 states and 2027 transitions. [2025-03-04 01:34:11,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 01:34:11,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2027 transitions. [2025-03-04 01:34:11,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:34:11,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:11,654 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] [2025-03-04 01:34:11,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-03-04 01:34:11,654 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:11,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1098035936, now seen corresponding path program 1 times [2025-03-04 01:34:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:11,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394635116] [2025-03-04 01:34:11,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:11,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:11,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:11,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:11,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:11,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:11,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394635116] [2025-03-04 01:34:11,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394635116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:11,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:11,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:11,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283229840] [2025-03-04 01:34:11,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:11,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:11,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:11,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:11,744 INFO L87 Difference]: Start difference. First operand 1796 states and 2027 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 01:34:12,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:12,039 INFO L93 Difference]: Finished difference Result 3533 states and 3986 transitions. [2025-03-04 01:34:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:12,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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 200 [2025-03-04 01:34:12,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:12,044 INFO L225 Difference]: With dead ends: 3533 [2025-03-04 01:34:12,044 INFO L226 Difference]: Without dead ends: 1803 [2025-03-04 01:34:12,046 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-03-04 01:34:12,047 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 87 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:12,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 945 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:12,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-04 01:34:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1604. [2025-03-04 01:34:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1461 states have (on average 1.0978781656399725) internal successors, (1604), 1468 states have internal predecessors, (1604), 96 states have call successors, (96), 46 states have call predecessors, (96), 46 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:34:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 1796 transitions. [2025-03-04 01:34:12,225 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 1796 transitions. Word has length 200 [2025-03-04 01:34:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:12,225 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 1796 transitions. [2025-03-04 01:34:12,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 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-03-04 01:34:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 1796 transitions. [2025-03-04 01:34:12,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:34:12,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:12,227 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] [2025-03-04 01:34:12,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-03-04 01:34:12,227 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:12,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:12,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1389476897, now seen corresponding path program 1 times [2025-03-04 01:34:12,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:12,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520776690] [2025-03-04 01:34:12,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:12,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:12,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:12,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:12,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:12,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:12,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520776690] [2025-03-04 01:34:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520776690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:34:12,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507299677] [2025-03-04 01:34:12,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:34:12,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:12,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:34:12,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:34:12,601 INFO L87 Difference]: Start difference. First operand 1604 states and 1796 transitions. Second operand has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-04 01:34:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:12,943 INFO L93 Difference]: Finished difference Result 3429 states and 3854 transitions. [2025-03-04 01:34:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:34:12,943 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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 200 [2025-03-04 01:34:12,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:12,946 INFO L225 Difference]: With dead ends: 3429 [2025-03-04 01:34:12,946 INFO L226 Difference]: Without dead ends: 1891 [2025-03-04 01:34:12,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:34:12,948 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 131 mSDsluCounter, 2014 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:12,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2333 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:34:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2025-03-04 01:34:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1580. [2025-03-04 01:34:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1437 states have (on average 1.0953375086986779) internal successors, (1574), 1444 states have internal predecessors, (1574), 96 states have call successors, (96), 46 states have call predecessors, (96), 46 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-04 01:34:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 1766 transitions. [2025-03-04 01:34:13,105 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 1766 transitions. Word has length 200 [2025-03-04 01:34:13,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:13,105 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 1766 transitions. [2025-03-04 01:34:13,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.777777777777779) internal successors, (88), 9 states have internal predecessors, (88), 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-03-04 01:34:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 1766 transitions. [2025-03-04 01:34:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 01:34:13,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:13,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:13,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-03-04 01:34:13,107 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:13,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:13,107 INFO L85 PathProgramCache]: Analyzing trace with hash -615286112, now seen corresponding path program 1 times [2025-03-04 01:34:13,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:13,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452668757] [2025-03-04 01:34:13,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:13,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:13,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:13,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:13,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:13,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 30 proven. 36 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:13,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452668757] [2025-03-04 01:34:13,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452668757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:13,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147111872] [2025-03-04 01:34:13,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:13,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:13,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:13,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 01:34:13,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 01:34:13,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 01:34:13,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:13,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:13,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:34:13,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:13,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:13,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-04 01:34:13,904 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 19 treesize of output 11 [2025-03-04 01:34:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 13 proven. 543 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2025-03-04 01:34:13,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:14,117 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 27 treesize of output 23 [2025-03-04 01:34:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147111872] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:14,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2025-03-04 01:34:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833140934] [2025-03-04 01:34:14,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 01:34:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:14,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 01:34:14,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:34:14,168 INFO L87 Difference]: Start difference. First operand 1580 states and 1766 transitions. Second operand has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-04 01:34:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:15,677 INFO L93 Difference]: Finished difference Result 2909 states and 3267 transitions. [2025-03-04 01:34:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 01:34:15,678 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) Word has length 200 [2025-03-04 01:34:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:15,681 INFO L225 Difference]: With dead ends: 2909 [2025-03-04 01:34:15,681 INFO L226 Difference]: Without dead ends: 1395 [2025-03-04 01:34:15,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=839, Invalid=3193, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 01:34:15,682 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 776 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 1510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:15,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 2041 Invalid, 1510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:34:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2025-03-04 01:34:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2025-03-04 01:34:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 705 states have (on average 1.0893617021276596) internal successors, (768), 708 states have internal predecessors, (768), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:34:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 872 transitions. [2025-03-04 01:34:15,782 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 872 transitions. Word has length 200 [2025-03-04 01:34:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:15,782 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 872 transitions. [2025-03-04 01:34:15,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 9.0) internal successors, (153), 19 states have internal predecessors, (153), 8 states have call successors, (69), 3 states have call predecessors, (69), 5 states have return successors, (69), 6 states have call predecessors, (69), 8 states have call successors, (69) [2025-03-04 01:34:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 872 transitions. [2025-03-04 01:34:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 01:34:15,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:15,784 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-03-04 01:34:15,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 01:34:15,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-03-04 01:34:15,984 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:15,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:15,984 INFO L85 PathProgramCache]: Analyzing trace with hash -229831331, now seen corresponding path program 1 times [2025-03-04 01:34:15,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:15,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093810351] [2025-03-04 01:34:15,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:15,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:16,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:16,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:16,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:16,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:16,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:16,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093810351] [2025-03-04 01:34:16,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093810351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:16,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:16,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:34:16,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985510867] [2025-03-04 01:34:16,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:16,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:34:16,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:16,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:34:16,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:34:16,612 INFO L87 Difference]: Start difference. First operand 785 states and 872 transitions. Second operand has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 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-03-04 01:34:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:17,006 INFO L93 Difference]: Finished difference Result 866 states and 959 transitions. [2025-03-04 01:34:17,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:34:17,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 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-03-04 01:34:17,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:17,008 INFO L225 Difference]: With dead ends: 866 [2025-03-04 01:34:17,009 INFO L226 Difference]: Without dead ends: 864 [2025-03-04 01:34:17,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:34:17,009 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 160 mSDsluCounter, 1352 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:17,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1522 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:17,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-04 01:34:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 814. [2025-03-04 01:34:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 734 states have (on average 1.0885558583106267) internal successors, (799), 737 states have internal predecessors, (799), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:34:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 903 transitions. [2025-03-04 01:34:17,105 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 903 transitions. Word has length 204 [2025-03-04 01:34:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 903 transitions. [2025-03-04 01:34:17,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 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-03-04 01:34:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 903 transitions. [2025-03-04 01:34:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 01:34:17,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:17,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-03-04 01:34:17,107 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:17,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:17,107 INFO L85 PathProgramCache]: Analyzing trace with hash 657672350, now seen corresponding path program 1 times [2025-03-04 01:34:17,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:17,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542803414] [2025-03-04 01:34:17,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:17,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:17,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 01:34:17,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542803414] [2025-03-04 01:34:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542803414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:34:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:34:17,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:34:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151349747] [2025-03-04 01:34:17,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:34:17,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:34:17,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:17,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:34:17,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:34:17,278 INFO L87 Difference]: Start difference. First operand 814 states and 903 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-03-04 01:34:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:17,416 INFO L93 Difference]: Finished difference Result 1560 states and 1731 transitions. [2025-03-04 01:34:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:17,416 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-03-04 01:34:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:17,419 INFO L225 Difference]: With dead ends: 1560 [2025-03-04 01:34:17,419 INFO L226 Difference]: Without dead ends: 816 [2025-03-04 01:34:17,419 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-03-04 01:34:17,419 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 40 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:17,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 591 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:34:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-04 01:34:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 814. [2025-03-04 01:34:17,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 734 states have (on average 1.0844686648501363) internal successors, (796), 737 states have internal predecessors, (796), 52 states have call successors, (52), 27 states have call predecessors, (52), 27 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:34:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 900 transitions. [2025-03-04 01:34:17,516 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 900 transitions. Word has length 204 [2025-03-04 01:34:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:17,516 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 900 transitions. [2025-03-04 01:34:17,516 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-03-04 01:34:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 900 transitions. [2025-03-04 01:34:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 01:34:17,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:17,517 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:17,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-03-04 01:34:17,517 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:17,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash 281250141, now seen corresponding path program 1 times [2025-03-04 01:34:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:17,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001501210] [2025-03-04 01:34:17,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:17,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:17,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:17,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:17,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001501210] [2025-03-04 01:34:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001501210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877003685] [2025-03-04 01:34:17,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:17,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:17,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:17,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:17,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 01:34:18,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:18,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:18,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:18,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:18,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:34:18,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:18,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:18,355 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 35 treesize of output 23 [2025-03-04 01:34:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 493 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:34:18,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:18,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-04 01:34:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 21 proven. 45 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877003685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:18,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 16 [2025-03-04 01:34:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609537321] [2025-03-04 01:34:18,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:18,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:34:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:18,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:34:18,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:34:18,570 INFO L87 Difference]: Start difference. First operand 814 states and 900 transitions. Second operand has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-04 01:34:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:18,908 INFO L93 Difference]: Finished difference Result 1350 states and 1494 transitions. [2025-03-04 01:34:18,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:34:18,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) Word has length 204 [2025-03-04 01:34:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:18,910 INFO L225 Difference]: With dead ends: 1350 [2025-03-04 01:34:18,910 INFO L226 Difference]: Without dead ends: 606 [2025-03-04 01:34:18,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 403 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:34:18,911 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 284 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:18,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 935 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-03-04 01:34:18,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 538. [2025-03-04 01:34:18,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 478 states have (on average 1.0878661087866108) internal successors, (520), 479 states have internal predecessors, (520), 38 states have call successors, (38), 21 states have call predecessors, (38), 21 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:34:18,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 596 transitions. [2025-03-04 01:34:18,997 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 596 transitions. Word has length 204 [2025-03-04 01:34:18,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:18,997 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 596 transitions. [2025-03-04 01:34:18,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 8.307692307692308) internal successors, (108), 16 states have internal predecessors, (108), 7 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 7 states have call successors, (48) [2025-03-04 01:34:18,997 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 596 transitions. [2025-03-04 01:34:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-04 01:34:18,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:19,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 01:34:19,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-03-04 01:34:19,199 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:19,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:19,199 INFO L85 PathProgramCache]: Analyzing trace with hash 588323007, now seen corresponding path program 1 times [2025-03-04 01:34:19,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:34:19,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901760582] [2025-03-04 01:34:19,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:34:19,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:19,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:19,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:34:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901760582] [2025-03-04 01:34:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901760582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003286185] [2025-03-04 01:34:19,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:19,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:19,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:34:19,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:34:19,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 01:34:19,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-04 01:34:19,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-04 01:34:19,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:19,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:19,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 01:34:19,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:19,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:34:19,930 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 25 treesize of output 17 [2025-03-04 01:34:19,931 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-03-04 01:34:19,944 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 19 treesize of output 11 [2025-03-04 01:34:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 17 proven. 411 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-04 01:34:19,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:20,144 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 27 treesize of output 23 [2025-03-04 01:34:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 01:34:20,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003286185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:34:20,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:34:20,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15 [2025-03-04 01:34:20,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005766061] [2025-03-04 01:34:20,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:20,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:34:20,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:34:20,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:34:20,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:34:20,180 INFO L87 Difference]: Start difference. First operand 538 states and 596 transitions. Second operand has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-04 01:34:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:20,862 INFO L93 Difference]: Finished difference Result 1040 states and 1152 transitions. [2025-03-04 01:34:20,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 01:34:20,862 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) Word has length 204 [2025-03-04 01:34:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:20,864 INFO L225 Difference]: With dead ends: 1040 [2025-03-04 01:34:20,864 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 01:34:20,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 403 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=316, Invalid=1016, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:34:20,865 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 397 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:20,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1245 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:34:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 01:34:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 01:34:20,866 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-03-04 01:34:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 01:34:20,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-03-04 01:34:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:20,866 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 01:34:20,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.692307692307692) internal successors, (126), 15 states have internal predecessors, (126), 6 states have call successors, (47), 3 states have call predecessors, (47), 5 states have return successors, (47), 4 states have call predecessors, (47), 6 states have call successors, (47) [2025-03-04 01:34:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 01:34:20,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 01:34:20,869 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:34:20,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 01:34:21,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:34:21,072 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-03-04 01:34:21,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.