./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.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-56.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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:36:34,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:36:34,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:36:34,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:36:34,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:36:34,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:36:34,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:36:34,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:36:34,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:36:34,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:36:34,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:36:34,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:36:34,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:36:34,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:36:34,660 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:36:34,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:36:34,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:36:34,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:36:34,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:34,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:36:34,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:36:34,663 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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2025-03-17 05:36:34,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:36:34,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:36:34,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:36:34,911 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:36:34,911 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:36:34,912 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-56.i [2025-03-17 05:36:36,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7df49/4e16b0154c26416598369b27717cf4a1/FLAG3201a5fbb [2025-03-17 05:36:36,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:36:36,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2025-03-17 05:36:36,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7df49/4e16b0154c26416598369b27717cf4a1/FLAG3201a5fbb [2025-03-17 05:36:36,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30a7df49/4e16b0154c26416598369b27717cf4a1 [2025-03-17 05:36:36,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:36:36,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:36:36,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:36,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:36:36,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:36:36,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a36d8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36, skipping insertion in model container [2025-03-17 05:36:36,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:36:36,489 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-56.i[917,930] [2025-03-17 05:36:36,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:36,553 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:36:36,560 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-56.i[917,930] [2025-03-17 05:36:36,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:36:36,618 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:36:36,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36 WrapperNode [2025-03-17 05:36:36,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:36:36,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:36,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:36:36,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:36:36,625 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:36:36" (1/1) ... [2025-03-17 05:36:36,635 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:36:36" (1/1) ... [2025-03-17 05:36:36,667 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-03-17 05:36:36,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:36:36,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:36:36,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:36:36,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:36:36,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,683 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,708 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-03-17 05:36:36,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,726 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:36:36,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:36:36,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:36:36,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:36:36,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (1/1) ... [2025-03-17 05:36:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:36:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:36,767 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:36:36,770 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:36:36,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:36:36,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:36:36,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:36:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:36:36,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:36:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:36:36,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:36:36,915 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:36:36,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:36:37,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem90#1;havoc property_#t~bitwise91#1;havoc property_#t~ite119#1;havoc property_#t~mem107#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem120#1;havoc property_#t~ite130#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~short123#1;havoc property_#t~ite129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~short141#1;havoc property_#t~ite157#1;havoc property_#t~mem145#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~bitwise144#1;havoc property_#t~ite154#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~mem152#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~short158#1; [2025-03-17 05:36:37,447 INFO L? ?]: Removed 156 outVars from TransFormulas that were not future-live. [2025-03-17 05:36:37,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:36:37,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:36:37,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:36:37,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:37 BoogieIcfgContainer [2025-03-17 05:36:37,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:36:37,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:36:37,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:36:37,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:36:37,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:36:36" (1/3) ... [2025-03-17 05:36:37,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aec87a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:37, skipping insertion in model container [2025-03-17 05:36:37,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:36:36" (2/3) ... [2025-03-17 05:36:37,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aec87a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:36:37, skipping insertion in model container [2025-03-17 05:36:37,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:36:37" (3/3) ... [2025-03-17 05:36:37,477 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2025-03-17 05:36:37,489 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:36:37,492 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 120 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:36:37,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:36:37,555 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;@2013f4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:36:37,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:36:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:36:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:37,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:37,568 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:37,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:37,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1335494513, now seen corresponding path program 1 times [2025-03-17 05:36:37,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:37,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17398446] [2025-03-17 05:36:37,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:37,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:37,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:37,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:37,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:36:37,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:37,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17398446] [2025-03-17 05:36:37,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17398446] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:37,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799666239] [2025-03-17 05:36:37,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:37,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:37,857 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:36:37,859 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:36:37,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:38,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:38,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:36:38,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:36:38,074 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799666239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:38,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:38,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:36:38,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604990882] [2025-03-17 05:36:38,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:38,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:36:38,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:38,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:36:38,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:36:38,093 INFO L87 Difference]: Start difference. First operand has 120 states, 98 states have (on average 1.4489795918367347) internal successors, (142), 99 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:36:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:38,124 INFO L93 Difference]: Finished difference Result 237 states and 377 transitions. [2025-03-17 05:36:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:36:38,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2025-03-17 05:36:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:38,130 INFO L225 Difference]: With dead ends: 237 [2025-03-17 05:36:38,131 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 05:36:38,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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:36:38,138 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:38,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 05:36:38,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-17 05:36:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.422680412371134) internal successors, (138), 97 states have internal predecessors, (138), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:36:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2025-03-17 05:36:38,171 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 147 [2025-03-17 05:36:38,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:38,171 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2025-03-17 05:36:38,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:36:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2025-03-17 05:36:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:38,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:38,174 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:38,181 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:36:38,374 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:36:38,375 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:38,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:38,375 INFO L85 PathProgramCache]: Analyzing trace with hash -846943380, now seen corresponding path program 1 times [2025-03-17 05:36:38,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:38,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124241567] [2025-03-17 05:36:38,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:38,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:38,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:38,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124241567] [2025-03-17 05:36:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124241567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:39,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:39,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:36:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820125072] [2025-03-17 05:36:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:39,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:36:39,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:39,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:36:39,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:36:39,521 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:39,955 INFO L93 Difference]: Finished difference Result 324 states and 482 transitions. [2025-03-17 05:36:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:39,957 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:36:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:39,961 INFO L225 Difference]: With dead ends: 324 [2025-03-17 05:36:39,961 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 05:36:39,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:39,963 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 125 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:39,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1621 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:36:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 05:36:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 204. [2025-03-17 05:36:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 174 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2025-03-17 05:36:39,986 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 147 [2025-03-17 05:36:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:39,988 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 304 transitions. [2025-03-17 05:36:39,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 304 transitions. [2025-03-17 05:36:39,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 05:36:39,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:39,991 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:36:39,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:39,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1191112909, now seen corresponding path program 1 times [2025-03-17 05:36:39,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:39,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892669302] [2025-03-17 05:36:39,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:40,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 05:36:40,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 05:36:40,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892669302] [2025-03-17 05:36:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892669302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:40,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:40,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:36:40,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878624103] [2025-03-17 05:36:40,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:40,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:36:40,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:36:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:40,883 INFO L87 Difference]: Start difference. First operand 204 states and 304 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:41,347 INFO L93 Difference]: Finished difference Result 493 states and 734 transitions. [2025-03-17 05:36:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:41,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 147 [2025-03-17 05:36:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:41,350 INFO L225 Difference]: With dead ends: 493 [2025-03-17 05:36:41,350 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 05:36:41,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:41,352 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 362 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:41,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1330 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:36:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 05:36:41,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 204. [2025-03-17 05:36:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 173 states have (on average 1.4335260115606936) internal successors, (248), 174 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2025-03-17 05:36:41,373 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 147 [2025-03-17 05:36:41,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:41,374 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 304 transitions. [2025-03-17 05:36:41,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,375 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 304 transitions. [2025-03-17 05:36:41,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:36:41,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:41,377 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:36:41,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:41,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:41,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1358963719, now seen corresponding path program 1 times [2025-03-17 05:36:41,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:41,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570808903] [2025-03-17 05:36:41,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:41,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:36:41,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:36:41,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:41,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:41,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570808903] [2025-03-17 05:36:41,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570808903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:41,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:41,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:36:41,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484840284] [2025-03-17 05:36:41,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:41,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:36:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:41,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:36:41,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:41,468 INFO L87 Difference]: Start difference. First operand 204 states and 304 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:41,498 INFO L93 Difference]: Finished difference Result 408 states and 609 transitions. [2025-03-17 05:36:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:36:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:36:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:41,503 INFO L225 Difference]: With dead ends: 408 [2025-03-17 05:36:41,503 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 05:36:41,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:41,504 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:41,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 05:36:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-17 05:36:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 174 states have (on average 1.4310344827586208) internal successors, (249), 175 states have internal predecessors, (249), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 305 transitions. [2025-03-17 05:36:41,513 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 305 transitions. Word has length 148 [2025-03-17 05:36:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:41,514 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 305 transitions. [2025-03-17 05:36:41,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 305 transitions. [2025-03-17 05:36:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:36:41,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:41,515 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:36:41,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:41,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:41,516 INFO L85 PathProgramCache]: Analyzing trace with hash -781509564, now seen corresponding path program 1 times [2025-03-17 05:36:41,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:41,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361612283] [2025-03-17 05:36:41,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:41,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:36:41,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:36:41,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:41,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361612283] [2025-03-17 05:36:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361612283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:36:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167463456] [2025-03-17 05:36:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:36:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:41,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:36:41,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:41,589 INFO L87 Difference]: Start difference. First operand 205 states and 305 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:41,623 INFO L93 Difference]: Finished difference Result 411 states and 613 transitions. [2025-03-17 05:36:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:36:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 148 [2025-03-17 05:36:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:41,634 INFO L225 Difference]: With dead ends: 411 [2025-03-17 05:36:41,635 INFO L226 Difference]: Without dead ends: 207 [2025-03-17 05:36:41,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:36:41,636 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:41,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-17 05:36:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-17 05:36:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 176 states have (on average 1.4261363636363635) internal successors, (251), 177 states have internal predecessors, (251), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 307 transitions. [2025-03-17 05:36:41,647 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 307 transitions. Word has length 148 [2025-03-17 05:36:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:41,648 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 307 transitions. [2025-03-17 05:36:41,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 307 transitions. [2025-03-17 05:36:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:41,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:41,649 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:36:41,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:41,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1582521377, now seen corresponding path program 1 times [2025-03-17 05:36:41,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:41,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510537892] [2025-03-17 05:36:41,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:41,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:41,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:41,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 05:36:41,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510537892] [2025-03-17 05:36:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510537892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:36:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688693442] [2025-03-17 05:36:41,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:41,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:36:41,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:36:41,814 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:36:41,816 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:36:41,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:41,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:41,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:41,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:41,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:36:41,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:36:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:42,027 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:36:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688693442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:36:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:36:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869823102] [2025-03-17 05:36:42,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:42,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:42,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:42,029 INFO L87 Difference]: Start difference. First operand 207 states and 307 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:42,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:42,072 INFO L93 Difference]: Finished difference Result 419 states and 621 transitions. [2025-03-17 05:36:42,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:42,072 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-17 05:36:42,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:42,073 INFO L225 Difference]: With dead ends: 419 [2025-03-17 05:36:42,073 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 05:36:42,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:36:42,074 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:42,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 659 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:42,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 05:36:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-03-17 05:36:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 183 states have internal predecessors, (257), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2025-03-17 05:36:42,087 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 149 [2025-03-17 05:36:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:42,088 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2025-03-17 05:36:42,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2025-03-17 05:36:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:42,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:42,089 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:36:42,290 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,SelfDestructingSolverStorable5 [2025-03-17 05:36:42,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:42,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1462248937, now seen corresponding path program 1 times [2025-03-17 05:36:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415680785] [2025-03-17 05:36:42,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:42,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:42,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:42,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:42,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:43,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415680785] [2025-03-17 05:36:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415680785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:36:43,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148024842] [2025-03-17 05:36:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:36:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:36:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:36:43,191 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:43,761 INFO L93 Difference]: Finished difference Result 547 states and 801 transitions. [2025-03-17 05:36:43,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:43,762 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-17 05:36:43,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:43,764 INFO L225 Difference]: With dead ends: 547 [2025-03-17 05:36:43,764 INFO L226 Difference]: Without dead ends: 335 [2025-03-17 05:36:43,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:36:43,765 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 257 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:43,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 623 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-17 05:36:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2025-03-17 05:36:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 205 states have (on average 1.4341463414634146) internal successors, (294), 206 states have internal predecessors, (294), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 05:36:43,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 350 transitions. [2025-03-17 05:36:43,790 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 350 transitions. Word has length 149 [2025-03-17 05:36:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 350 transitions. [2025-03-17 05:36:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 350 transitions. [2025-03-17 05:36:43,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:43,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:43,793 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:36:43,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:43,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:43,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1325166550, now seen corresponding path program 1 times [2025-03-17 05:36:43,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:43,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422676572] [2025-03-17 05:36:43,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:43,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:43,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:43,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422676572] [2025-03-17 05:36:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422676572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:36:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548124372] [2025-03-17 05:36:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:44,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:36:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:44,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:36:44,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:44,044 INFO L87 Difference]: Start difference. First operand 236 states and 350 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:44,227 INFO L93 Difference]: Finished difference Result 605 states and 888 transitions. [2025-03-17 05:36:44,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:36:44,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-17 05:36:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:44,229 INFO L225 Difference]: With dead ends: 605 [2025-03-17 05:36:44,229 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 05:36:44,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:36:44,230 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 92 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:44,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 893 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:36:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 05:36:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2025-03-17 05:36:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 314 states have (on average 1.3980891719745223) internal successors, (439), 317 states have internal predecessors, (439), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:36:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 535 transitions. [2025-03-17 05:36:44,253 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 535 transitions. Word has length 149 [2025-03-17 05:36:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:44,255 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 535 transitions. [2025-03-17 05:36:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 535 transitions. [2025-03-17 05:36:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:44,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:44,258 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:36:44,258 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:44,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:44,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1618569557, now seen corresponding path program 1 times [2025-03-17 05:36:44,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:44,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172474545] [2025-03-17 05:36:44,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:44,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:44,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:44,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:44,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:44,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:46,030 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:46,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:46,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172474545] [2025-03-17 05:36:46,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172474545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:46,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:46,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 05:36:46,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415667129] [2025-03-17 05:36:46,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:46,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:36:46,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:46,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:36:46,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:36:46,032 INFO L87 Difference]: Start difference. First operand 367 states and 535 transitions. Second operand has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 05:36:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:47,301 INFO L93 Difference]: Finished difference Result 862 states and 1249 transitions. [2025-03-17 05:36:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:36:47,302 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 149 [2025-03-17 05:36:47,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:47,305 INFO L225 Difference]: With dead ends: 862 [2025-03-17 05:36:47,305 INFO L226 Difference]: Without dead ends: 496 [2025-03-17 05:36:47,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:36:47,306 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 427 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:47,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 970 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:36:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-17 05:36:47,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 368. [2025-03-17 05:36:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 315 states have (on average 1.3968253968253967) internal successors, (440), 318 states have internal predecessors, (440), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:36:47,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 536 transitions. [2025-03-17 05:36:47,348 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 536 transitions. Word has length 149 [2025-03-17 05:36:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:47,348 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 536 transitions. [2025-03-17 05:36:47,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.384615384615385) internal successors, (57), 15 states have internal predecessors, (57), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2025-03-17 05:36:47,348 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 536 transitions. [2025-03-17 05:36:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:47,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:47,350 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:36:47,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:47,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:47,350 INFO L85 PathProgramCache]: Analyzing trace with hash -984499101, now seen corresponding path program 1 times [2025-03-17 05:36:47,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:47,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46514335] [2025-03-17 05:36:47,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:47,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:47,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:47,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:47,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:47,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:47,472 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:47,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:47,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46514335] [2025-03-17 05:36:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46514335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:47,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:36:47,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575244535] [2025-03-17 05:36:47,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:36:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:36:47,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:36:47,475 INFO L87 Difference]: Start difference. First operand 368 states and 536 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:47,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:47,562 INFO L93 Difference]: Finished difference Result 951 states and 1388 transitions. [2025-03-17 05:36:47,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:36:47,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-17 05:36:47,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:47,565 INFO L225 Difference]: With dead ends: 951 [2025-03-17 05:36:47,565 INFO L226 Difference]: Without dead ends: 584 [2025-03-17 05:36:47,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:36:47,566 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 76 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:47,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 623 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:36:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-17 05:36:47,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 424. [2025-03-17 05:36:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 371 states have (on average 1.4285714285714286) internal successors, (530), 374 states have internal predecessors, (530), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:36:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 626 transitions. [2025-03-17 05:36:47,596 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 626 transitions. Word has length 149 [2025-03-17 05:36:47,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:47,596 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 626 transitions. [2025-03-17 05:36:47,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:36:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 626 transitions. [2025-03-17 05:36:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:47,598 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:47,598 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:47,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:36:47,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:47,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:47,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1529255690, now seen corresponding path program 1 times [2025-03-17 05:36:47,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:47,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539093384] [2025-03-17 05:36:47,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:47,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:47,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:47,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:47,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:47,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:48,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539093384] [2025-03-17 05:36:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539093384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:36:48,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344141263] [2025-03-17 05:36:48,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:48,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:36:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:48,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:36:48,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:48,854 INFO L87 Difference]: Start difference. First operand 424 states and 626 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:49,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:49,631 INFO L93 Difference]: Finished difference Result 1014 states and 1492 transitions. [2025-03-17 05:36:49,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:36:49,632 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:36:49,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:49,634 INFO L225 Difference]: With dead ends: 1014 [2025-03-17 05:36:49,634 INFO L226 Difference]: Without dead ends: 591 [2025-03-17 05:36:49,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:36:49,636 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 660 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:49,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 814 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:36:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-17 05:36:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 456. [2025-03-17 05:36:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 403 states have (on average 1.446650124069479) internal successors, (583), 406 states have internal predecessors, (583), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:36:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 679 transitions. [2025-03-17 05:36:49,676 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 679 transitions. Word has length 149 [2025-03-17 05:36:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:49,676 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 679 transitions. [2025-03-17 05:36:49,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 679 transitions. [2025-03-17 05:36:49,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:49,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:49,678 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:36:49,678 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:49,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:49,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1551562804, now seen corresponding path program 1 times [2025-03-17 05:36:49,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:49,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210882725] [2025-03-17 05:36:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:49,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:49,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:49,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:49,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:51,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:51,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210882725] [2025-03-17 05:36:51,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210882725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:51,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:51,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:36:51,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124581743] [2025-03-17 05:36:51,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:51,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:36:51,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:51,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:36:51,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:36:51,005 INFO L87 Difference]: Start difference. First operand 456 states and 679 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:52,109 INFO L93 Difference]: Finished difference Result 1489 states and 2198 transitions. [2025-03-17 05:36:52,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:36:52,109 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:36:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:52,114 INFO L225 Difference]: With dead ends: 1489 [2025-03-17 05:36:52,114 INFO L226 Difference]: Without dead ends: 1034 [2025-03-17 05:36:52,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:36:52,116 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1268 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:52,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 1123 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:36:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-17 05:36:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 535. [2025-03-17 05:36:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 460 states have (on average 1.4260869565217391) internal successors, (656), 463 states have internal predecessors, (656), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:36:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 790 transitions. [2025-03-17 05:36:52,168 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 790 transitions. Word has length 149 [2025-03-17 05:36:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:52,168 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 790 transitions. [2025-03-17 05:36:52,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 16 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 790 transitions. [2025-03-17 05:36:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:52,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:52,170 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:52,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:36:52,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:52,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -549840305, now seen corresponding path program 1 times [2025-03-17 05:36:52,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:52,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405812163] [2025-03-17 05:36:52,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:52,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:52,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:52,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:52,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:52,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405812163] [2025-03-17 05:36:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405812163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:36:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884396949] [2025-03-17 05:36:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:53,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:36:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:53,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:36:53,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:53,130 INFO L87 Difference]: Start difference. First operand 535 states and 790 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:54,231 INFO L93 Difference]: Finished difference Result 1164 states and 1721 transitions. [2025-03-17 05:36:54,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:36:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:36:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:54,238 INFO L225 Difference]: With dead ends: 1164 [2025-03-17 05:36:54,238 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:36:54,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:36:54,240 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 519 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:54,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1334 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:36:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:36:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 579. [2025-03-17 05:36:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4404761904761905) internal successors, (726), 507 states have internal predecessors, (726), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:36:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 860 transitions. [2025-03-17 05:36:54,282 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 860 transitions. Word has length 149 [2025-03-17 05:36:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:54,282 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 860 transitions. [2025-03-17 05:36:54,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:36:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 860 transitions. [2025-03-17 05:36:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:54,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:54,284 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:54,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:36:54,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:54,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:54,285 INFO L85 PathProgramCache]: Analyzing trace with hash -843243312, now seen corresponding path program 1 times [2025-03-17 05:36:54,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:54,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279908773] [2025-03-17 05:36:54,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:54,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:54,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:54,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:54,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:54,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:55,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:55,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279908773] [2025-03-17 05:36:55,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279908773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:55,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:36:55,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791155338] [2025-03-17 05:36:55,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:55,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:36:55,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:55,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:36:55,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:55,246 INFO L87 Difference]: Start difference. First operand 579 states and 860 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:36:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:56,233 INFO L93 Difference]: Finished difference Result 1208 states and 1790 transitions. [2025-03-17 05:36:56,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:36:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-17 05:36:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:56,237 INFO L225 Difference]: With dead ends: 1208 [2025-03-17 05:36:56,237 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:36:56,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:36:56,238 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 361 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:56,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1400 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:36:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:36:56,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 579. [2025-03-17 05:36:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4384920634920635) internal successors, (725), 507 states have internal predecessors, (725), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:36:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 859 transitions. [2025-03-17 05:36:56,282 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 859 transitions. Word has length 149 [2025-03-17 05:36:56,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:56,282 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 859 transitions. [2025-03-17 05:36:56,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:36:56,282 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 859 transitions. [2025-03-17 05:36:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:56,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:56,284 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:56,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:36:56,284 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:56,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:56,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1488215984, now seen corresponding path program 1 times [2025-03-17 05:36:56,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:56,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089865167] [2025-03-17 05:36:56,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:56,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:56,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:56,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:56,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:56,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:56,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:56,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089865167] [2025-03-17 05:36:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089865167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:56,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:36:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160483575] [2025-03-17 05:36:56,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:56,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:36:56,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:56,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:36:56,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:36:56,993 INFO L87 Difference]: Start difference. First operand 579 states and 859 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:36:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:36:57,698 INFO L93 Difference]: Finished difference Result 1368 states and 2024 transitions. [2025-03-17 05:36:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:36:57,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-03-17 05:36:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:36:57,702 INFO L225 Difference]: With dead ends: 1368 [2025-03-17 05:36:57,702 INFO L226 Difference]: Without dead ends: 869 [2025-03-17 05:36:57,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:36:57,705 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 274 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:36:57,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 1070 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:36:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-17 05:36:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 612. [2025-03-17 05:36:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 537 states have (on average 1.452513966480447) internal successors, (780), 540 states have internal predecessors, (780), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:36:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 914 transitions. [2025-03-17 05:36:57,754 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 914 transitions. Word has length 149 [2025-03-17 05:36:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:36:57,755 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 914 transitions. [2025-03-17 05:36:57,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:36:57,755 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 914 transitions. [2025-03-17 05:36:57,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:36:57,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:36:57,756 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:36:57,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:36:57,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:36:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1194812977, now seen corresponding path program 1 times [2025-03-17 05:36:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:36:57,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071382950] [2025-03-17 05:36:57,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:36:57,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:36:57,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:36:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:36:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:36:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:36:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:36:59,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:36:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071382950] [2025-03-17 05:36:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071382950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:36:59,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:36:59,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:36:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691581576] [2025-03-17 05:36:59,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:36:59,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:36:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:36:59,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:36:59,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:36:59,148 INFO L87 Difference]: Start difference. First operand 612 states and 914 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:00,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:00,202 INFO L93 Difference]: Finished difference Result 1274 states and 1898 transitions. [2025-03-17 05:37:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:00,203 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:00,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:00,205 INFO L225 Difference]: With dead ends: 1274 [2025-03-17 05:37:00,205 INFO L226 Difference]: Without dead ends: 742 [2025-03-17 05:37:00,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:00,206 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 474 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:00,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 1328 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:37:00,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2025-03-17 05:37:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 579. [2025-03-17 05:37:00,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4384920634920635) internal successors, (725), 507 states have internal predecessors, (725), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 859 transitions. [2025-03-17 05:37:00,265 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 859 transitions. Word has length 149 [2025-03-17 05:37:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:00,266 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 859 transitions. [2025-03-17 05:37:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 859 transitions. [2025-03-17 05:37:00,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:00,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:00,267 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:00,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:37:00,267 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:00,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:00,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1207512392, now seen corresponding path program 1 times [2025-03-17 05:37:00,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:00,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601237565] [2025-03-17 05:37:00,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:00,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:00,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:00,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:00,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:00,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:01,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:01,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601237565] [2025-03-17 05:37:01,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601237565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:01,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:01,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:37:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303734203] [2025-03-17 05:37:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:01,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:37:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:01,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:37:01,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:01,193 INFO L87 Difference]: Start difference. First operand 579 states and 859 transitions. Second operand has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:01,989 INFO L93 Difference]: Finished difference Result 1262 states and 1873 transitions. [2025-03-17 05:37:01,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:37:01,990 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:01,993 INFO L225 Difference]: With dead ends: 1262 [2025-03-17 05:37:01,993 INFO L226 Difference]: Without dead ends: 763 [2025-03-17 05:37:01,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:37:01,995 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 435 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:01,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 806 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:01,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-17 05:37:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 579. [2025-03-17 05:37:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4384920634920635) internal successors, (725), 507 states have internal predecessors, (725), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:02,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 859 transitions. [2025-03-17 05:37:02,068 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 859 transitions. Word has length 149 [2025-03-17 05:37:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:02,069 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 859 transitions. [2025-03-17 05:37:02,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.384615384615385) internal successors, (57), 14 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 859 transitions. [2025-03-17 05:37:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:02,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:02,072 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:02,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:37:02,072 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:02,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:02,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1873306102, now seen corresponding path program 1 times [2025-03-17 05:37:02,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:02,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621952469] [2025-03-17 05:37:02,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:02,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:02,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:02,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:02,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:02,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:02,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:02,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621952469] [2025-03-17 05:37:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621952469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:02,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:37:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959422610] [2025-03-17 05:37:02,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:02,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:37:02,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:37:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:02,799 INFO L87 Difference]: Start difference. First operand 579 states and 859 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:03,440 INFO L93 Difference]: Finished difference Result 1240 states and 1840 transitions. [2025-03-17 05:37:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:37:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-17 05:37:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:03,443 INFO L225 Difference]: With dead ends: 1240 [2025-03-17 05:37:03,443 INFO L226 Difference]: Without dead ends: 741 [2025-03-17 05:37:03,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:37:03,444 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 343 mSDsluCounter, 905 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:03,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1101 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:37:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-17 05:37:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 579. [2025-03-17 05:37:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 504 states have (on average 1.4384920634920635) internal successors, (725), 507 states have internal predecessors, (725), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 859 transitions. [2025-03-17 05:37:03,495 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 859 transitions. Word has length 149 [2025-03-17 05:37:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 859 transitions. [2025-03-17 05:37:03,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 859 transitions. [2025-03-17 05:37:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:03,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:03,496 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:37:03,497 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1274519145, now seen corresponding path program 1 times [2025-03-17 05:37:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61651545] [2025-03-17 05:37:03,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:03,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:03,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:03,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:03,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:04,245 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:04,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:04,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61651545] [2025-03-17 05:37:04,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61651545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:04,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:04,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:37:04,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460121469] [2025-03-17 05:37:04,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:04,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:37:04,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:04,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:37:04,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:04,248 INFO L87 Difference]: Start difference. First operand 579 states and 859 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:37:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:04,730 INFO L93 Difference]: Finished difference Result 1205 states and 1784 transitions. [2025-03-17 05:37:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-03-17 05:37:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:04,736 INFO L225 Difference]: With dead ends: 1205 [2025-03-17 05:37:04,736 INFO L226 Difference]: Without dead ends: 706 [2025-03-17 05:37:04,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:04,738 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 436 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:04,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 577 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-17 05:37:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 540. [2025-03-17 05:37:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 465 states have (on average 1.4236559139784946) internal successors, (662), 468 states have internal predecessors, (662), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 796 transitions. [2025-03-17 05:37:04,792 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 796 transitions. Word has length 149 [2025-03-17 05:37:04,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:04,792 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 796 transitions. [2025-03-17 05:37:04,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:37:04,792 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 796 transitions. [2025-03-17 05:37:04,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:04,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:04,793 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:04,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:37:04,793 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:04,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1806299349, now seen corresponding path program 1 times [2025-03-17 05:37:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:04,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834615393] [2025-03-17 05:37:04,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:04,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:04,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:04,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:04,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:06,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834615393] [2025-03-17 05:37:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834615393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:37:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864085336] [2025-03-17 05:37:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:06,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:37:06,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:06,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:37:06,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:37:06,001 INFO L87 Difference]: Start difference. First operand 540 states and 796 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:06,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:06,955 INFO L93 Difference]: Finished difference Result 1122 states and 1652 transitions. [2025-03-17 05:37:06,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:06,956 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:06,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:06,958 INFO L225 Difference]: With dead ends: 1122 [2025-03-17 05:37:06,958 INFO L226 Difference]: Without dead ends: 662 [2025-03-17 05:37:06,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:37:06,959 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 666 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:06,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 942 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:37:06,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-17 05:37:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 507. [2025-03-17 05:37:07,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 432 states have (on average 1.4050925925925926) internal successors, (607), 435 states have internal predecessors, (607), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:07,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 741 transitions. [2025-03-17 05:37:07,042 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 741 transitions. Word has length 149 [2025-03-17 05:37:07,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:07,042 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 741 transitions. [2025-03-17 05:37:07,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:07,042 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 741 transitions. [2025-03-17 05:37:07,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:07,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:07,044 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:07,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:37:07,044 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash -804576850, now seen corresponding path program 1 times [2025-03-17 05:37:07,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023175489] [2025-03-17 05:37:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:07,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:07,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:07,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:07,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:07,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:07,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023175489] [2025-03-17 05:37:07,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023175489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:07,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:37:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359647930] [2025-03-17 05:37:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:07,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:07,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:07,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:07,433 INFO L87 Difference]: Start difference. First operand 507 states and 741 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:07,702 INFO L93 Difference]: Finished difference Result 936 states and 1372 transitions. [2025-03-17 05:37:07,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:07,703 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-17 05:37:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:07,705 INFO L225 Difference]: With dead ends: 936 [2025-03-17 05:37:07,705 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 05:37:07,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:07,706 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 141 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:07,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 558 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:07,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 05:37:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2025-03-17 05:37:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 432 states have (on average 1.400462962962963) internal successors, (605), 435 states have internal predecessors, (605), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 739 transitions. [2025-03-17 05:37:07,758 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 739 transitions. Word has length 149 [2025-03-17 05:37:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:07,758 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 739 transitions. [2025-03-17 05:37:07,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 739 transitions. [2025-03-17 05:37:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:07,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:07,759 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:37:07,760 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash -773557043, now seen corresponding path program 1 times [2025-03-17 05:37:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50190820] [2025-03-17 05:37:07,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:07,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:07,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:07,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:07,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:08,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:08,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50190820] [2025-03-17 05:37:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50190820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:08,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:37:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545978295] [2025-03-17 05:37:08,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:08,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:37:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:08,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:37:08,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:37:08,637 INFO L87 Difference]: Start difference. First operand 507 states and 739 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:09,310 INFO L93 Difference]: Finished difference Result 1100 states and 1608 transitions. [2025-03-17 05:37:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:37:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:09,316 INFO L225 Difference]: With dead ends: 1100 [2025-03-17 05:37:09,316 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 05:37:09,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:09,318 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 367 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:09,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1235 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:09,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 05:37:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 542. [2025-03-17 05:37:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 467 states have (on average 1.4197002141327624) internal successors, (663), 470 states have internal predecessors, (663), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:09,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 797 transitions. [2025-03-17 05:37:09,371 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 797 transitions. Word has length 149 [2025-03-17 05:37:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:09,372 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 797 transitions. [2025-03-17 05:37:09,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:09,373 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 797 transitions. [2025-03-17 05:37:09,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:09,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:09,374 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:09,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 05:37:09,374 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:09,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:09,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1066960050, now seen corresponding path program 1 times [2025-03-17 05:37:09,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:09,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027638681] [2025-03-17 05:37:09,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:09,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:09,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:09,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:09,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:09,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027638681] [2025-03-17 05:37:10,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027638681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:10,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:10,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:37:10,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044714254] [2025-03-17 05:37:10,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:10,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:37:10,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:10,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:37:10,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:37:10,129 INFO L87 Difference]: Start difference. First operand 542 states and 797 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:10,973 INFO L93 Difference]: Finished difference Result 1135 states and 1665 transitions. [2025-03-17 05:37:10,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:37:10,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:10,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:10,976 INFO L225 Difference]: With dead ends: 1135 [2025-03-17 05:37:10,976 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 05:37:10,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:10,977 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 471 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:10,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1430 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:37:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 05:37:11,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 509. [2025-03-17 05:37:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 434 states have (on average 1.400921658986175) internal successors, (608), 437 states have internal predecessors, (608), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 742 transitions. [2025-03-17 05:37:11,030 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 742 transitions. Word has length 149 [2025-03-17 05:37:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:11,030 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 742 transitions. [2025-03-17 05:37:11,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:11,031 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 742 transitions. [2025-03-17 05:37:11,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:11,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:11,031 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 05:37:11,032 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:11,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:11,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1264499246, now seen corresponding path program 1 times [2025-03-17 05:37:11,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:11,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313413544] [2025-03-17 05:37:11,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:11,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:11,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:11,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:11,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:11,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313413544] [2025-03-17 05:37:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313413544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:12,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:37:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185833754] [2025-03-17 05:37:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:12,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:37:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:12,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:37:12,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:37:12,045 INFO L87 Difference]: Start difference. First operand 509 states and 742 transitions. Second operand has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:12,800 INFO L93 Difference]: Finished difference Result 1248 states and 1822 transitions. [2025-03-17 05:37:12,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:37:12,800 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 149 [2025-03-17 05:37:12,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:12,803 INFO L225 Difference]: With dead ends: 1248 [2025-03-17 05:37:12,803 INFO L226 Difference]: Without dead ends: 819 [2025-03-17 05:37:12,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:12,804 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 268 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:12,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1250 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:12,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-03-17 05:37:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 528. [2025-03-17 05:37:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 453 states have (on average 1.4128035320088301) internal successors, (640), 456 states have internal predecessors, (640), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 774 transitions. [2025-03-17 05:37:12,858 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 774 transitions. Word has length 149 [2025-03-17 05:37:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 774 transitions. [2025-03-17 05:37:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.75) internal successors, (57), 13 states have internal predecessors, (57), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 774 transitions. [2025-03-17 05:37:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:12,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:12,859 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:12,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 05:37:12,859 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:12,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:12,860 INFO L85 PathProgramCache]: Analyzing trace with hash 971096239, now seen corresponding path program 1 times [2025-03-17 05:37:12,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:12,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029550081] [2025-03-17 05:37:12,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:12,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:12,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:13,643 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:13,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:13,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029550081] [2025-03-17 05:37:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029550081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:37:13,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104286007] [2025-03-17 05:37:13,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:13,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:37:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:13,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:37:13,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:13,645 INFO L87 Difference]: Start difference. First operand 528 states and 774 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:14,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:14,352 INFO L93 Difference]: Finished difference Result 1140 states and 1673 transitions. [2025-03-17 05:37:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:14,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 149 [2025-03-17 05:37:14,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:14,355 INFO L225 Difference]: With dead ends: 1140 [2025-03-17 05:37:14,355 INFO L226 Difference]: Without dead ends: 692 [2025-03-17 05:37:14,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:14,356 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 457 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:14,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 1270 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-17 05:37:14,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 487. [2025-03-17 05:37:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 412 states have (on average 1.395631067961165) internal successors, (575), 415 states have internal predecessors, (575), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:14,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 709 transitions. [2025-03-17 05:37:14,411 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 709 transitions. Word has length 149 [2025-03-17 05:37:14,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:14,411 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 709 transitions. [2025-03-17 05:37:14,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:14,412 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 709 transitions. [2025-03-17 05:37:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 05:37:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:14,412 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 05:37:14,413 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1686941221, now seen corresponding path program 1 times [2025-03-17 05:37:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897774322] [2025-03-17 05:37:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:14,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 05:37:14,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 05:37:14,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:14,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:14,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:14,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897774322] [2025-03-17 05:37:14,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897774322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:14,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:14,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:37:14,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143829627] [2025-03-17 05:37:14,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:14,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:14,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:14,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:14,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:37:14,505 INFO L87 Difference]: Start difference. First operand 487 states and 709 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:14,660 INFO L93 Difference]: Finished difference Result 977 states and 1419 transitions. [2025-03-17 05:37:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:14,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-03-17 05:37:14,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:14,664 INFO L225 Difference]: With dead ends: 977 [2025-03-17 05:37:14,664 INFO L226 Difference]: Without dead ends: 570 [2025-03-17 05:37:14,664 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:37:14,665 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 90 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:14,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 780 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:37:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-17 05:37:14,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 486. [2025-03-17 05:37:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 411 states have (on average 1.389294403892944) internal successors, (571), 414 states have internal predecessors, (571), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-17 05:37:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 705 transitions. [2025-03-17 05:37:14,722 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 705 transitions. Word has length 149 [2025-03-17 05:37:14,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:14,722 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 705 transitions. [2025-03-17 05:37:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:14,723 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 705 transitions. [2025-03-17 05:37:14,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:37:14,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:14,725 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 05:37:14,725 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:14,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:14,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1136500780, now seen corresponding path program 1 times [2025-03-17 05:37:14,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:14,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935795704] [2025-03-17 05:37:14,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:14,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:14,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:37:14,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:37:14,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:14,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:14,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:14,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935795704] [2025-03-17 05:37:14,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935795704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:14,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:37:14,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624802929] [2025-03-17 05:37:14,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:14,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:37:14,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:14,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:37:14,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:37:14,766 INFO L87 Difference]: Start difference. First operand 486 states and 705 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:14,829 INFO L93 Difference]: Finished difference Result 829 states and 1205 transitions. [2025-03-17 05:37:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:37:14,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-17 05:37:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:14,831 INFO L225 Difference]: With dead ends: 829 [2025-03-17 05:37:14,831 INFO L226 Difference]: Without dead ends: 423 [2025-03-17 05:37:14,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:37:14,831 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:14,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 330 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-17 05:37:14,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 404. [2025-03-17 05:37:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 338 states have (on average 1.3727810650887573) internal successors, (464), 340 states have internal predecessors, (464), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 580 transitions. [2025-03-17 05:37:14,882 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 580 transitions. Word has length 150 [2025-03-17 05:37:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 580 transitions. [2025-03-17 05:37:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 580 transitions. [2025-03-17 05:37:14,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:37:14,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:14,883 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:14,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 05:37:14,884 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:14,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:14,884 INFO L85 PathProgramCache]: Analyzing trace with hash 592868869, now seen corresponding path program 1 times [2025-03-17 05:37:14,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956731010] [2025-03-17 05:37:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:14,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:37:14,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:37:14,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:14,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:14,937 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956731010] [2025-03-17 05:37:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956731010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:37:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890828538] [2025-03-17 05:37:14,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:14,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:37:14,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:14,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:37:14,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:37:14,938 INFO L87 Difference]: Start difference. First operand 404 states and 580 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:14,997 INFO L93 Difference]: Finished difference Result 699 states and 1003 transitions. [2025-03-17 05:37:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:37:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-03-17 05:37:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:14,999 INFO L225 Difference]: With dead ends: 699 [2025-03-17 05:37:14,999 INFO L226 Difference]: Without dead ends: 375 [2025-03-17 05:37:14,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:37:15,000 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:15,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 331 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:15,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-17 05:37:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-17 05:37:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 309 states have (on average 1.3527508090614886) internal successors, (418), 311 states have internal predecessors, (418), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 534 transitions. [2025-03-17 05:37:15,049 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 534 transitions. Word has length 150 [2025-03-17 05:37:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:15,049 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 534 transitions. [2025-03-17 05:37:15,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:15,049 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 534 transitions. [2025-03-17 05:37:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:15,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:15,050 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:15,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 05:37:15,051 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:15,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:15,051 INFO L85 PathProgramCache]: Analyzing trace with hash -603284353, now seen corresponding path program 1 times [2025-03-17 05:37:15,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:15,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270457072] [2025-03-17 05:37:15,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:15,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:15,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:15,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:15,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:15,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:15,884 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:15,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:15,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270457072] [2025-03-17 05:37:15,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270457072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:15,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:15,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 05:37:15,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113818586] [2025-03-17 05:37:15,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:15,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:37:15,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:15,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:37:15,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:37:15,886 INFO L87 Difference]: Start difference. First operand 375 states and 534 transitions. Second operand has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:16,924 INFO L93 Difference]: Finished difference Result 943 states and 1341 transitions. [2025-03-17 05:37:16,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:37:16,925 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2025-03-17 05:37:16,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:16,927 INFO L225 Difference]: With dead ends: 943 [2025-03-17 05:37:16,927 INFO L226 Difference]: Without dead ends: 648 [2025-03-17 05:37:16,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:37:16,928 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 1228 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:16,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1404 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:37:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-03-17 05:37:17,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 408. [2025-03-17 05:37:17,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 342 states have (on average 1.3596491228070176) internal successors, (465), 344 states have internal predecessors, (465), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:17,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 581 transitions. [2025-03-17 05:37:17,026 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 581 transitions. Word has length 151 [2025-03-17 05:37:17,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:17,027 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 581 transitions. [2025-03-17 05:37:17,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 18 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 581 transitions. [2025-03-17 05:37:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:17,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:17,028 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 05:37:17,028 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:17,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:17,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1139525982, now seen corresponding path program 1 times [2025-03-17 05:37:17,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422398643] [2025-03-17 05:37:17,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:17,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:17,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:17,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:17,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:17,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:17,128 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-03-17 05:37:17,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422398643] [2025-03-17 05:37:17,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422398643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:37:17,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132763000] [2025-03-17 05:37:17,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:37:17,131 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:37:17,133 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:37:17,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:17,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:17,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:17,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:17,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:37:17,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:37:17,347 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:17,347 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:37:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132763000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:17,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:37:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:37:17,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854117263] [2025-03-17 05:37:17,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:17,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:37:17,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:17,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:37:17,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:17,349 INFO L87 Difference]: Start difference. First operand 408 states and 581 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:17,416 INFO L93 Difference]: Finished difference Result 712 states and 1015 transitions. [2025-03-17 05:37:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:37:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:37:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:17,418 INFO L225 Difference]: With dead ends: 712 [2025-03-17 05:37:17,418 INFO L226 Difference]: Without dead ends: 417 [2025-03-17 05:37:17,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:17,420 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:17,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 660 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:37:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-17 05:37:17,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-03-17 05:37:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 351 states have (on average 1.3504273504273505) internal successors, (474), 353 states have internal predecessors, (474), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 590 transitions. [2025-03-17 05:37:17,476 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 590 transitions. Word has length 151 [2025-03-17 05:37:17,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:17,476 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 590 transitions. [2025-03-17 05:37:17,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 590 transitions. [2025-03-17 05:37:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:17,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:17,477 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:17,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:37:17,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:37:17,678 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:17,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:17,678 INFO L85 PathProgramCache]: Analyzing trace with hash -634304160, now seen corresponding path program 1 times [2025-03-17 05:37:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219431942] [2025-03-17 05:37:17,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:17,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:17,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:17,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:17,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:17,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:18,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:18,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219431942] [2025-03-17 05:37:18,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219431942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 05:37:18,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821061648] [2025-03-17 05:37:18,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:18,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:37:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:18,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:37:18,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:37:18,694 INFO L87 Difference]: Start difference. First operand 417 states and 590 transitions. Second operand has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:20,142 INFO L93 Difference]: Finished difference Result 1013 states and 1423 transitions. [2025-03-17 05:37:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 05:37:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2025-03-17 05:37:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:20,144 INFO L225 Difference]: With dead ends: 1013 [2025-03-17 05:37:20,145 INFO L226 Difference]: Without dead ends: 709 [2025-03-17 05:37:20,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 05:37:20,146 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 766 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 2662 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:20,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 2662 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:37:20,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-17 05:37:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 434. [2025-03-17 05:37:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 368 states have (on average 1.3505434782608696) internal successors, (497), 370 states have internal predecessors, (497), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:20,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 613 transitions. [2025-03-17 05:37:20,202 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 613 transitions. Word has length 151 [2025-03-17 05:37:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:20,202 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 613 transitions. [2025-03-17 05:37:20,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 19 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:20,202 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 613 transitions. [2025-03-17 05:37:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:20,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:20,203 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:20,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 05:37:20,203 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:20,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -784504820, now seen corresponding path program 1 times [2025-03-17 05:37:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:20,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247167859] [2025-03-17 05:37:20,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:20,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:20,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:20,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247167859] [2025-03-17 05:37:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247167859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:20,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:20,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 05:37:20,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232641858] [2025-03-17 05:37:20,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:20,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:37:20,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:20,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:37:20,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:20,856 INFO L87 Difference]: Start difference. First operand 434 states and 613 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:21,610 INFO L93 Difference]: Finished difference Result 911 states and 1281 transitions. [2025-03-17 05:37:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:37:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:37:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:21,613 INFO L225 Difference]: With dead ends: 911 [2025-03-17 05:37:21,613 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 05:37:21,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:37:21,614 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 238 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:21,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 2156 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 05:37:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 457. [2025-03-17 05:37:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 391 states have (on average 1.360613810741688) internal successors, (532), 393 states have internal predecessors, (532), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:37:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 648 transitions. [2025-03-17 05:37:21,674 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 648 transitions. Word has length 151 [2025-03-17 05:37:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:21,674 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 648 transitions. [2025-03-17 05:37:21,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 648 transitions. [2025-03-17 05:37:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:21,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:21,676 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 05:37:21,676 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:21,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1077907827, now seen corresponding path program 1 times [2025-03-17 05:37:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968476262] [2025-03-17 05:37:21,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:21,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:21,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:21,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:21,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:21,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:21,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968476262] [2025-03-17 05:37:21,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968476262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:37:21,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107152170] [2025-03-17 05:37:21,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:21,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:37:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:21,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:37:21,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:37:21,969 INFO L87 Difference]: Start difference. First operand 457 states and 648 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:22,278 INFO L93 Difference]: Finished difference Result 865 states and 1220 transitions. [2025-03-17 05:37:22,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:22,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:37:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:22,280 INFO L225 Difference]: With dead ends: 865 [2025-03-17 05:37:22,280 INFO L226 Difference]: Without dead ends: 538 [2025-03-17 05:37:22,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:37:22,281 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 243 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:22,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 684 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-03-17 05:37:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 390. [2025-03-17 05:37:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 334 states have (on average 1.3652694610778444) internal successors, (456), 335 states have internal predecessors, (456), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 554 transitions. [2025-03-17 05:37:22,332 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 554 transitions. Word has length 151 [2025-03-17 05:37:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:22,332 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 554 transitions. [2025-03-17 05:37:22,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 554 transitions. [2025-03-17 05:37:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:22,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:22,333 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:22,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 05:37:22,333 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 429643982, now seen corresponding path program 1 times [2025-03-17 05:37:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:22,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240724742] [2025-03-17 05:37:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:22,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:22,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:22,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:22,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:22,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:22,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240724742] [2025-03-17 05:37:22,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240724742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:22,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:22,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:37:22,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917291476] [2025-03-17 05:37:22,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:22,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:37:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:37:22,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:22,883 INFO L87 Difference]: Start difference. First operand 390 states and 554 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:23,352 INFO L93 Difference]: Finished difference Result 771 states and 1094 transitions. [2025-03-17 05:37:23,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:37:23,352 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2025-03-17 05:37:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:23,354 INFO L225 Difference]: With dead ends: 771 [2025-03-17 05:37:23,354 INFO L226 Difference]: Without dead ends: 509 [2025-03-17 05:37:23,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:37:23,355 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 592 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:23,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 736 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:23,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-17 05:37:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 410. [2025-03-17 05:37:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 354 states have (on average 1.3700564971751412) internal successors, (485), 355 states have internal predecessors, (485), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 583 transitions. [2025-03-17 05:37:23,402 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 583 transitions. Word has length 151 [2025-03-17 05:37:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:23,402 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 583 transitions. [2025-03-17 05:37:23,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:23,402 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 583 transitions. [2025-03-17 05:37:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:23,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:23,403 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:23,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 05:37:23,403 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash -717498067, now seen corresponding path program 1 times [2025-03-17 05:37:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670894049] [2025-03-17 05:37:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:23,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:23,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:23,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:23,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:24,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670894049] [2025-03-17 05:37:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670894049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 05:37:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555963245] [2025-03-17 05:37:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:24,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:37:24,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:24,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:37:24,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:37:24,839 INFO L87 Difference]: Start difference. First operand 410 states and 583 transitions. Second operand has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:37:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:26,303 INFO L93 Difference]: Finished difference Result 953 states and 1355 transitions. [2025-03-17 05:37:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 05:37:26,303 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-03-17 05:37:26,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:26,305 INFO L225 Difference]: With dead ends: 953 [2025-03-17 05:37:26,305 INFO L226 Difference]: Without dead ends: 673 [2025-03-17 05:37:26,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=1404, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 05:37:26,306 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 533 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:26,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2428 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:37:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-17 05:37:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 431. [2025-03-17 05:37:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 375 states have (on average 1.3813333333333333) internal successors, (518), 376 states have internal predecessors, (518), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 616 transitions. [2025-03-17 05:37:26,352 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 616 transitions. Word has length 151 [2025-03-17 05:37:26,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:26,352 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 616 transitions. [2025-03-17 05:37:26,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 23 states have internal predecessors, (59), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:37:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 616 transitions. [2025-03-17 05:37:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:26,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:26,353 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:26,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 05:37:26,353 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:26,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash 496650735, now seen corresponding path program 1 times [2025-03-17 05:37:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:26,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000843092] [2025-03-17 05:37:26,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:26,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:26,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:26,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:26,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:27,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000843092] [2025-03-17 05:37:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000843092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:37:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654774089] [2025-03-17 05:37:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:37:27,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:27,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:37:27,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:27,048 INFO L87 Difference]: Start difference. First operand 431 states and 616 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:27,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:27,501 INFO L93 Difference]: Finished difference Result 826 states and 1178 transitions. [2025-03-17 05:37:27,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:27,502 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2025-03-17 05:37:27,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:27,504 INFO L225 Difference]: With dead ends: 826 [2025-03-17 05:37:27,504 INFO L226 Difference]: Without dead ends: 546 [2025-03-17 05:37:27,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:37:27,505 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 325 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:27,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 697 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2025-03-17 05:37:27,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 434. [2025-03-17 05:37:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 378 states have (on average 1.3783068783068784) internal successors, (521), 379 states have internal predecessors, (521), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 619 transitions. [2025-03-17 05:37:27,551 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 619 transitions. Word has length 151 [2025-03-17 05:37:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:27,551 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 619 transitions. [2025-03-17 05:37:27,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 619 transitions. [2025-03-17 05:37:27,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:27,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:27,552 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:27,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 05:37:27,552 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:27,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:27,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1039241365, now seen corresponding path program 1 times [2025-03-17 05:37:27,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:27,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471036095] [2025-03-17 05:37:27,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:27,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:27,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:27,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:27,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:27,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471036095] [2025-03-17 05:37:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471036095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:37:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833063230] [2025-03-17 05:37:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:37:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:27,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:37:27,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:37:27,857 INFO L87 Difference]: Start difference. First operand 434 states and 619 transitions. Second operand has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:28,125 INFO L93 Difference]: Finished difference Result 729 states and 1044 transitions. [2025-03-17 05:37:28,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:37:28,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 151 [2025-03-17 05:37:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:28,127 INFO L225 Difference]: With dead ends: 729 [2025-03-17 05:37:28,128 INFO L226 Difference]: Without dead ends: 430 [2025-03-17 05:37:28,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:37:28,128 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 175 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:28,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 548 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:28,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-17 05:37:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-03-17 05:37:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 374 states have (on average 1.374331550802139) internal successors, (514), 375 states have internal predecessors, (514), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:28,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 612 transitions. [2025-03-17 05:37:28,174 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 612 transitions. Word has length 151 [2025-03-17 05:37:28,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:28,174 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 612 transitions. [2025-03-17 05:37:28,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.833333333333334) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:37:28,174 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 612 transitions. [2025-03-17 05:37:28,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:28,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:28,175 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:28,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 05:37:28,175 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:28,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:28,176 INFO L85 PathProgramCache]: Analyzing trace with hash -591968226, now seen corresponding path program 1 times [2025-03-17 05:37:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:28,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746577511] [2025-03-17 05:37:28,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:28,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:28,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:28,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:28,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:28,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:28,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746577511] [2025-03-17 05:37:28,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746577511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:28,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:28,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 05:37:28,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152459046] [2025-03-17 05:37:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:28,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:37:28,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:28,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:37:28,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:37:28,871 INFO L87 Difference]: Start difference. First operand 430 states and 612 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:29,680 INFO L93 Difference]: Finished difference Result 986 states and 1403 transitions. [2025-03-17 05:37:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:37:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2025-03-17 05:37:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:29,683 INFO L225 Difference]: With dead ends: 986 [2025-03-17 05:37:29,683 INFO L226 Difference]: Without dead ends: 691 [2025-03-17 05:37:29,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-03-17 05:37:29,684 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 698 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1758 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:29,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1758 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:37:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-17 05:37:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 450. [2025-03-17 05:37:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 394 states have (on average 1.385786802030457) internal successors, (546), 395 states have internal predecessors, (546), 49 states have call successors, (49), 6 states have call predecessors, (49), 6 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 05:37:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 644 transitions. [2025-03-17 05:37:29,733 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 644 transitions. Word has length 151 [2025-03-17 05:37:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:29,733 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 644 transitions. [2025-03-17 05:37:29,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:29,733 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 644 transitions. [2025-03-17 05:37:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:29,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:29,734 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:29,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 05:37:29,734 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -622988033, now seen corresponding path program 1 times [2025-03-17 05:37:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591032138] [2025-03-17 05:37:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:29,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:29,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:29,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:29,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:30,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:30,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591032138] [2025-03-17 05:37:30,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591032138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:30,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:30,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:37:30,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186379002] [2025-03-17 05:37:30,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:30,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:37:30,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:30,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:37:30,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:37:30,062 INFO L87 Difference]: Start difference. First operand 450 states and 644 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:30,365 INFO L93 Difference]: Finished difference Result 983 states and 1409 transitions. [2025-03-17 05:37:30,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:37:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-03-17 05:37:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:30,368 INFO L225 Difference]: With dead ends: 983 [2025-03-17 05:37:30,368 INFO L226 Difference]: Without dead ends: 688 [2025-03-17 05:37:30,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:37:30,369 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 322 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:30,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1137 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:37:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-17 05:37:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 593. [2025-03-17 05:37:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 525 states have (on average 1.4) internal successors, (735), 527 states have internal predecessors, (735), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:37:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 855 transitions. [2025-03-17 05:37:30,420 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 855 transitions. Word has length 151 [2025-03-17 05:37:30,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:30,420 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 855 transitions. [2025-03-17 05:37:30,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-17 05:37:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 855 transitions. [2025-03-17 05:37:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:30,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:30,421 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:30,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 05:37:30,422 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:30,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:30,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1027925238, now seen corresponding path program 1 times [2025-03-17 05:37:30,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:30,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716488154] [2025-03-17 05:37:30,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:30,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:30,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:30,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:30,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:31,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:31,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716488154] [2025-03-17 05:37:31,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716488154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:31,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:31,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:37:31,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078758994] [2025-03-17 05:37:31,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:31,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:37:31,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:31,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:37:31,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:37:31,033 INFO L87 Difference]: Start difference. First operand 593 states and 855 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:37:31,517 INFO L93 Difference]: Finished difference Result 1172 states and 1678 transitions. [2025-03-17 05:37:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:37:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 151 [2025-03-17 05:37:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:37:31,520 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 05:37:31,520 INFO L226 Difference]: Without dead ends: 703 [2025-03-17 05:37:31,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:37:31,521 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 333 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:37:31,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 868 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:37:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-17 05:37:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 591. [2025-03-17 05:37:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 523 states have (on average 1.3919694072657744) internal successors, (728), 525 states have internal predecessors, (728), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:37:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 848 transitions. [2025-03-17 05:37:31,574 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 848 transitions. Word has length 151 [2025-03-17 05:37:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:37:31,574 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 848 transitions. [2025-03-17 05:37:31,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-17 05:37:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 848 transitions. [2025-03-17 05:37:31,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 05:37:31,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:37:31,575 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:31,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-17 05:37:31,576 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:37:31,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:37:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash 186223564, now seen corresponding path program 1 times [2025-03-17 05:37:31,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:37:31,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312125769] [2025-03-17 05:37:31,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:37:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:37:31,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 05:37:31,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 05:37:31,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:37:31,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:37:54,721 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-17 05:37:54,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:37:54,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312125769] [2025-03-17 05:37:54,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312125769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:37:54,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:37:54,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2025-03-17 05:37:54,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396221975] [2025-03-17 05:37:54,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:37:54,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 05:37:54,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:37:54,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 05:37:54,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:37:54,722 INFO L87 Difference]: Start difference. First operand 591 states and 848 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 26 states have internal predecessors, (59), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 4 states have call predecessors, (19), 6 states have call successors, (19)