./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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-27.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 1ed18464d9ce97d1cc1f49d30a31556076037dce4eff04ef8ec5de65e115e002 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:26:23,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:26:23,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:26:23,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:26:23,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:26:23,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:26:23,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:26:23,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:26:23,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:26:23,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:26:23,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:26:23,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:26:23,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:26:23,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:26:23,493 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:26:23,493 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:26:23,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:26:23,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:26:23,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:26:23,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:26:23,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:23,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:26:23,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:26:23,497 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 -> 1ed18464d9ce97d1cc1f49d30a31556076037dce4eff04ef8ec5de65e115e002 [2025-03-08 16:26:23,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:26:23,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:26:23,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:26:23,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:26:23,751 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:26:23,752 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-27.i [2025-03-08 16:26:24,873 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d92a38a3/e7f6e7f8e1e8433db77755c6f4cc1e08/FLAG225a59631 [2025-03-08 16:26:25,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:26:25,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-27.i [2025-03-08 16:26:25,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d92a38a3/e7f6e7f8e1e8433db77755c6f4cc1e08/FLAG225a59631 [2025-03-08 16:26:25,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d92a38a3/e7f6e7f8e1e8433db77755c6f4cc1e08 [2025-03-08 16:26:25,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:26:25,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:26:25,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:25,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:26:25,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:26:25,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25, skipping insertion in model container [2025-03-08 16:26:25,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:26:25,574 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-27.i[917,930] [2025-03-08 16:26:25,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:25,641 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:26:25,650 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-27.i[917,930] [2025-03-08 16:26:25,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:26:25,690 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:26:25,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25 WrapperNode [2025-03-08 16:26:25,691 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:26:25,692 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:25,692 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:26:25,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:26:25,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,709 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,737 INFO L138 Inliner]: procedures = 26, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 442 [2025-03-08 16:26:25,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:26:25,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:26:25,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:26:25,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:26:25,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,771 INFO L175 MemorySlicer]: Split 123 memory accesses to 5 slices as follows [2, 16, 70, 11, 24]. 57 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 6, 1, 3]. The 16 writes are split as follows [0, 2, 8, 1, 5]. [2025-03-08 16:26:25,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:26:25,784 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:26:25,784 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:26:25,784 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:26:25,785 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (1/1) ... [2025-03-08 16:26:25,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:26:25,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:25,816 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-08 16:26:25,820 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-08 16:26:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:26:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:26:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:26:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:26:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:26:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:26:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:26:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:26:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:26:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:26:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:26:25,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:26:25,937 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:26:25,939 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:26:26,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem67#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite74#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short83#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite100#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem91#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~short101#1;havoc property_#t~mem102#1;havoc property_#t~ite120#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~ite117#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem119#1;havoc property_#t~mem118#1;havoc property_#t~short121#1; [2025-03-08 16:26:26,328 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2025-03-08 16:26:26,329 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:26:26,338 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:26:26,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:26:26,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:26 BoogieIcfgContainer [2025-03-08 16:26:26,338 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:26:26,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:26:26,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:26:26,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:26:26,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:26:25" (1/3) ... [2025-03-08 16:26:26,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3346172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:26, skipping insertion in model container [2025-03-08 16:26:26,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:26:25" (2/3) ... [2025-03-08 16:26:26,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3346172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:26:26, skipping insertion in model container [2025-03-08 16:26:26,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:26:26" (3/3) ... [2025-03-08 16:26:26,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-27.i [2025-03-08 16:26:26,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:26:26,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-27.i that has 2 procedures, 93 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:26:26,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:26:26,423 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;@5da2d8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:26:26,424 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:26:26,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:26:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:26:26,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:26,438 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:26,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:26,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 887028870, now seen corresponding path program 1 times [2025-03-08 16:26:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841870572] [2025-03-08 16:26:26,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:26,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:26:26,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:26:26,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:26,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:26:26,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:26,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841870572] [2025-03-08 16:26:26,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841870572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:26:26,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103065869] [2025-03-08 16:26:26,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:26:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:26,708 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-08 16:26:26,710 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-08 16:26:26,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:26:26,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:26:26,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:26,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:26,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:26:26,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:26:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:26:26,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:26:26,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103065869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:26,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:26:26,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:26:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960967326] [2025-03-08 16:26:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:26,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:26:26,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:26,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:26:26,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:26:26,939 INFO L87 Difference]: Start difference. First operand has 93 states, 73 states have (on average 1.36986301369863) internal successors, (100), 74 states have internal predecessors, (100), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:26,963 INFO L93 Difference]: Finished difference Result 180 states and 280 transitions. [2025-03-08 16:26:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:26:26,964 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-08 16:26:26,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:26,968 INFO L225 Difference]: With dead ends: 180 [2025-03-08 16:26:26,968 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 16:26:26,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-08 16:26:26,973 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:26,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 16:26:26,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-08 16:26:26,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:26:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2025-03-08 16:26:27,000 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 131 [2025-03-08 16:26:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:27,000 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2025-03-08 16:26:27,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2025-03-08 16:26:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:26:27,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:27,004 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:27,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:26:27,207 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-08 16:26:27,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:27,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 564543445, now seen corresponding path program 1 times [2025-03-08 16:26:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086980471] [2025-03-08 16:26:27,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:27,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:26:27,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:26:27,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:27,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:27,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:27,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086980471] [2025-03-08 16:26:27,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086980471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:27,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:27,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:27,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621402548] [2025-03-08 16:26:27,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:27,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:27,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:27,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:27,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:27,734 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:27,865 INFO L93 Difference]: Finished difference Result 224 states and 324 transitions. [2025-03-08 16:26:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:27,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-08 16:26:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:27,867 INFO L225 Difference]: With dead ends: 224 [2025-03-08 16:26:27,867 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 16:26:27,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:27,868 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 68 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:27,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 456 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 16:26:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2025-03-08 16:26:27,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:26:27,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-08 16:26:27,883 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 131 [2025-03-08 16:26:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:27,886 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-08 16:26:27,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:27,886 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-08 16:26:27,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:26:27,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:27,888 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:27,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:26:27,889 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:27,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -279928426, now seen corresponding path program 1 times [2025-03-08 16:26:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630988116] [2025-03-08 16:26:27,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:27,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:26:27,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:26:27,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:27,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:28,434 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:28,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630988116] [2025-03-08 16:26:28,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630988116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:28,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401694507] [2025-03-08 16:26:28,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:28,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:28,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:28,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:28,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:28,438 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:28,572 INFO L93 Difference]: Finished difference Result 241 states and 348 transitions. [2025-03-08 16:26:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:26:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-08 16:26:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:28,574 INFO L225 Difference]: With dead ends: 241 [2025-03-08 16:26:28,577 INFO L226 Difference]: Without dead ends: 150 [2025-03-08 16:26:28,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:28,578 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 49 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:28,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 397 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-08 16:26:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2025-03-08 16:26:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 109 states have (on average 1.2935779816513762) internal successors, (141), 109 states have internal predecessors, (141), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 209 transitions. [2025-03-08 16:26:28,599 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 209 transitions. Word has length 131 [2025-03-08 16:26:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 209 transitions. [2025-03-08 16:26:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 209 transitions. [2025-03-08 16:26:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 16:26:28,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:28,601 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:28,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:26:28,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:28,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1809307926, now seen corresponding path program 1 times [2025-03-08 16:26:28,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:28,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887692028] [2025-03-08 16:26:28,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:28,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:28,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 16:26:28,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 16:26:28,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:28,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:28,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:28,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887692028] [2025-03-08 16:26:28,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887692028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:28,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:28,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797250800] [2025-03-08 16:26:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:28,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:28,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:28,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:28,905 INFO L87 Difference]: Start difference. First operand 146 states and 209 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:28,964 INFO L93 Difference]: Finished difference Result 288 states and 413 transitions. [2025-03-08 16:26:28,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 131 [2025-03-08 16:26:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:28,967 INFO L225 Difference]: With dead ends: 288 [2025-03-08 16:26:28,967 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:26:28,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:28,968 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 118 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:28,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 463 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:26:28,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 164. [2025-03-08 16:26:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 127 states have (on average 1.2992125984251968) internal successors, (165), 127 states have internal predecessors, (165), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2025-03-08 16:26:28,989 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 131 [2025-03-08 16:26:28,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:28,990 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2025-03-08 16:26:28,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:28,991 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2025-03-08 16:26:28,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:26:28,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:28,994 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:28,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:26:28,994 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:28,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1220380393, now seen corresponding path program 1 times [2025-03-08 16:26:28,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:28,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677969036] [2025-03-08 16:26:28,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:29,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:26:29,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:26:29,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:29,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:30,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677969036] [2025-03-08 16:26:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677969036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:30,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460397] [2025-03-08 16:26:30,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:30,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:30,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:30,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:30,138 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:30,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:30,751 INFO L93 Difference]: Finished difference Result 331 states and 470 transitions. [2025-03-08 16:26:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:26:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-08 16:26:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:30,753 INFO L225 Difference]: With dead ends: 331 [2025-03-08 16:26:30,753 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 16:26:30,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-08 16:26:30,755 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 322 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:30,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 512 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:26:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 16:26:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 220. [2025-03-08 16:26:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 178 states have (on average 1.3146067415730338) internal successors, (234), 179 states have internal predecessors, (234), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:26:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 310 transitions. [2025-03-08 16:26:30,788 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 310 transitions. Word has length 132 [2025-03-08 16:26:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 310 transitions. [2025-03-08 16:26:30,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 310 transitions. [2025-03-08 16:26:30,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 16:26:30,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:30,791 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:30,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:26:30,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:30,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:30,791 INFO L85 PathProgramCache]: Analyzing trace with hash 287171416, now seen corresponding path program 1 times [2025-03-08 16:26:30,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:30,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133254552] [2025-03-08 16:26:30,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:30,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:30,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 16:26:30,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 16:26:30,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:31,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133254552] [2025-03-08 16:26:31,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133254552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:31,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:31,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:31,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038265413] [2025-03-08 16:26:31,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:31,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:31,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:31,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:31,693 INFO L87 Difference]: Start difference. First operand 220 states and 310 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:32,014 INFO L93 Difference]: Finished difference Result 437 states and 616 transitions. [2025-03-08 16:26:32,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:26:32,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2025-03-08 16:26:32,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:32,018 INFO L225 Difference]: With dead ends: 437 [2025-03-08 16:26:32,018 INFO L226 Difference]: Without dead ends: 277 [2025-03-08 16:26:32,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:26:32,019 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 308 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:32,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 507 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:32,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-08 16:26:32,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 226. [2025-03-08 16:26:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 184 states have (on average 1.315217391304348) internal successors, (242), 185 states have internal predecessors, (242), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:26:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 318 transitions. [2025-03-08 16:26:32,040 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 318 transitions. Word has length 132 [2025-03-08 16:26:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:32,040 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 318 transitions. [2025-03-08 16:26:32,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 318 transitions. [2025-03-08 16:26:32,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 16:26:32,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:32,042 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:32,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:26:32,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:32,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:32,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1764444269, now seen corresponding path program 1 times [2025-03-08 16:26:32,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:32,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546772710] [2025-03-08 16:26:32,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:32,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 16:26:32,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 16:26:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:32,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:32,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546772710] [2025-03-08 16:26:32,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546772710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:32,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:32,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:26:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801729890] [2025-03-08 16:26:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:26:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:32,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:26:32,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:26:32,514 INFO L87 Difference]: Start difference. First operand 226 states and 318 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:32,702 INFO L93 Difference]: Finished difference Result 548 states and 776 transitions. [2025-03-08 16:26:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:26:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 133 [2025-03-08 16:26:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:32,704 INFO L225 Difference]: With dead ends: 548 [2025-03-08 16:26:32,704 INFO L226 Difference]: Without dead ends: 382 [2025-03-08 16:26:32,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:26:32,706 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 233 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:32,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 463 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-08 16:26:32,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 374. [2025-03-08 16:26:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 309 states have (on average 1.3333333333333333) internal successors, (412), 311 states have internal predecessors, (412), 59 states have call successors, (59), 5 states have call predecessors, (59), 5 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-08 16:26:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 530 transitions. [2025-03-08 16:26:32,745 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 530 transitions. Word has length 133 [2025-03-08 16:26:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:32,746 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 530 transitions. [2025-03-08 16:26:32,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 530 transitions. [2025-03-08 16:26:32,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:26:32,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:32,748 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:32,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:26:32,748 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:32,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:32,748 INFO L85 PathProgramCache]: Analyzing trace with hash 699314900, now seen corresponding path program 1 times [2025-03-08 16:26:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:32,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329609546] [2025-03-08 16:26:32,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:32,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:32,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:26:32,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:26:32,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:32,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:33,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329609546] [2025-03-08 16:26:33,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329609546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:33,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:33,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:26:33,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450757382] [2025-03-08 16:26:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:26:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:33,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:26:33,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:26:33,123 INFO L87 Difference]: Start difference. First operand 374 states and 530 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:33,436 INFO L93 Difference]: Finished difference Result 556 states and 777 transitions. [2025-03-08 16:26:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:26:33,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-03-08 16:26:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:33,439 INFO L225 Difference]: With dead ends: 556 [2025-03-08 16:26:33,439 INFO L226 Difference]: Without dead ends: 390 [2025-03-08 16:26:33,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:26:33,440 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 290 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:33,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 410 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:33,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-08 16:26:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 297. [2025-03-08 16:26:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 239 states have (on average 1.301255230125523) internal successors, (311), 239 states have internal predecessors, (311), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-08 16:26:33,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 413 transitions. [2025-03-08 16:26:33,470 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 413 transitions. Word has length 134 [2025-03-08 16:26:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:33,471 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 413 transitions. [2025-03-08 16:26:33,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 413 transitions. [2025-03-08 16:26:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 16:26:33,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:33,472 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:33,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:26:33,472 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:33,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:33,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1025690742, now seen corresponding path program 1 times [2025-03-08 16:26:33,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:33,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939909676] [2025-03-08 16:26:33,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:33,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:33,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 16:26:33,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 16:26:33,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:33,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:33,766 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:33,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:33,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939909676] [2025-03-08 16:26:33,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939909676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:33,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:33,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:26:33,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223838663] [2025-03-08 16:26:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:33,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:26:33,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:33,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:26:33,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:26:33,768 INFO L87 Difference]: Start difference. First operand 297 states and 413 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:33,993 INFO L93 Difference]: Finished difference Result 579 states and 806 transitions. [2025-03-08 16:26:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:26:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 134 [2025-03-08 16:26:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:33,995 INFO L225 Difference]: With dead ends: 579 [2025-03-08 16:26:33,995 INFO L226 Difference]: Without dead ends: 335 [2025-03-08 16:26:33,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:33,996 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 198 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:33,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 355 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-08 16:26:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 236. [2025-03-08 16:26:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 197 states have (on average 1.3147208121827412) internal successors, (259), 197 states have internal predecessors, (259), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 327 transitions. [2025-03-08 16:26:34,021 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 327 transitions. Word has length 134 [2025-03-08 16:26:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:34,021 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 327 transitions. [2025-03-08 16:26:34,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 327 transitions. [2025-03-08 16:26:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:34,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:34,022 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:34,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:26:34,023 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:34,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:34,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2142970297, now seen corresponding path program 1 times [2025-03-08 16:26:34,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:34,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986851996] [2025-03-08 16:26:34,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:34,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:34,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:34,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:34,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:34,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:35,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:35,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986851996] [2025-03-08 16:26:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986851996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:35,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:26:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455833306] [2025-03-08 16:26:35,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:26:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:35,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:26:35,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:26:35,570 INFO L87 Difference]: Start difference. First operand 236 states and 327 transitions. Second operand has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:36,753 INFO L93 Difference]: Finished difference Result 708 states and 977 transitions. [2025-03-08 16:26:36,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 16:26:36,754 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-08 16:26:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:36,757 INFO L225 Difference]: With dead ends: 708 [2025-03-08 16:26:36,757 INFO L226 Difference]: Without dead ends: 475 [2025-03-08 16:26:36,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:26:36,761 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 365 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:36,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 801 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 16:26:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-03-08 16:26:36,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 325. [2025-03-08 16:26:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 286 states have (on average 1.3286713286713288) internal successors, (380), 286 states have internal predecessors, (380), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 448 transitions. [2025-03-08 16:26:36,796 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 448 transitions. Word has length 135 [2025-03-08 16:26:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:36,797 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 448 transitions. [2025-03-08 16:26:36,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.533333333333333) internal successors, (53), 15 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 448 transitions. [2025-03-08 16:26:36,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:36,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:36,798 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:36,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:26:36,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:36,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash 813006321, now seen corresponding path program 1 times [2025-03-08 16:26:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583925056] [2025-03-08 16:26:36,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:36,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:36,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:36,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:36,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:37,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583925056] [2025-03-08 16:26:37,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583925056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:37,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712600728] [2025-03-08 16:26:37,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:37,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:37,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:37,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:37,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:37,402 INFO L87 Difference]: Start difference. First operand 325 states and 448 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:37,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:37,877 INFO L93 Difference]: Finished difference Result 799 states and 1100 transitions. [2025-03-08 16:26:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:26:37,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-08 16:26:37,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:37,879 INFO L225 Difference]: With dead ends: 799 [2025-03-08 16:26:37,879 INFO L226 Difference]: Without dead ends: 477 [2025-03-08 16:26:37,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:26:37,880 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 278 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:37,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 525 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:26:37,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-08 16:26:37,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 381. [2025-03-08 16:26:37,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 342 states have (on average 1.3216374269005848) internal successors, (452), 342 states have internal predecessors, (452), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 520 transitions. [2025-03-08 16:26:37,907 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 520 transitions. Word has length 135 [2025-03-08 16:26:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:37,908 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 520 transitions. [2025-03-08 16:26:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 520 transitions. [2025-03-08 16:26:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:37,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:37,909 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:37,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:26:37,910 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:37,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 942089040, now seen corresponding path program 1 times [2025-03-08 16:26:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:37,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748260515] [2025-03-08 16:26:37,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:37,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:37,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:37,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:37,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:38,486 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:38,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:38,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748260515] [2025-03-08 16:26:38,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748260515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:38,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:38,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:26:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225663327] [2025-03-08 16:26:38,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:38,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:26:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:38,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:26:38,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:26:38,488 INFO L87 Difference]: Start difference. First operand 381 states and 520 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:39,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:39,140 INFO L93 Difference]: Finished difference Result 855 states and 1168 transitions. [2025-03-08 16:26:39,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:26:39,141 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-08 16:26:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:39,143 INFO L225 Difference]: With dead ends: 855 [2025-03-08 16:26:39,143 INFO L226 Difference]: Without dead ends: 477 [2025-03-08 16:26:39,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:26:39,144 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 231 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:39,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1002 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:26:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-03-08 16:26:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 389. [2025-03-08 16:26:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 350 states have (on average 1.3142857142857143) internal successors, (460), 350 states have internal predecessors, (460), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 528 transitions. [2025-03-08 16:26:39,195 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 528 transitions. Word has length 135 [2025-03-08 16:26:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:39,196 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 528 transitions. [2025-03-08 16:26:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:39,197 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 528 transitions. [2025-03-08 16:26:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:39,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:39,199 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:39,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 16:26:39,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:39,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:39,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1221830546, now seen corresponding path program 1 times [2025-03-08 16:26:39,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:39,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-08 16:26:39,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:39,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:39,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:39,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:39,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:39,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:39,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:39,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985456209] [2025-03-08 16:26:39,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985456209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:39,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:39,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:26:39,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67647132] [2025-03-08 16:26:39,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:39,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:26:39,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:39,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:26:39,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:26:39,913 INFO L87 Difference]: Start difference. First operand 389 states and 528 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:40,586 INFO L93 Difference]: Finished difference Result 871 states and 1184 transitions. [2025-03-08 16:26:40,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:26:40,586 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2025-03-08 16:26:40,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:40,589 INFO L225 Difference]: With dead ends: 871 [2025-03-08 16:26:40,589 INFO L226 Difference]: Without dead ends: 485 [2025-03-08 16:26:40,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-08 16:26:40,591 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 181 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:40,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 849 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:26:40,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-08 16:26:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 389. [2025-03-08 16:26:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 350 states have (on average 1.3142857142857143) internal successors, (460), 350 states have internal predecessors, (460), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 528 transitions. [2025-03-08 16:26:40,631 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 528 transitions. Word has length 135 [2025-03-08 16:26:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:40,631 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 528 transitions. [2025-03-08 16:26:40,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:26:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 528 transitions. [2025-03-08 16:26:40,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:40,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:40,633 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:40,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 16:26:40,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:40,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1350913265, now seen corresponding path program 1 times [2025-03-08 16:26:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517339661] [2025-03-08 16:26:40,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:40,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:40,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:40,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:40,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:41,165 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:41,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:41,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517339661] [2025-03-08 16:26:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517339661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312453789] [2025-03-08 16:26:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:41,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:41,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:41,167 INFO L87 Difference]: Start difference. First operand 389 states and 528 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:41,687 INFO L93 Difference]: Finished difference Result 859 states and 1164 transitions. [2025-03-08 16:26:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:26:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 135 [2025-03-08 16:26:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:41,692 INFO L225 Difference]: With dead ends: 859 [2025-03-08 16:26:41,692 INFO L226 Difference]: Without dead ends: 473 [2025-03-08 16:26:41,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:26:41,693 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 272 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:41,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 574 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:26:41,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-03-08 16:26:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 377. [2025-03-08 16:26:41,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 338 states have (on average 1.301775147928994) internal successors, (440), 338 states have internal predecessors, (440), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 508 transitions. [2025-03-08 16:26:41,734 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 508 transitions. Word has length 135 [2025-03-08 16:26:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:41,735 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 508 transitions. [2025-03-08 16:26:41,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:41,735 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 508 transitions. [2025-03-08 16:26:41,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:41,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:41,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:41,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:26:41,736 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:41,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:41,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2111950490, now seen corresponding path program 1 times [2025-03-08 16:26:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:41,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-08 16:26:41,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:41,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:41,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:41,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:41,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754508302] [2025-03-08 16:26:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754508302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981152955] [2025-03-08 16:26:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:41,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:41,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:41,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:41,867 INFO L87 Difference]: Start difference. First operand 377 states and 508 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:41,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:41,938 INFO L93 Difference]: Finished difference Result 799 states and 1078 transitions. [2025-03-08 16:26:41,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:41,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-08 16:26:41,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:41,941 INFO L225 Difference]: With dead ends: 799 [2025-03-08 16:26:41,941 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 16:26:41,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:41,942 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 51 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:41,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 541 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 16:26:41,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 379. [2025-03-08 16:26:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 340 states have (on average 1.3) internal successors, (442), 340 states have internal predecessors, (442), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 510 transitions. [2025-03-08 16:26:41,971 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 510 transitions. Word has length 135 [2025-03-08 16:26:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:41,971 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 510 transitions. [2025-03-08 16:26:41,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 510 transitions. [2025-03-08 16:26:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 16:26:41,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:41,973 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:41,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:26:41,973 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:41,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:41,974 INFO L85 PathProgramCache]: Analyzing trace with hash 386065447, now seen corresponding path program 1 times [2025-03-08 16:26:41,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:41,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819562551] [2025-03-08 16:26:41,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:41,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:41,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 16:26:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 16:26:41,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:41,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819562551] [2025-03-08 16:26:42,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819562551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:42,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264152970] [2025-03-08 16:26:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:42,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:42,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:42,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:42,117 INFO L87 Difference]: Start difference. First operand 379 states and 510 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:42,187 INFO L93 Difference]: Finished difference Result 822 states and 1104 transitions. [2025-03-08 16:26:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:42,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 135 [2025-03-08 16:26:42,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:42,189 INFO L225 Difference]: With dead ends: 822 [2025-03-08 16:26:42,189 INFO L226 Difference]: Without dead ends: 446 [2025-03-08 16:26:42,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:42,191 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 53 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:42,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 461 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:42,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-08 16:26:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 398. [2025-03-08 16:26:42,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 359 states have (on average 1.2813370473537604) internal successors, (460), 359 states have internal predecessors, (460), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 528 transitions. [2025-03-08 16:26:42,224 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 528 transitions. Word has length 135 [2025-03-08 16:26:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:42,225 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 528 transitions. [2025-03-08 16:26:42,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 528 transitions. [2025-03-08 16:26:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:42,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:42,226 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:42,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 16:26:42,227 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:42,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -129115165, now seen corresponding path program 1 times [2025-03-08 16:26:42,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:42,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548067088] [2025-03-08 16:26:42,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:42,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:42,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:42,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:42,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:42,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:42,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:42,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548067088] [2025-03-08 16:26:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548067088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:42,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 16:26:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595283744] [2025-03-08 16:26:42,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 16:26:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:42,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 16:26:42,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 16:26:42,866 INFO L87 Difference]: Start difference. First operand 398 states and 528 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:43,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:43,499 INFO L93 Difference]: Finished difference Result 762 states and 1007 transitions. [2025-03-08 16:26:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:26:43,500 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:26:43,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:43,502 INFO L225 Difference]: With dead ends: 762 [2025-03-08 16:26:43,502 INFO L226 Difference]: Without dead ends: 537 [2025-03-08 16:26:43,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-03-08 16:26:43,504 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 210 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:43,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 897 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:26:43,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-08 16:26:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 506. [2025-03-08 16:26:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 467 states have (on average 1.2826552462526766) internal successors, (599), 467 states have internal predecessors, (599), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 667 transitions. [2025-03-08 16:26:43,532 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 667 transitions. Word has length 139 [2025-03-08 16:26:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:43,532 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 667 transitions. [2025-03-08 16:26:43,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 667 transitions. [2025-03-08 16:26:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:43,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:43,533 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:43,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:26:43,534 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:43,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:43,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1936569628, now seen corresponding path program 1 times [2025-03-08 16:26:43,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:43,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246554916] [2025-03-08 16:26:43,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:43,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:43,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:43,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:43,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:43,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:43,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246554916] [2025-03-08 16:26:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246554916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:43,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:43,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:43,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533246837] [2025-03-08 16:26:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:43,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:43,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:43,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:43,927 INFO L87 Difference]: Start difference. First operand 506 states and 667 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:44,219 INFO L93 Difference]: Finished difference Result 869 states and 1144 transitions. [2025-03-08 16:26:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:26:44,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:44,223 INFO L225 Difference]: With dead ends: 869 [2025-03-08 16:26:44,223 INFO L226 Difference]: Without dead ends: 536 [2025-03-08 16:26:44,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:26:44,224 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 305 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:44,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 458 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:44,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-03-08 16:26:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 506. [2025-03-08 16:26:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 467 states have (on average 1.2805139186295502) internal successors, (598), 467 states have internal predecessors, (598), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 666 transitions. [2025-03-08 16:26:44,251 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 666 transitions. Word has length 139 [2025-03-08 16:26:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:44,251 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 666 transitions. [2025-03-08 16:26:44,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 666 transitions. [2025-03-08 16:26:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:44,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:44,253 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:44,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:26:44,254 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:44,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1173745697, now seen corresponding path program 1 times [2025-03-08 16:26:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076829437] [2025-03-08 16:26:44,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:44,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:44,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:44,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:44,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076829437] [2025-03-08 16:26:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076829437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:44,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764877024] [2025-03-08 16:26:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:44,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:44,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:44,376 INFO L87 Difference]: Start difference. First operand 506 states and 666 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:44,443 INFO L93 Difference]: Finished difference Result 1067 states and 1406 transitions. [2025-03-08 16:26:44,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:44,444 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:44,446 INFO L225 Difference]: With dead ends: 1067 [2025-03-08 16:26:44,446 INFO L226 Difference]: Without dead ends: 564 [2025-03-08 16:26:44,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:44,447 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:44,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 461 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:44,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-08 16:26:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 523. [2025-03-08 16:26:44,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 484 states have (on average 1.2830578512396693) internal successors, (621), 484 states have internal predecessors, (621), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:44,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 689 transitions. [2025-03-08 16:26:44,477 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 689 transitions. Word has length 139 [2025-03-08 16:26:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:44,477 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 689 transitions. [2025-03-08 16:26:44,477 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,477 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 689 transitions. [2025-03-08 16:26:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:44,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:44,478 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:44,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:26:44,479 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:44,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1313767136, now seen corresponding path program 1 times [2025-03-08 16:26:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:44,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779554104] [2025-03-08 16:26:44,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:44,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:44,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-08 16:26:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779554104] [2025-03-08 16:26:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779554104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:26:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417100722] [2025-03-08 16:26:44,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:26:44,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:26:44,588 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-08 16:26:44,590 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-08 16:26:44,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:44,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:44,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:44,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:44,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:26:44,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:26:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:44,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:26:44,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417100722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:44,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:26:44,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:26:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989807097] [2025-03-08 16:26:44,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:44,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:26:44,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:44,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:26:44,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:44,781 INFO L87 Difference]: Start difference. First operand 523 states and 689 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:44,834 INFO L93 Difference]: Finished difference Result 1051 states and 1385 transitions. [2025-03-08 16:26:44,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:26:44,834 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:44,836 INFO L225 Difference]: With dead ends: 1051 [2025-03-08 16:26:44,836 INFO L226 Difference]: Without dead ends: 531 [2025-03-08 16:26:44,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:44,839 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:44,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-08 16:26:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 528. [2025-03-08 16:26:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 489 states have (on average 1.2801635991820042) internal successors, (626), 489 states have internal predecessors, (626), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 694 transitions. [2025-03-08 16:26:44,873 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 694 transitions. Word has length 139 [2025-03-08 16:26:44,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:44,873 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 694 transitions. [2025-03-08 16:26:44,873 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 694 transitions. [2025-03-08 16:26:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:44,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:44,875 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:44,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:26:45,078 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,SelfDestructingSolverStorable19 [2025-03-08 16:26:45,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:45,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:45,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1424412155, now seen corresponding path program 1 times [2025-03-08 16:26:45,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:45,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138000167] [2025-03-08 16:26:45,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:45,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:45,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:45,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138000167] [2025-03-08 16:26:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138000167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:26:45,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405348506] [2025-03-08 16:26:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:26:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:45,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:26:45,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:26:45,900 INFO L87 Difference]: Start difference. First operand 528 states and 694 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:46,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:46,674 INFO L93 Difference]: Finished difference Result 1063 states and 1391 transitions. [2025-03-08 16:26:46,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:26:46,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:26:46,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:46,677 INFO L225 Difference]: With dead ends: 1063 [2025-03-08 16:26:46,677 INFO L226 Difference]: Without dead ends: 718 [2025-03-08 16:26:46,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-08 16:26:46,678 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 350 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:46,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 763 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:26:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-08 16:26:46,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 582. [2025-03-08 16:26:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 543 states have (on average 1.285451197053407) internal successors, (698), 543 states have internal predecessors, (698), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 766 transitions. [2025-03-08 16:26:46,727 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 766 transitions. Word has length 139 [2025-03-08 16:26:46,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:46,727 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 766 transitions. [2025-03-08 16:26:46,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:46,727 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 766 transitions. [2025-03-08 16:26:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:46,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:46,730 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:46,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 16:26:46,730 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:46,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:46,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1063100678, now seen corresponding path program 1 times [2025-03-08 16:26:46,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:46,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215296844] [2025-03-08 16:26:46,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:46,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:46,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:46,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:46,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:46,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:47,531 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:47,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215296844] [2025-03-08 16:26:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215296844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:47,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:47,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 16:26:47,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235824110] [2025-03-08 16:26:47,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:47,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 16:26:47,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:47,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 16:26:47,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:26:47,533 INFO L87 Difference]: Start difference. First operand 582 states and 766 transitions. Second operand has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:48,280 INFO L93 Difference]: Finished difference Result 1130 states and 1483 transitions. [2025-03-08 16:26:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:26:48,280 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:26:48,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:48,282 INFO L225 Difference]: With dead ends: 1130 [2025-03-08 16:26:48,283 INFO L226 Difference]: Without dead ends: 731 [2025-03-08 16:26:48,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:26:48,284 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 234 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:48,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1030 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:26:48,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2025-03-08 16:26:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 691. [2025-03-08 16:26:48,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 652 states have (on average 1.2883435582822085) internal successors, (840), 652 states have internal predecessors, (840), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 908 transitions. [2025-03-08 16:26:48,314 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 908 transitions. Word has length 139 [2025-03-08 16:26:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:48,314 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 908 transitions. [2025-03-08 16:26:48,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:48,315 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 908 transitions. [2025-03-08 16:26:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:48,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:48,316 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:48,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 16:26:48,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:48,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 832498852, now seen corresponding path program 1 times [2025-03-08 16:26:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:48,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461658256] [2025-03-08 16:26:48,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:48,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:48,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:48,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:48,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:48,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:48,680 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461658256] [2025-03-08 16:26:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461658256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:48,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 16:26:48,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628845828] [2025-03-08 16:26:48,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:48,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 16:26:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:48,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 16:26:48,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:26:48,682 INFO L87 Difference]: Start difference. First operand 691 states and 908 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:48,965 INFO L93 Difference]: Finished difference Result 1249 states and 1637 transitions. [2025-03-08 16:26:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:26:48,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:48,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:48,968 INFO L225 Difference]: With dead ends: 1249 [2025-03-08 16:26:48,968 INFO L226 Difference]: Without dead ends: 741 [2025-03-08 16:26:48,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:26:48,969 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 213 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:48,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 537 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:48,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2025-03-08 16:26:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 653. [2025-03-08 16:26:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 614 states have (on average 1.288273615635179) internal successors, (791), 614 states have internal predecessors, (791), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 859 transitions. [2025-03-08 16:26:49,000 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 859 transitions. Word has length 139 [2025-03-08 16:26:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:49,000 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 859 transitions. [2025-03-08 16:26:49,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 859 transitions. [2025-03-08 16:26:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:49,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:49,001 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:49,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 16:26:49,001 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:49,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:49,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1476039638, now seen corresponding path program 1 times [2025-03-08 16:26:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747031599] [2025-03-08 16:26:49,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:49,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:49,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:49,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:49,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:49,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:49,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:49,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747031599] [2025-03-08 16:26:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747031599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:49,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:49,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007629979] [2025-03-08 16:26:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:49,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:49,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:49,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:49,200 INFO L87 Difference]: Start difference. First operand 653 states and 859 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:49,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:49,273 INFO L93 Difference]: Finished difference Result 1405 states and 1839 transitions. [2025-03-08 16:26:49,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:49,274 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:49,276 INFO L225 Difference]: With dead ends: 1405 [2025-03-08 16:26:49,276 INFO L226 Difference]: Without dead ends: 625 [2025-03-08 16:26:49,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:49,278 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:49,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 535 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-08 16:26:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 580. [2025-03-08 16:26:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 541 states have (on average 1.2717190388170057) internal successors, (688), 541 states have internal predecessors, (688), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 756 transitions. [2025-03-08 16:26:49,306 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 756 transitions. Word has length 139 [2025-03-08 16:26:49,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:49,307 INFO L471 AbstractCegarLoop]: Abstraction has 580 states and 756 transitions. [2025-03-08 16:26:49,307 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 756 transitions. [2025-03-08 16:26:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:49,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:49,309 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:49,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:26:49,309 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:49,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 31512171, now seen corresponding path program 1 times [2025-03-08 16:26:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991469054] [2025-03-08 16:26:49,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:49,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:49,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:49,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:49,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:50,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:50,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991469054] [2025-03-08 16:26:50,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991469054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:50,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:50,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:26:50,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471805125] [2025-03-08 16:26:50,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:50,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:26:50,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:50,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:26:50,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:26:50,021 INFO L87 Difference]: Start difference. First operand 580 states and 756 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:50,367 INFO L93 Difference]: Finished difference Result 1188 states and 1546 transitions. [2025-03-08 16:26:50,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:26:50,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 139 [2025-03-08 16:26:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:50,369 INFO L225 Difference]: With dead ends: 1188 [2025-03-08 16:26:50,369 INFO L226 Difference]: Without dead ends: 611 [2025-03-08 16:26:50,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:26:50,370 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 145 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:50,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 353 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:26:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-08 16:26:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 576. [2025-03-08 16:26:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 537 states have (on average 1.2625698324022345) internal successors, (678), 537 states have internal predecessors, (678), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 746 transitions. [2025-03-08 16:26:50,404 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 746 transitions. Word has length 139 [2025-03-08 16:26:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 746 transitions. [2025-03-08 16:26:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 746 transitions. [2025-03-08 16:26:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 16:26:50,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:50,405 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:50,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:26:50,405 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:50,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:50,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1013118361, now seen corresponding path program 1 times [2025-03-08 16:26:50,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:50,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930226851] [2025-03-08 16:26:50,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:50,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:50,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 16:26:50,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 16:26:50,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:50,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:50,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:50,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930226851] [2025-03-08 16:26:50,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930226851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:50,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:50,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:26:50,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150228803] [2025-03-08 16:26:50,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:50,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:26:50,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:50,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:26:50,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:26:50,757 INFO L87 Difference]: Start difference. First operand 576 states and 746 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:51,134 INFO L93 Difference]: Finished difference Result 1061 states and 1370 transitions. [2025-03-08 16:26:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:26:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-03-08 16:26:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:51,137 INFO L225 Difference]: With dead ends: 1061 [2025-03-08 16:26:51,137 INFO L226 Difference]: Without dead ends: 650 [2025-03-08 16:26:51,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:26:51,138 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 240 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:51,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 741 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-08 16:26:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 614. [2025-03-08 16:26:51,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 575 states have (on average 1.2608695652173914) internal successors, (725), 575 states have internal predecessors, (725), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 793 transitions. [2025-03-08 16:26:51,169 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 793 transitions. Word has length 139 [2025-03-08 16:26:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:51,169 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 793 transitions. [2025-03-08 16:26:51,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 793 transitions. [2025-03-08 16:26:51,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:26:51,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:51,171 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:51,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:26:51,172 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:51,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:51,173 INFO L85 PathProgramCache]: Analyzing trace with hash 822997640, now seen corresponding path program 1 times [2025-03-08 16:26:51,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:51,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706635621] [2025-03-08 16:26:51,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:51,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:51,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:26:51,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:26:51,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:51,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:51,922 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:51,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706635621] [2025-03-08 16:26:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706635621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:26:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249531629] [2025-03-08 16:26:51,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:51,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:26:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:51,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:26:51,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:26:51,924 INFO L87 Difference]: Start difference. First operand 614 states and 793 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:52,363 INFO L93 Difference]: Finished difference Result 1091 states and 1408 transitions. [2025-03-08 16:26:52,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:26:52,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 140 [2025-03-08 16:26:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:52,366 INFO L225 Difference]: With dead ends: 1091 [2025-03-08 16:26:52,366 INFO L226 Difference]: Without dead ends: 642 [2025-03-08 16:26:52,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:26:52,367 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 272 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:52,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 312 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:26:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-03-08 16:26:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 606. [2025-03-08 16:26:52,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 567 states have (on average 1.2574955908289243) internal successors, (713), 567 states have internal predecessors, (713), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 16:26:52,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 781 transitions. [2025-03-08 16:26:52,405 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 781 transitions. Word has length 140 [2025-03-08 16:26:52,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:52,405 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 781 transitions. [2025-03-08 16:26:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:26:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 781 transitions. [2025-03-08 16:26:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:26:52,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:52,406 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:52,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 16:26:52,406 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:52,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:52,407 INFO L85 PathProgramCache]: Analyzing trace with hash -180246181, now seen corresponding path program 1 times [2025-03-08 16:26:52,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:52,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668594921] [2025-03-08 16:26:52,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:52,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:26:52,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:26:52,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:52,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:52,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:52,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668594921] [2025-03-08 16:26:52,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668594921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:52,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:52,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:26:52,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193037097] [2025-03-08 16:26:52,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:52,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:26:52,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:52,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:26:52,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:26:52,680 INFO L87 Difference]: Start difference. First operand 606 states and 781 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:52,832 INFO L93 Difference]: Finished difference Result 833 states and 1040 transitions. [2025-03-08 16:26:52,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:26:52,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:26:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:52,835 INFO L225 Difference]: With dead ends: 833 [2025-03-08 16:26:52,835 INFO L226 Difference]: Without dead ends: 831 [2025-03-08 16:26:52,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:26:52,836 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 67 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:52,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 909 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-08 16:26:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 827. [2025-03-08 16:26:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 760 states have (on average 1.2078947368421054) internal successors, (918), 762 states have internal predecessors, (918), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1034 transitions. [2025-03-08 16:26:52,887 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1034 transitions. Word has length 141 [2025-03-08 16:26:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:52,888 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1034 transitions. [2025-03-08 16:26:52,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1034 transitions. [2025-03-08 16:26:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 16:26:52,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:52,889 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:52,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 16:26:52,889 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:52,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 696207071, now seen corresponding path program 1 times [2025-03-08 16:26:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843749718] [2025-03-08 16:26:52,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:52,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 16:26:52,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 16:26:52,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:52,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:53,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:53,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843749718] [2025-03-08 16:26:53,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843749718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:53,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:53,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:53,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945898790] [2025-03-08 16:26:53,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:53,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:53,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:53,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:53,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:53,082 INFO L87 Difference]: Start difference. First operand 827 states and 1034 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:53,191 INFO L93 Difference]: Finished difference Result 1694 states and 2115 transitions. [2025-03-08 16:26:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:53,192 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2025-03-08 16:26:53,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:53,194 INFO L225 Difference]: With dead ends: 1694 [2025-03-08 16:26:53,194 INFO L226 Difference]: Without dead ends: 870 [2025-03-08 16:26:53,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:53,196 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 36 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:53,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 536 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:53,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-03-08 16:26:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 848. [2025-03-08 16:26:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 781 states have (on average 1.2023047375160052) internal successors, (939), 783 states have internal predecessors, (939), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:53,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1055 transitions. [2025-03-08 16:26:53,278 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1055 transitions. Word has length 141 [2025-03-08 16:26:53,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:53,279 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1055 transitions. [2025-03-08 16:26:53,279 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1055 transitions. [2025-03-08 16:26:53,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:26:53,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:53,280 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:53,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 16:26:53,281 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:53,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:53,281 INFO L85 PathProgramCache]: Analyzing trace with hash 755884964, now seen corresponding path program 1 times [2025-03-08 16:26:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099534487] [2025-03-08 16:26:53,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:53,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:26:53,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:26:53,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:53,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099534487] [2025-03-08 16:26:53,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099534487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:53,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:53,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:53,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141599686] [2025-03-08 16:26:53,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:53,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:53,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:53,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:53,445 INFO L87 Difference]: Start difference. First operand 848 states and 1055 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:53,556 INFO L93 Difference]: Finished difference Result 1544 states and 1929 transitions. [2025-03-08 16:26:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:53,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 142 [2025-03-08 16:26:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:53,559 INFO L225 Difference]: With dead ends: 1544 [2025-03-08 16:26:53,559 INFO L226 Difference]: Without dead ends: 699 [2025-03-08 16:26:53,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:53,561 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 105 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:53,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 355 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-08 16:26:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 695. [2025-03-08 16:26:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 628 states have (on average 1.1719745222929936) internal successors, (736), 630 states have internal predecessors, (736), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 852 transitions. [2025-03-08 16:26:53,617 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 852 transitions. Word has length 142 [2025-03-08 16:26:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:53,617 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 852 transitions. [2025-03-08 16:26:53,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,618 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 852 transitions. [2025-03-08 16:26:53,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 16:26:53,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:53,619 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:53,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 16:26:53,620 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:53,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1260513912, now seen corresponding path program 1 times [2025-03-08 16:26:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847744921] [2025-03-08 16:26:53,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:53,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:53,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 16:26:53,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 16:26:53,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:53,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847744921] [2025-03-08 16:26:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847744921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176373003] [2025-03-08 16:26:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:53,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:53,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:53,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:53,733 INFO L87 Difference]: Start difference. First operand 695 states and 852 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:53,821 INFO L93 Difference]: Finished difference Result 1299 states and 1592 transitions. [2025-03-08 16:26:53,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:53,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 143 [2025-03-08 16:26:53,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:53,824 INFO L225 Difference]: With dead ends: 1299 [2025-03-08 16:26:53,824 INFO L226 Difference]: Without dead ends: 607 [2025-03-08 16:26:53,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:53,825 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 57 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:53,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 530 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:53,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-08 16:26:53,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 601. [2025-03-08 16:26:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 534 states have (on average 1.1591760299625469) internal successors, (619), 536 states have internal predecessors, (619), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 735 transitions. [2025-03-08 16:26:53,879 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 735 transitions. Word has length 143 [2025-03-08 16:26:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:53,879 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 735 transitions. [2025-03-08 16:26:53,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:53,879 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 735 transitions. [2025-03-08 16:26:53,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:26:53,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:53,880 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:53,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 16:26:53,881 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:53,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1995292554, now seen corresponding path program 1 times [2025-03-08 16:26:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008750958] [2025-03-08 16:26:53,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:53,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:26:53,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:26:53,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:53,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:54,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008750958] [2025-03-08 16:26:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008750958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717688307] [2025-03-08 16:26:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:54,010 INFO L87 Difference]: Start difference. First operand 601 states and 735 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:54,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:54,186 INFO L93 Difference]: Finished difference Result 1495 states and 1784 transitions. [2025-03-08 16:26:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:54,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-08 16:26:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:54,189 INFO L225 Difference]: With dead ends: 1495 [2025-03-08 16:26:54,189 INFO L226 Difference]: Without dead ends: 926 [2025-03-08 16:26:54,191 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-08 16:26:54,192 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:54,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 473 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:26:54,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2025-03-08 16:26:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 853. [2025-03-08 16:26:54,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 786 states have (on average 1.1272264631043256) internal successors, (886), 788 states have internal predecessors, (886), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1002 transitions. [2025-03-08 16:26:54,283 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1002 transitions. Word has length 144 [2025-03-08 16:26:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:54,284 INFO L471 AbstractCegarLoop]: Abstraction has 853 states and 1002 transitions. [2025-03-08 16:26:54,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1002 transitions. [2025-03-08 16:26:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:26:54,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:54,286 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:54,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 16:26:54,286 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:54,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:54,286 INFO L85 PathProgramCache]: Analyzing trace with hash -556864407, now seen corresponding path program 1 times [2025-03-08 16:26:54,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:54,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333873928] [2025-03-08 16:26:54,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:54,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:54,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:26:54,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:26:54,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:54,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:54,472 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333873928] [2025-03-08 16:26:54,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333873928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:54,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:54,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:26:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920483599] [2025-03-08 16:26:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:26:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:54,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:26:54,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:26:54,473 INFO L87 Difference]: Start difference. First operand 853 states and 1002 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:54,558 INFO L93 Difference]: Finished difference Result 1658 states and 1939 transitions. [2025-03-08 16:26:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:26:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-08 16:26:54,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:54,561 INFO L225 Difference]: With dead ends: 1658 [2025-03-08 16:26:54,562 INFO L226 Difference]: Without dead ends: 837 [2025-03-08 16:26:54,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:26:54,563 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:54,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 347 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:26:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-08 16:26:54,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 670. [2025-03-08 16:26:54,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 603 states have (on average 1.142620232172471) internal successors, (689), 605 states have internal predecessors, (689), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:54,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 805 transitions. [2025-03-08 16:26:54,624 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 805 transitions. Word has length 144 [2025-03-08 16:26:54,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:54,624 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 805 transitions. [2025-03-08 16:26:54,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:54,624 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 805 transitions. [2025-03-08 16:26:54,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:26:54,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:54,625 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:54,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 16:26:54,625 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:54,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:54,626 INFO L85 PathProgramCache]: Analyzing trace with hash -987036794, now seen corresponding path program 1 times [2025-03-08 16:26:54,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:54,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477400258] [2025-03-08 16:26:54,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:54,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:54,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:26:54,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:26:54,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:54,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477400258] [2025-03-08 16:26:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477400258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:55,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 16:26:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880740606] [2025-03-08 16:26:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:55,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 16:26:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:55,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 16:26:55,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:26:55,354 INFO L87 Difference]: Start difference. First operand 670 states and 805 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:26:55,711 INFO L93 Difference]: Finished difference Result 840 states and 989 transitions. [2025-03-08 16:26:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 16:26:55,711 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-08 16:26:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:26:55,715 INFO L225 Difference]: With dead ends: 840 [2025-03-08 16:26:55,715 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 16:26:55,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:26:55,717 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 140 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:26:55,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1179 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:26:55,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 16:26:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 797. [2025-03-08 16:26:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 730 states have (on average 1.1246575342465754) internal successors, (821), 732 states have internal predecessors, (821), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:26:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 937 transitions. [2025-03-08 16:26:55,810 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 937 transitions. Word has length 144 [2025-03-08 16:26:55,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:26:55,810 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 937 transitions. [2025-03-08 16:26:55,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:26:55,811 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 937 transitions. [2025-03-08 16:26:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:26:55,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:26:55,812 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:26:55,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 16:26:55,812 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:26:55,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:26:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash -99533113, now seen corresponding path program 1 times [2025-03-08 16:26:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:26:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883163020] [2025-03-08 16:26:55,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:26:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:26:55,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:26:55,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:26:55,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:26:55,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:26:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:26:58,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:26:58,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883163020] [2025-03-08 16:26:58,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883163020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:26:58,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:26:58,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:26:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649460908] [2025-03-08 16:26:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:26:58,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:26:58,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:26:58,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:26:58,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:26:58,054 INFO L87 Difference]: Start difference. First operand 797 states and 937 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:27:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:00,774 INFO L93 Difference]: Finished difference Result 1570 states and 1825 transitions. [2025-03-08 16:27:00,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:27:00,775 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-03-08 16:27:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:00,778 INFO L225 Difference]: With dead ends: 1570 [2025-03-08 16:27:00,778 INFO L226 Difference]: Without dead ends: 925 [2025-03-08 16:27:00,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:27:00,779 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 299 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:00,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 827 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 16:27:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-08 16:27:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 798. [2025-03-08 16:27:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 731 states have (on average 1.1244870041039672) internal successors, (822), 733 states have internal predecessors, (822), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:27:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 938 transitions. [2025-03-08 16:27:00,837 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 938 transitions. Word has length 144 [2025-03-08 16:27:00,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:00,837 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 938 transitions. [2025-03-08 16:27:00,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 17 states have internal predecessors, (62), 3 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 16:27:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 938 transitions. [2025-03-08 16:27:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:27:00,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:00,839 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:00,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 16:27:00,839 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:00,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:00,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1643277222, now seen corresponding path program 1 times [2025-03-08 16:27:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497044609] [2025-03-08 16:27:00,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:00,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:00,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:27:00,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:27:00,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:00,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:27:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:27:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:27:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497044609] [2025-03-08 16:27:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497044609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:27:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:27:00,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:27:00,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007063314] [2025-03-08 16:27:00,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:27:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:27:00,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:27:00,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:27:00,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:27:00,967 INFO L87 Difference]: Start difference. First operand 798 states and 938 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:27:01,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:27:01,134 INFO L93 Difference]: Finished difference Result 1673 states and 1931 transitions. [2025-03-08 16:27:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:27:01,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 144 [2025-03-08 16:27:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:27:01,138 INFO L225 Difference]: With dead ends: 1673 [2025-03-08 16:27:01,138 INFO L226 Difference]: Without dead ends: 1027 [2025-03-08 16:27:01,139 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-08 16:27:01,139 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 44 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:27:01,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 446 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:27:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-03-08 16:27:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 798. [2025-03-08 16:27:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 731 states have (on average 1.121751025991792) internal successors, (820), 733 states have internal predecessors, (820), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 16:27:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 936 transitions. [2025-03-08 16:27:01,198 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 936 transitions. Word has length 144 [2025-03-08 16:27:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:27:01,198 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 936 transitions. [2025-03-08 16:27:01,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:27:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 936 transitions. [2025-03-08 16:27:01,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 16:27:01,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:27:01,199 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:27:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 16:27:01,200 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:27:01,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:27:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1230721159, now seen corresponding path program 1 times [2025-03-08 16:27:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:27:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47797497] [2025-03-08 16:27:01,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:27:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:27:01,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 16:27:01,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 16:27:01,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:27:01,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat