./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-ap_file-19.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 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:31:43,438 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:31:43,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:31:43,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:31:43,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:31:43,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:31:43,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:31:43,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:31:43,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:31:43,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:31:43,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:31:43,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:31:43,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:31:43,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:31:43,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:31:43,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:31:43,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:31:43,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:31:43,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:31:43,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:31:43,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:31:43,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:31:43,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:31:43,526 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 -> 47ed50ee23bce943b6d8d1ef42e1233b8fd974d0271bfb8e1001a06043bdfcc4 [2025-03-17 05:31:43,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:31:43,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:31:43,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:31:43,765 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:31:43,765 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:31:43,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-17 05:31:44,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77d16c4b/beb66a770da344e3b0b091a0ba53fdb1/FLAGa09b4e24b [2025-03-17 05:31:45,139 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:31:45,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-17 05:31:45,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77d16c4b/beb66a770da344e3b0b091a0ba53fdb1/FLAGa09b4e24b [2025-03-17 05:31:45,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e77d16c4b/beb66a770da344e3b0b091a0ba53fdb1 [2025-03-17 05:31:45,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:31:45,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:31:45,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:31:45,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:31:45,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:31:45,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f3a095d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45, skipping insertion in model container [2025-03-17 05:31:45,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,493 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:31:45,598 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-ap_file-19.i[917,930] [2025-03-17 05:31:45,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:31:45,666 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:31:45,674 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-ap_file-19.i[917,930] [2025-03-17 05:31:45,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:31:45,726 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:31:45,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45 WrapperNode [2025-03-17 05:31:45,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:31:45,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:31:45,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:31:45,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:31:45,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,775 INFO L138 Inliner]: procedures = 26, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-03-17 05:31:45,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:31:45,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:31:45,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:31:45,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:31:45,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,785 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,802 INFO L175 MemorySlicer]: Split 124 memory accesses to 6 slices as follows [2, 8, 43, 27, 26, 18]. 35 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 3, 4, 2, 2]. The 15 writes are split as follows [0, 1, 4, 6, 2, 2]. [2025-03-17 05:31:45,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:31:45,817 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:31:45,817 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:31:45,817 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:31:45,818 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (1/1) ... [2025-03-17 05:31:45,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:31:45,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:31:45,842 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-17 05:31:45,848 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-17 05:31:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:31:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:31:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:31:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:31:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:31:45,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:31:45,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:31:45,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:31:45,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:31:45,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:31:45,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:31:46,312 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L111: havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~bitwise74#1;havoc property_#t~mem75#1;havoc property_#t~ite92#1;havoc property_#t~mem87#1;havoc property_#t~mem80#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~ite86#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~mem88#1;havoc property_#t~ite91#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite109#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem100#1;havoc property_#t~ite103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short126#1; [2025-03-17 05:31:46,352 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-17 05:31:46,352 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:31:46,375 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:31:46,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:31:46,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:31:46 BoogieIcfgContainer [2025-03-17 05:31:46,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:31:46,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:31:46,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:31:46,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:31:46,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:31:45" (1/3) ... [2025-03-17 05:31:46,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@833a7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:31:46, skipping insertion in model container [2025-03-17 05:31:46,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:31:45" (2/3) ... [2025-03-17 05:31:46,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@833a7bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:31:46, skipping insertion in model container [2025-03-17 05:31:46,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:31:46" (3/3) ... [2025-03-17 05:31:46,388 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-19.i [2025-03-17 05:31:46,403 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:31:46,404 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-19.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:31:46,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:31:46,459 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;@607c3e2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:31:46,459 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:31:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:31:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:31:46,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:46,473 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:46,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:46,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash -875866232, now seen corresponding path program 1 times [2025-03-17 05:31:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:46,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856948843] [2025-03-17 05:31:46,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:46,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:46,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:46,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:46,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:46,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:46,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:31:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856948843] [2025-03-17 05:31:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856948843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826684702] [2025-03-17 05:31:46,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:46,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:31:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:31:46,743 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-17 05:31:46,745 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-17 05:31:46,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:46,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:46,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:46,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:46,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:31:46,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:46,995 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-17 05:31:46,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:31:46,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826684702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:46,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:31:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:31:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751915232] [2025-03-17 05:31:46,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:47,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:31:47,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:47,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:31:47,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:31:47,019 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:47,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:47,041 INFO L93 Difference]: Finished difference Result 189 states and 297 transitions. [2025-03-17 05:31:47,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:31:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 128 [2025-03-17 05:31:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:47,047 INFO L225 Difference]: With dead ends: 189 [2025-03-17 05:31:47,047 INFO L226 Difference]: Without dead ends: 94 [2025-03-17 05:31:47,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 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-17 05:31:47,051 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:47,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:31:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-17 05:31:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-17 05:31:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:31:47,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-17 05:31:47,088 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 128 [2025-03-17 05:31:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:47,089 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-17 05:31:47,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-17 05:31:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:31:47,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:47,093 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:47,101 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-17 05:31:47,293 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-17 05:31:47,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:47,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1198351657, now seen corresponding path program 1 times [2025-03-17 05:31:47,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:47,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-03-17 05:31:47,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:47,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:47,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:47,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:47,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:47,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:47,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748060747] [2025-03-17 05:31:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748060747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:47,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:31:47,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748979233] [2025-03-17 05:31:47,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:47,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:31:47,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:47,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:31:47,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:31:47,756 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:47,797 INFO L93 Difference]: Finished difference Result 190 states and 273 transitions. [2025-03-17 05:31:47,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:31:47,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:31:47,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:47,799 INFO L225 Difference]: With dead ends: 190 [2025-03-17 05:31:47,800 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:31:47,800 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-17 05:31:47,801 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:47,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 381 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:31:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:31:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 05:31:47,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-17 05:31:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2025-03-17 05:31:47,811 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 128 [2025-03-17 05:31:47,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:47,813 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2025-03-17 05:31:47,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2025-03-17 05:31:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:31:47,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:47,815 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:31:47,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:47,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1197428136, now seen corresponding path program 1 times [2025-03-17 05:31:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952894084] [2025-03-17 05:31:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:47,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:31:49,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:49,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952894084] [2025-03-17 05:31:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952894084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:49,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933101515] [2025-03-17 05:31:49,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:49,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:31:49,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:31:49,415 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-17 05:31:49,416 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-17 05:31:49,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:49,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:49,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:49,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:49,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:31:49,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:49,629 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-17 05:31:49,825 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-17 05:31:49,831 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 171 treesize of output 115 [2025-03-17 05:31:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-17 05:31:49,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:31:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:50,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933101515] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:31:50,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:31:50,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 8] total 20 [2025-03-17 05:31:50,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040811087] [2025-03-17 05:31:50,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:50,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:31:50,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:50,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:31:50,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:31:50,116 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:50,372 INFO L93 Difference]: Finished difference Result 243 states and 342 transitions. [2025-03-17 05:31:50,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:31:50,372 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:31:50,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:50,374 INFO L225 Difference]: With dead ends: 243 [2025-03-17 05:31:50,374 INFO L226 Difference]: Without dead ends: 148 [2025-03-17 05:31:50,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:31:50,375 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 57 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:50,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 633 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:31:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-17 05:31:50,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2025-03-17 05:31:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.3333333333333333) internal successors, (164), 124 states have internal predecessors, (164), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:31:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2025-03-17 05:31:50,389 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 128 [2025-03-17 05:31:50,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:50,390 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2025-03-17 05:31:50,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:50,390 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2025-03-17 05:31:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-17 05:31:50,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:50,391 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:50,400 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-17 05:31:50,594 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,SelfDestructingSolverStorable2 [2025-03-17 05:31:50,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:50,595 INFO L85 PathProgramCache]: Analyzing trace with hash 155881561, now seen corresponding path program 1 times [2025-03-17 05:31:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613168280] [2025-03-17 05:31:50,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:50,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 05:31:50,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 05:31:50,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:50,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613168280] [2025-03-17 05:31:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613168280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:50,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:31:50,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034920151] [2025-03-17 05:31:50,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:50,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:31:50,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:50,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:31:50,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:31:50,786 INFO L87 Difference]: Start difference. First operand 145 states and 202 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:50,845 INFO L93 Difference]: Finished difference Result 330 states and 458 transitions. [2025-03-17 05:31:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:31:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2025-03-17 05:31:50,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:50,848 INFO L225 Difference]: With dead ends: 330 [2025-03-17 05:31:50,848 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 05:31:50,849 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-17 05:31:50,852 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 46 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 633 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-17 05:31:50,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 633 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:31:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 05:31:50,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2025-03-17 05:31:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 130 states have internal predecessors, (172), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:31:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 210 transitions. [2025-03-17 05:31:50,867 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 210 transitions. Word has length 128 [2025-03-17 05:31:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:50,868 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 210 transitions. [2025-03-17 05:31:50,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 210 transitions. [2025-03-17 05:31:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:31:50,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:50,871 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:50,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:31:50,871 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:50,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash -2135302932, now seen corresponding path program 1 times [2025-03-17 05:31:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-03-17 05:31:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:50,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:31:50,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:31:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341532837] [2025-03-17 05:31:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341532837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:51,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:31:51,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044939306] [2025-03-17 05:31:51,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:51,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:31:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:51,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:31:51,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:31:51,265 INFO L87 Difference]: Start difference. First operand 151 states and 210 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:51,583 INFO L93 Difference]: Finished difference Result 392 states and 538 transitions. [2025-03-17 05:31:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:31:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 129 [2025-03-17 05:31:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:51,585 INFO L225 Difference]: With dead ends: 392 [2025-03-17 05:31:51,585 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 05:31:51,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:31:51,586 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 65 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:51,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 852 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:31:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 05:31:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 239. [2025-03-17 05:31:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 207 states have (on average 1.3091787439613527) internal successors, (271), 210 states have internal predecessors, (271), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:31:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 325 transitions. [2025-03-17 05:31:51,611 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 325 transitions. Word has length 129 [2025-03-17 05:31:51,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:51,612 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 325 transitions. [2025-03-17 05:31:51,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 325 transitions. [2025-03-17 05:31:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:31:51,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:51,614 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:31:51,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash -542085545, now seen corresponding path program 1 times [2025-03-17 05:31:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-17 05:31:51,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:51,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:31:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:31:51,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:52,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:52,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019851953] [2025-03-17 05:31:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019851953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:52,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:52,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:31:52,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315289219] [2025-03-17 05:31:52,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:31:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:52,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:31:52,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:31:52,032 INFO L87 Difference]: Start difference. First operand 239 states and 325 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:52,726 INFO L93 Difference]: Finished difference Result 683 states and 922 transitions. [2025-03-17 05:31:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:31:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:31:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:52,729 INFO L225 Difference]: With dead ends: 683 [2025-03-17 05:31:52,729 INFO L226 Difference]: Without dead ends: 441 [2025-03-17 05:31:52,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:31:52,733 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 88 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:52,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1183 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:31:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-17 05:31:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 278. [2025-03-17 05:31:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 246 states have (on average 1.329268292682927) internal successors, (327), 249 states have internal predecessors, (327), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:31:52,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 381 transitions. [2025-03-17 05:31:52,761 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 381 transitions. Word has length 130 [2025-03-17 05:31:52,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:52,762 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 381 transitions. [2025-03-17 05:31:52,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 381 transitions. [2025-03-17 05:31:52,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 05:31:52,763 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:52,764 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:52,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:31:52,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:52,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:52,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1601367130, now seen corresponding path program 1 times [2025-03-17 05:31:52,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:52,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612414600] [2025-03-17 05:31:52,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 05:31:52,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 05:31:52,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:52,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:53,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612414600] [2025-03-17 05:31:53,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612414600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:31:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431206192] [2025-03-17 05:31:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:53,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:31:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:53,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:31:53,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:31:53,890 INFO L87 Difference]: Start difference. First operand 278 states and 381 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:55,333 INFO L93 Difference]: Finished difference Result 1020 states and 1376 transitions. [2025-03-17 05:31:55,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:31:55,334 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2025-03-17 05:31:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:55,338 INFO L225 Difference]: With dead ends: 1020 [2025-03-17 05:31:55,340 INFO L226 Difference]: Without dead ends: 741 [2025-03-17 05:31:55,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:31:55,341 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 322 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:55,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1400 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:31:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-17 05:31:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 394. [2025-03-17 05:31:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 354 states have (on average 1.3418079096045197) internal successors, (475), 358 states have internal predecessors, (475), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 29 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:31:55,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 541 transitions. [2025-03-17 05:31:55,384 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 541 transitions. Word has length 130 [2025-03-17 05:31:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:55,385 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 541 transitions. [2025-03-17 05:31:55,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 541 transitions. [2025-03-17 05:31:55,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:31:55,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:55,388 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:55,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:31:55,389 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:55,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1000448205, now seen corresponding path program 1 times [2025-03-17 05:31:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51574100] [2025-03-17 05:31:55,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:55,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:31:55,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:31:55,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:55,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51574100] [2025-03-17 05:31:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51574100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:31:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567206888] [2025-03-17 05:31:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:31:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:31:55,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:31:55,625 INFO L87 Difference]: Start difference. First operand 394 states and 541 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:55,845 INFO L93 Difference]: Finished difference Result 849 states and 1162 transitions. [2025-03-17 05:31:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:31:55,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-17 05:31:55,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:55,849 INFO L225 Difference]: With dead ends: 849 [2025-03-17 05:31:55,849 INFO L226 Difference]: Without dead ends: 456 [2025-03-17 05:31:55,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:31:55,850 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 212 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:55,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 391 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:31:55,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-17 05:31:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2025-03-17 05:31:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 374 states have (on average 1.3422459893048129) internal successors, (502), 378 states have internal predecessors, (502), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 29 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:31:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 568 transitions. [2025-03-17 05:31:55,883 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 568 transitions. Word has length 131 [2025-03-17 05:31:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:55,883 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 568 transitions. [2025-03-17 05:31:55,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-17 05:31:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 568 transitions. [2025-03-17 05:31:55,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:31:55,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:55,888 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:55,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:31:55,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:55,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1293851212, now seen corresponding path program 1 times [2025-03-17 05:31:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513075775] [2025-03-17 05:31:55,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:55,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:55,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:31:55,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:31:55,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:55,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:56,780 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513075775] [2025-03-17 05:31:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513075775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:56,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:56,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:31:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645571304] [2025-03-17 05:31:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:56,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:31:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:56,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:31:56,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:31:56,782 INFO L87 Difference]: Start difference. First operand 414 states and 568 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:57,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:57,197 INFO L93 Difference]: Finished difference Result 942 states and 1282 transitions. [2025-03-17 05:31:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:31:57,201 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:31:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:57,204 INFO L225 Difference]: With dead ends: 942 [2025-03-17 05:31:57,204 INFO L226 Difference]: Without dead ends: 529 [2025-03-17 05:31:57,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:31:57,205 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 65 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:57,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1409 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:31:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-03-17 05:31:57,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 440. [2025-03-17 05:31:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 400 states have (on average 1.335) internal successors, (534), 404 states have internal predecessors, (534), 33 states have call successors, (33), 6 states have call predecessors, (33), 6 states have return successors, (33), 29 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 05:31:57,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 600 transitions. [2025-03-17 05:31:57,236 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 600 transitions. Word has length 131 [2025-03-17 05:31:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:57,236 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 600 transitions. [2025-03-17 05:31:57,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 600 transitions. [2025-03-17 05:31:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:31:57,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:57,238 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:57,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:31:57,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:57,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1544894358, now seen corresponding path program 1 times [2025-03-17 05:31:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:57,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528307371] [2025-03-17 05:31:57,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:57,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:31:57,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:31:57,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:57,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-17 05:31:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:31:57,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528307371] [2025-03-17 05:31:57,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528307371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:31:57,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:31:57,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:31:57,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865182822] [2025-03-17 05:31:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:31:57,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:31:57,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:31:57,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:31:57,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:31:57,922 INFO L87 Difference]: Start difference. First operand 440 states and 600 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:31:58,838 INFO L93 Difference]: Finished difference Result 1306 states and 1759 transitions. [2025-03-17 05:31:58,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:31:58,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-17 05:31:58,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:31:58,844 INFO L225 Difference]: With dead ends: 1306 [2025-03-17 05:31:58,844 INFO L226 Difference]: Without dead ends: 867 [2025-03-17 05:31:58,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:31:58,846 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 336 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:31:58,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1067 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:31:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-17 05:31:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 566. [2025-03-17 05:31:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 512 states have (on average 1.322265625) internal successors, (677), 518 states have internal predecessors, (677), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 38 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:31:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 765 transitions. [2025-03-17 05:31:58,888 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 765 transitions. Word has length 131 [2025-03-17 05:31:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:31:58,889 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 765 transitions. [2025-03-17 05:31:58,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-17 05:31:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 765 transitions. [2025-03-17 05:31:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:31:58,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:31:58,891 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:31:58,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:31:58,891 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:31:58,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:31:58,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1574034047, now seen corresponding path program 1 times [2025-03-17 05:31:58,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:31:58,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717391455] [2025-03-17 05:31:58,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:58,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:31:58,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:31:59,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:31:59,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:59,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:31:59,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270375680] [2025-03-17 05:31:59,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:31:59,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:31:59,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:31:59,012 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-17 05:31:59,014 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-17 05:31:59,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:31:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:31:59,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:31:59,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:31:59,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 150 conjuncts are in the unsatisfiable core [2025-03-17 05:31:59,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:31:59,546 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 7 treesize of output 3 [2025-03-17 05:32:01,231 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-17 05:32:02,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:32:03,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:03,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2025-03-17 05:32:04,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 05:32:05,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-03-17 05:32:07,188 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-17 05:32:08,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:08,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:08,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2025-03-17 05:32:08,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:08,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 05:32:08,620 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-17 05:32:08,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 65 [2025-03-17 05:32:11,893 INFO L349 Elim1Store]: treesize reduction 156, result has 63.0 percent of original size [2025-03-17 05:32:11,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 179 treesize of output 374