./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c -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 f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:11:33,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:11:33,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:11:33,459 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:11:33,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:11:33,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:11:33,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:11:33,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:11:33,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:11:33,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:11:33,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:11:33,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:11:33,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:11:33,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:33,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:11:33,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:11:33,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:11:33,486 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 -> f8647b87d9679ff1ae7ce0cdb1a68cb57cbc5ac468f0ecd53079584cb92d51fd [2025-03-03 15:11:33,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:11:33,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:11:33,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:11:33,720 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:11:33,720 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:11:33,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:11:34,838 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fb39c73/2356cb3bd53e433bb23aabd4925b8738/FLAG51dc4603e [2025-03-03 15:11:35,129 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:11:35,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:11:35,139 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fb39c73/2356cb3bd53e433bb23aabd4925b8738/FLAG51dc4603e [2025-03-03 15:11:35,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2fb39c73/2356cb3bd53e433bb23aabd4925b8738 [2025-03-03 15:11:35,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:11:35,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:11:35,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:35,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:11:35,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:11:35,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f04cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35, skipping insertion in model container [2025-03-03 15:11:35,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,202 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:11:35,401 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2025-03-03 15:11:35,422 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2025-03-03 15:11:35,442 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2025-03-03 15:11:35,457 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2025-03-03 15:11:35,466 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2025-03-03 15:11:35,474 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2025-03-03 15:11:35,484 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2025-03-03 15:11:35,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:35,532 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:11:35,575 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[6197,6210] [2025-03-03 15:11:35,588 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[9182,9195] [2025-03-03 15:11:35,597 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[12241,12254] [2025-03-03 15:11:35,607 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[15128,15141] [2025-03-03 15:11:35,613 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[18343,18356] [2025-03-03 15:11:35,619 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[21435,21448] [2025-03-03 15:11:35,627 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/seq-mthreaded-reduced/pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c[24486,24499] [2025-03-03 15:11:35,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:11:35,660 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:11:35,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35 WrapperNode [2025-03-03 15:11:35,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:11:35,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:35,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:11:35,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:11:35,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,738 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1430 [2025-03-03 15:11:35,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:11:35,740 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:11:35,740 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:11:35,740 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:11:35,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,786 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:11:35,786 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:11:35,823 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:11:35,826 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:11:35,826 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:11:35,827 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (1/1) ... [2025-03-03 15:11:35,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:11:35,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:35,854 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-03 15:11:35,856 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-03 15:11:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:11:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:11:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:11:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:11:35,971 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:11:35,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:11:36,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1720: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~13#1;havoc main_~node3__m3~10#1;havoc main_~node2__m2~8#1;havoc main_~node1__m1~7#1;havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-03 15:11:36,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1593: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~9#1; [2025-03-03 15:11:36,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L671: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~3#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2158: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1139: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2130: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1272: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~9#1;havoc main_~node3__m3~7#1;havoc main_~node2__m2~6#1;havoc main_~node1__m1~5#1;havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2102: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1014: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1;havoc main_~node3__m3~5#1;havoc main_~node2__m2~4#1;havoc main_~node1__m1~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L325: havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2010: havoc main_~node3__m3~12#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1;havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1978: havoc main_~node2__m2~10#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945: havoc main_~node1__m1~9#1;havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~15#1;havoc main_~node3__m3~11#1;havoc main_~node2__m2~9#1;havoc main_~node1__m1~8#1;havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1122: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~5#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2048: havoc main_~check__tmp~16#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L793: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;havoc main_~node3__m3~4#1;havoc main_~node2__m2~3#1;havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:11:36,817 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1488: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~11#1;havoc main_~node3__m3~8#1;havoc main_~node2__m2~7#1;havoc main_~node1__m1~6#1;havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-03 15:11:36,851 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2025-03-03 15:11:36,851 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:11:36,860 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:11:36,861 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:11:36,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:36 BoogieIcfgContainer [2025-03-03 15:11:36,861 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:11:36,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:11:36,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:11:36,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:11:36,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:11:35" (1/3) ... [2025-03-03 15:11:36,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62467b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:36, skipping insertion in model container [2025-03-03 15:11:36,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:11:35" (2/3) ... [2025-03-03 15:11:36,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62467b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:11:36, skipping insertion in model container [2025-03-03 15:11:36,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:11:36" (3/3) ... [2025-03-03 15:11:36,872 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2025-03-03 15:11:36,882 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:11:36,885 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c.v+sep-reducer.c that has 1 procedures, 279 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-03 15:11:36,930 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:11:36,938 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;@5a905173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:11:36,938 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-03 15:11:36,944 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:11:36,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:36,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:36,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1208186107, now seen corresponding path program 1 times [2025-03-03 15:11:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:36,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960672973] [2025-03-03 15:11:36,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:36,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:37,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:11:37,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:11:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:37,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960672973] [2025-03-03 15:11:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960672973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:37,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546135357] [2025-03-03 15:11:37,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:37,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:37,435 INFO L87 Difference]: Start difference. First operand has 279 states, 271 states have (on average 1.7933579335793357) internal successors, (486), 278 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:37,672 INFO L93 Difference]: Finished difference Result 374 states and 630 transitions. [2025-03-03 15:11:37,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 15:11:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:37,684 INFO L225 Difference]: With dead ends: 374 [2025-03-03 15:11:37,684 INFO L226 Difference]: Without dead ends: 217 [2025-03-03 15:11:37,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:37,691 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 1057 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:37,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 254 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:37,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-03 15:11:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-03 15:11:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 210 states have (on average 1.2714285714285714) internal successors, (267), 216 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 267 transitions. [2025-03-03 15:11:37,720 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 267 transitions. Word has length 48 [2025-03-03 15:11:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:37,721 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 267 transitions. [2025-03-03 15:11:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 267 transitions. [2025-03-03 15:11:37,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:11:37,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:37,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:37,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:11:37,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:37,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2091570776, now seen corresponding path program 1 times [2025-03-03 15:11:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200286295] [2025-03-03 15:11:37,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:37,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:37,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:11:37,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:11:37,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:37,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:37,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:37,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:37,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200286295] [2025-03-03 15:11:37,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200286295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:37,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:37,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:37,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347466601] [2025-03-03 15:11:37,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:37,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:37,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:37,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:37,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:37,901 INFO L87 Difference]: Start difference. First operand 217 states and 267 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:38,020 INFO L93 Difference]: Finished difference Result 285 states and 354 transitions. [2025-03-03 15:11:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 15:11:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:38,022 INFO L225 Difference]: With dead ends: 285 [2025-03-03 15:11:38,022 INFO L226 Difference]: Without dead ends: 171 [2025-03-03 15:11:38,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:38,024 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 584 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:38,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 137 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:38,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-03 15:11:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-03-03 15:11:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 164 states have (on average 1.274390243902439) internal successors, (209), 170 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 209 transitions. [2025-03-03 15:11:38,033 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 209 transitions. Word has length 48 [2025-03-03 15:11:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:38,033 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 209 transitions. [2025-03-03 15:11:38,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 209 transitions. [2025-03-03 15:11:38,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 15:11:38,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:38,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:38,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:11:38,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash -938838892, now seen corresponding path program 1 times [2025-03-03 15:11:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026097616] [2025-03-03 15:11:38,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:38,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 15:11:38,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 15:11:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:38,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026097616] [2025-03-03 15:11:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026097616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:38,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:38,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:11:38,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018213624] [2025-03-03 15:11:38,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:38,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:38,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:38,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:38,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:38,187 INFO L87 Difference]: Start difference. First operand 171 states and 209 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:38,310 INFO L93 Difference]: Finished difference Result 257 states and 322 transitions. [2025-03-03 15:11:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 15:11:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:38,311 INFO L225 Difference]: With dead ends: 257 [2025-03-03 15:11:38,311 INFO L226 Difference]: Without dead ends: 163 [2025-03-03 15:11:38,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:38,312 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 541 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:38,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 134 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:38,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-03 15:11:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-03 15:11:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2756410256410255) internal successors, (199), 162 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 199 transitions. [2025-03-03 15:11:38,317 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 199 transitions. Word has length 48 [2025-03-03 15:11:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 199 transitions. [2025-03-03 15:11:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 199 transitions. [2025-03-03 15:11:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:38,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:38,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:38,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:11:38,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1282989432, now seen corresponding path program 1 times [2025-03-03 15:11:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:38,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449530956] [2025-03-03 15:11:38,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:38,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:38,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:38,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:38,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449530956] [2025-03-03 15:11:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449530956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:38,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:11:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753541038] [2025-03-03 15:11:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:38,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:11:38,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:38,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:11:38,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:11:38,607 INFO L87 Difference]: Start difference. First operand 163 states and 199 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:38,854 INFO L93 Difference]: Finished difference Result 326 states and 405 transitions. [2025-03-03 15:11:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:11:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:38,855 INFO L225 Difference]: With dead ends: 326 [2025-03-03 15:11:38,855 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 15:11:38,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:11:38,856 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1020 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:38,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 403 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:38,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 15:11:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 163. [2025-03-03 15:11:38,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 162 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2025-03-03 15:11:38,861 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 50 [2025-03-03 15:11:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:38,861 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2025-03-03 15:11:38,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2025-03-03 15:11:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:38,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:38,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:38,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:11:38,863 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:38,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash -812766472, now seen corresponding path program 1 times [2025-03-03 15:11:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:38,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173274031] [2025-03-03 15:11:38,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:38,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:38,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:38,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:38,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:39,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:39,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173274031] [2025-03-03 15:11:39,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173274031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:39,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:39,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:39,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989150750] [2025-03-03 15:11:39,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:39,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:39,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:39,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:39,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:39,107 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:39,429 INFO L93 Difference]: Finished difference Result 255 states and 313 transitions. [2025-03-03 15:11:39,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:11:39,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:39,430 INFO L225 Difference]: With dead ends: 255 [2025-03-03 15:11:39,430 INFO L226 Difference]: Without dead ends: 249 [2025-03-03 15:11:39,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:39,431 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 719 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:39,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 653 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-03-03 15:11:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 163. [2025-03-03 15:11:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2628205128205128) internal successors, (197), 162 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2025-03-03 15:11:39,442 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 50 [2025-03-03 15:11:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:39,443 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2025-03-03 15:11:39,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2025-03-03 15:11:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:11:39,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:39,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:11:39,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1568829930, now seen corresponding path program 1 times [2025-03-03 15:11:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206776625] [2025-03-03 15:11:39,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:39,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:11:39,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:11:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:39,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:39,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:39,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206776625] [2025-03-03 15:11:39,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206776625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:39,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285535590] [2025-03-03 15:11:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:39,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:39,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:39,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:39,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:39,673 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:39,989 INFO L93 Difference]: Finished difference Result 315 states and 397 transitions. [2025-03-03 15:11:39,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:11:39,989 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-03 15:11:39,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:39,990 INFO L225 Difference]: With dead ends: 315 [2025-03-03 15:11:39,990 INFO L226 Difference]: Without dead ends: 253 [2025-03-03 15:11:39,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:39,991 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 853 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:39,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 795 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:39,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-03 15:11:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 163. [2025-03-03 15:11:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.2564102564102564) internal successors, (196), 162 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 196 transitions. [2025-03-03 15:11:39,998 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 196 transitions. Word has length 50 [2025-03-03 15:11:39,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:39,998 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 196 transitions. [2025-03-03 15:11:39,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 196 transitions. [2025-03-03 15:11:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 15:11:40,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:40,001 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:11:40,001 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1237285421, now seen corresponding path program 1 times [2025-03-03 15:11:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052587548] [2025-03-03 15:11:40,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:40,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:40,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-03 15:11:40,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 15:11:40,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:40,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:40,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:40,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:40,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052587548] [2025-03-03 15:11:40,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052587548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:40,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:40,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:11:40,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245382557] [2025-03-03 15:11:40,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:40,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:40,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:40,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:40,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:40,441 INFO L87 Difference]: Start difference. First operand 163 states and 196 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:40,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:40,747 INFO L93 Difference]: Finished difference Result 294 states and 373 transitions. [2025-03-03 15:11:40,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:11:40,747 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 15:11:40,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:40,748 INFO L225 Difference]: With dead ends: 294 [2025-03-03 15:11:40,748 INFO L226 Difference]: Without dead ends: 239 [2025-03-03 15:11:40,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:11:40,749 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 494 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:40,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1035 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:40,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-03 15:11:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 151. [2025-03-03 15:11:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 145 states have (on average 1.2551724137931035) internal successors, (182), 150 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 182 transitions. [2025-03-03 15:11:40,754 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 182 transitions. Word has length 51 [2025-03-03 15:11:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:40,754 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 182 transitions. [2025-03-03 15:11:40,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:40,755 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 182 transitions. [2025-03-03 15:11:40,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:11:40,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:40,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:11:40,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1743475143, now seen corresponding path program 1 times [2025-03-03 15:11:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367721100] [2025-03-03 15:11:40,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:40,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:40,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:11:40,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:11:40,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:40,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367721100] [2025-03-03 15:11:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367721100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:41,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:41,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:11:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413333154] [2025-03-03 15:11:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:41,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:11:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:41,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:11:41,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:11:41,220 INFO L87 Difference]: Start difference. First operand 151 states and 182 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:41,774 INFO L93 Difference]: Finished difference Result 370 states and 472 transitions. [2025-03-03 15:11:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:11:41,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:11:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:41,776 INFO L225 Difference]: With dead ends: 370 [2025-03-03 15:11:41,776 INFO L226 Difference]: Without dead ends: 353 [2025-03-03 15:11:41,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:11:41,776 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 1063 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:41,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1831 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-03 15:11:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 134. [2025-03-03 15:11:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 133 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2025-03-03 15:11:41,782 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 52 [2025-03-03 15:11:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:41,782 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2025-03-03 15:11:41,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2025-03-03 15:11:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 15:11:41,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:41,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:41,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:11:41,782 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:41,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:41,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1772452267, now seen corresponding path program 1 times [2025-03-03 15:11:41,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:41,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404013446] [2025-03-03 15:11:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:41,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-03 15:11:41,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 15:11:41,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:41,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404013446] [2025-03-03 15:11:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404013446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:42,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:42,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:11:42,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545093356] [2025-03-03 15:11:42,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:42,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:11:42,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:42,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:11:42,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:11:42,207 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:42,636 INFO L93 Difference]: Finished difference Result 257 states and 330 transitions. [2025-03-03 15:11:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-03 15:11:42,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:42,637 INFO L225 Difference]: With dead ends: 257 [2025-03-03 15:11:42,637 INFO L226 Difference]: Without dead ends: 210 [2025-03-03 15:11:42,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:11:42,638 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 766 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:42,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 848 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:42,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-03-03 15:11:42,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 130. [2025-03-03 15:11:42,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 129 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2025-03-03 15:11:42,644 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 52 [2025-03-03 15:11:42,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:42,645 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2025-03-03 15:11:42,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:42,645 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2025-03-03 15:11:42,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:11:42,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:42,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:42,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:11:42,646 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:42,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -26755383, now seen corresponding path program 1 times [2025-03-03 15:11:42,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:42,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947835532] [2025-03-03 15:11:42,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:42,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:42,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:11:42,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:11:42,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:42,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:42,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947835532] [2025-03-03 15:11:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947835532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18418033] [2025-03-03 15:11:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:42,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:42,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:42,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:42,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:42,850 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:43,183 INFO L93 Difference]: Finished difference Result 266 states and 340 transitions. [2025-03-03 15:11:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:11:43,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 15:11:43,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:43,184 INFO L225 Difference]: With dead ends: 266 [2025-03-03 15:11:43,184 INFO L226 Difference]: Without dead ends: 203 [2025-03-03 15:11:43,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:11:43,185 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 479 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:43,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 688 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-03-03 15:11:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 130. [2025-03-03 15:11:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.236220472440945) internal successors, (157), 129 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 157 transitions. [2025-03-03 15:11:43,188 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 157 transitions. Word has length 54 [2025-03-03 15:11:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:43,188 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 157 transitions. [2025-03-03 15:11:43,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 157 transitions. [2025-03-03 15:11:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:11:43,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:43,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:43,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:11:43,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:43,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1664426215, now seen corresponding path program 1 times [2025-03-03 15:11:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536420451] [2025-03-03 15:11:43,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:43,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:11:43,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:11:43,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:43,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:43,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:43,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536420451] [2025-03-03 15:11:43,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536420451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:43,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:43,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:11:43,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156509807] [2025-03-03 15:11:43,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:43,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:11:43,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:43,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:11:43,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:11:43,347 INFO L87 Difference]: Start difference. First operand 130 states and 157 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:43,647 INFO L93 Difference]: Finished difference Result 220 states and 269 transitions. [2025-03-03 15:11:43,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:11:43,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-03-03 15:11:43,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:43,648 INFO L225 Difference]: With dead ends: 220 [2025-03-03 15:11:43,649 INFO L226 Difference]: Without dead ends: 212 [2025-03-03 15:11:43,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:11:43,649 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 479 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:43,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 784 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:11:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-03-03 15:11:43,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 130. [2025-03-03 15:11:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 127 states have (on average 1.2283464566929134) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2025-03-03 15:11:43,652 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 54 [2025-03-03 15:11:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:43,652 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2025-03-03 15:11:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2025-03-03 15:11:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:11:43,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:43,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:43,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:11:43,653 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:43,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:43,654 INFO L85 PathProgramCache]: Analyzing trace with hash 183904297, now seen corresponding path program 1 times [2025-03-03 15:11:43,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:43,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439630835] [2025-03-03 15:11:43,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:43,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:11:43,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:11:43,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:43,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:44,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:44,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439630835] [2025-03-03 15:11:44,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439630835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:44,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:44,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 15:11:44,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876387338] [2025-03-03 15:11:44,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:44,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 15:11:44,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:44,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 15:11:44,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:44,237 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:45,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:45,321 INFO L93 Difference]: Finished difference Result 354 states and 446 transitions. [2025-03-03 15:11:45,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:11:45,321 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 15:11:45,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:45,322 INFO L225 Difference]: With dead ends: 354 [2025-03-03 15:11:45,322 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 15:11:45,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:11:45,323 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 733 mSDsluCounter, 2577 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:45,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 2847 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:11:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 15:11:45,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 143. [2025-03-03 15:11:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 140 states have (on average 1.2285714285714286) internal successors, (172), 142 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 172 transitions. [2025-03-03 15:11:45,327 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 172 transitions. Word has length 56 [2025-03-03 15:11:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:45,328 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 172 transitions. [2025-03-03 15:11:45,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 172 transitions. [2025-03-03 15:11:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 15:11:45,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:45,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:45,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:11:45,328 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1491865894, now seen corresponding path program 1 times [2025-03-03 15:11:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316443549] [2025-03-03 15:11:45,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 15:11:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 15:11:45,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:45,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:45,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316443549] [2025-03-03 15:11:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316443549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-03 15:11:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85138619] [2025-03-03 15:11:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 15:11:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:45,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 15:11:45,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:11:45,832 INFO L87 Difference]: Start difference. First operand 143 states and 172 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:46,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:46,733 INFO L93 Difference]: Finished difference Result 357 states and 448 transitions. [2025-03-03 15:11:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:11:46,733 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 15:11:46,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:46,734 INFO L225 Difference]: With dead ends: 357 [2025-03-03 15:11:46,734 INFO L226 Difference]: Without dead ends: 348 [2025-03-03 15:11:46,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:11:46,735 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 849 mSDsluCounter, 2321 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:46,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 2616 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:11:46,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-03 15:11:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 149. [2025-03-03 15:11:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 146 states have (on average 1.2191780821917808) internal successors, (178), 148 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 178 transitions. [2025-03-03 15:11:46,739 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 178 transitions. Word has length 56 [2025-03-03 15:11:46,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:46,739 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 178 transitions. [2025-03-03 15:11:46,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 178 transitions. [2025-03-03 15:11:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:11:46,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:46,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:46,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:11:46,740 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:46,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:46,740 INFO L85 PathProgramCache]: Analyzing trace with hash -534447948, now seen corresponding path program 1 times [2025-03-03 15:11:46,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:46,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016224025] [2025-03-03 15:11:46,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:46,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:46,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:11:46,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:11:46,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:46,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:47,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016224025] [2025-03-03 15:11:47,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016224025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:11:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627243482] [2025-03-03 15:11:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:11:47,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:11:47,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:11:47,010 INFO L87 Difference]: Start difference. First operand 149 states and 178 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,316 INFO L93 Difference]: Finished difference Result 217 states and 268 transitions. [2025-03-03 15:11:47,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:11:47,317 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 15:11:47,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,318 INFO L225 Difference]: With dead ends: 217 [2025-03-03 15:11:47,318 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 15:11:47,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2025-03-03 15:11:47,319 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 432 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 879 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 15:11:47,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 130. [2025-03-03 15:11:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 128 states have (on average 1.21875) internal successors, (156), 129 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 156 transitions. [2025-03-03 15:11:47,323 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 156 transitions. Word has length 57 [2025-03-03 15:11:47,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,323 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 156 transitions. [2025-03-03 15:11:47,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 156 transitions. [2025-03-03 15:11:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 15:11:47,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:47,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:11:47,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:47,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1349939345, now seen corresponding path program 1 times [2025-03-03 15:11:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782817861] [2025-03-03 15:11:47,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 15:11:47,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 15:11:47,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:47,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782817861] [2025-03-03 15:11:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782817861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 15:11:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786124139] [2025-03-03 15:11:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:11:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:11:47,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:11:47,591 INFO L87 Difference]: Start difference. First operand 130 states and 156 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,819 INFO L93 Difference]: Finished difference Result 181 states and 227 transitions. [2025-03-03 15:11:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 15:11:47,819 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-03 15:11:47,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,820 INFO L225 Difference]: With dead ends: 181 [2025-03-03 15:11:47,820 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 15:11:47,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:11:47,820 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 748 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 463 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:11:47,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 15:11:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 104. [2025-03-03 15:11:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.2427184466019416) internal successors, (128), 103 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2025-03-03 15:11:47,824 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 57 [2025-03-03 15:11:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,824 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2025-03-03 15:11:47,824 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2025-03-03 15:11:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:11:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:47,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:11:47,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:47,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash -511836541, now seen corresponding path program 1 times [2025-03-03 15:11:47,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623104684] [2025-03-03 15:11:47,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:11:47,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:11:47,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623104684] [2025-03-03 15:11:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623104684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:47,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095096915] [2025-03-03 15:11:47,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:47,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:47,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:47,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:47,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:47,881 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:47,936 INFO L93 Difference]: Finished difference Result 362 states and 506 transitions. [2025-03-03 15:11:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:11:47,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:11:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:47,938 INFO L225 Difference]: With dead ends: 362 [2025-03-03 15:11:47,938 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 15:11:47,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:11:47,939 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 436 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:47,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 647 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 15:11:47,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 145. [2025-03-03 15:11:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.3055555555555556) internal successors, (188), 144 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2025-03-03 15:11:47,944 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 75 [2025-03-03 15:11:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:47,944 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2025-03-03 15:11:47,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2025-03-03 15:11:47,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:47,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:47,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:47,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:11:47,945 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:47,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:47,945 INFO L85 PathProgramCache]: Analyzing trace with hash 959876167, now seen corresponding path program 1 times [2025-03-03 15:11:47,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:47,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041938497] [2025-03-03 15:11:47,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:47,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:47,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:47,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:47,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:47,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041938497] [2025-03-03 15:11:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041938497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874462815] [2025-03-03 15:11:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:48,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:48,010 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,056 INFO L93 Difference]: Finished difference Result 440 states and 618 transitions. [2025-03-03 15:11:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,058 INFO L225 Difference]: With dead ends: 440 [2025-03-03 15:11:48,058 INFO L226 Difference]: Without dead ends: 356 [2025-03-03 15:11:48,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:48,059 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 282 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 471 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-03 15:11:48,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 227. [2025-03-03 15:11:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.3672566371681416) internal successors, (309), 226 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 309 transitions. [2025-03-03 15:11:48,067 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 309 transitions. Word has length 77 [2025-03-03 15:11:48,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,067 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 309 transitions. [2025-03-03 15:11:48,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 309 transitions. [2025-03-03 15:11:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:48,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:11:48,068 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,069 INFO L85 PathProgramCache]: Analyzing trace with hash -344601401, now seen corresponding path program 1 times [2025-03-03 15:11:48,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251289915] [2025-03-03 15:11:48,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:48,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:48,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251289915] [2025-03-03 15:11:48,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251289915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373209376] [2025-03-03 15:11:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:48,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:48,137 INFO L87 Difference]: Start difference. First operand 227 states and 309 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,182 INFO L93 Difference]: Finished difference Result 522 states and 739 transitions. [2025-03-03 15:11:48,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:48,183 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,184 INFO L225 Difference]: With dead ends: 522 [2025-03-03 15:11:48,184 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 15:11:48,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:48,185 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 282 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 441 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 15:11:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 350. [2025-03-03 15:11:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.4040114613180517) internal successors, (490), 349 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 490 transitions. [2025-03-03 15:11:48,193 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 490 transitions. Word has length 77 [2025-03-03 15:11:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,193 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 490 transitions. [2025-03-03 15:11:48,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 490 transitions. [2025-03-03 15:11:48,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:48,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:11:48,195 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -889205433, now seen corresponding path program 1 times [2025-03-03 15:11:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10506860] [2025-03-03 15:11:48,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:48,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:48,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10506860] [2025-03-03 15:11:48,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10506860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:11:48,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037107161] [2025-03-03 15:11:48,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:11:48,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:11:48,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:11:48,260 INFO L87 Difference]: Start difference. First operand 350 states and 490 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,306 INFO L93 Difference]: Finished difference Result 604 states and 860 transitions. [2025-03-03 15:11:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:11:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:48,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,307 INFO L225 Difference]: With dead ends: 604 [2025-03-03 15:11:48,307 INFO L226 Difference]: Without dead ends: 520 [2025-03-03 15:11:48,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:11:48,308 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 291 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 455 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-03-03 15:11:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 432. [2025-03-03 15:11:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 1.4176334106728539) internal successors, (611), 431 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 611 transitions. [2025-03-03 15:11:48,316 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 611 transitions. Word has length 77 [2025-03-03 15:11:48,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,316 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 611 transitions. [2025-03-03 15:11:48,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 611 transitions. [2025-03-03 15:11:48,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:48,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,317 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:11:48,317 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,318 INFO L85 PathProgramCache]: Analyzing trace with hash -851768869, now seen corresponding path program 1 times [2025-03-03 15:11:48,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804639043] [2025-03-03 15:11:48,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:48,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:48,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804639043] [2025-03-03 15:11:48,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804639043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687546159] [2025-03-03 15:11:48,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,348 INFO L87 Difference]: Start difference. First operand 432 states and 611 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,367 INFO L93 Difference]: Finished difference Result 1116 states and 1601 transitions. [2025-03-03 15:11:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,371 INFO L225 Difference]: With dead ends: 1116 [2025-03-03 15:11:48,371 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 15:11:48,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,373 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 50 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 287 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 15:11:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 743. [2025-03-03 15:11:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.3962264150943395) internal successors, (1036), 742 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1036 transitions. [2025-03-03 15:11:48,389 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1036 transitions. Word has length 77 [2025-03-03 15:11:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,389 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1036 transitions. [2025-03-03 15:11:48,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1036 transitions. [2025-03-03 15:11:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:11:48,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:11:48,390 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,391 INFO L85 PathProgramCache]: Analyzing trace with hash -816675071, now seen corresponding path program 1 times [2025-03-03 15:11:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029346555] [2025-03-03 15:11:48,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:11:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:11:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029346555] [2025-03-03 15:11:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029346555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755903542] [2025-03-03 15:11:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,427 INFO L87 Difference]: Start difference. First operand 743 states and 1036 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,448 INFO L93 Difference]: Finished difference Result 1427 states and 2008 transitions. [2025-03-03 15:11:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:11:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,451 INFO L225 Difference]: With dead ends: 1427 [2025-03-03 15:11:48,451 INFO L226 Difference]: Without dead ends: 745 [2025-03-03 15:11:48,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,452 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 201 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-03 15:11:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 743. [2025-03-03 15:11:48,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 742 states have (on average 1.389487870619946) internal successors, (1031), 742 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1031 transitions. [2025-03-03 15:11:48,467 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1031 transitions. Word has length 77 [2025-03-03 15:11:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,467 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1031 transitions. [2025-03-03 15:11:48,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,468 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1031 transitions. [2025-03-03 15:11:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:11:48,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:11:48,468 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash -480325410, now seen corresponding path program 1 times [2025-03-03 15:11:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359420985] [2025-03-03 15:11:48,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:11:48,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:11:48,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359420985] [2025-03-03 15:11:48,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359420985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995929742] [2025-03-03 15:11:48,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,542 INFO L87 Difference]: Start difference. First operand 743 states and 1031 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,563 INFO L93 Difference]: Finished difference Result 1864 states and 2602 transitions. [2025-03-03 15:11:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:11:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,568 INFO L225 Difference]: With dead ends: 1864 [2025-03-03 15:11:48,568 INFO L226 Difference]: Without dead ends: 1182 [2025-03-03 15:11:48,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,570 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 59 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 267 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2025-03-03 15:11:48,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1108. [2025-03-03 15:11:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1107 states have (on average 1.3794037940379404) internal successors, (1527), 1107 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1527 transitions. [2025-03-03 15:11:48,590 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1527 transitions. Word has length 78 [2025-03-03 15:11:48,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,592 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1527 transitions. [2025-03-03 15:11:48,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1527 transitions. [2025-03-03 15:11:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:11:48,592 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:11:48,593 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1750163539, now seen corresponding path program 1 times [2025-03-03 15:11:48,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603322241] [2025-03-03 15:11:48,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:11:48,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:11:48,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603322241] [2025-03-03 15:11:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603322241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40830188] [2025-03-03 15:11:48,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,636 INFO L87 Difference]: Start difference. First operand 1108 states and 1527 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,658 INFO L93 Difference]: Finished difference Result 2198 states and 3047 transitions. [2025-03-03 15:11:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:11:48,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,661 INFO L225 Difference]: With dead ends: 2198 [2025-03-03 15:11:48,661 INFO L226 Difference]: Without dead ends: 1151 [2025-03-03 15:11:48,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,663 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 202 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2025-03-03 15:11:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1149. [2025-03-03 15:11:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.363240418118467) internal successors, (1565), 1148 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1565 transitions. [2025-03-03 15:11:48,683 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1565 transitions. Word has length 79 [2025-03-03 15:11:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,683 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1565 transitions. [2025-03-03 15:11:48,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1565 transitions. [2025-03-03 15:11:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:11:48,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:11:48,686 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1575106707, now seen corresponding path program 1 times [2025-03-03 15:11:48,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017811951] [2025-03-03 15:11:48,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:11:48,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:11:48,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017811951] [2025-03-03 15:11:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017811951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48775223] [2025-03-03 15:11:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,740 INFO L87 Difference]: Start difference. First operand 1149 states and 1565 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,766 INFO L93 Difference]: Finished difference Result 3213 states and 4369 transitions. [2025-03-03 15:11:48,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:11:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,772 INFO L225 Difference]: With dead ends: 3213 [2025-03-03 15:11:48,772 INFO L226 Difference]: Without dead ends: 2125 [2025-03-03 15:11:48,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,774 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 52 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2025-03-03 15:11:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2011. [2025-03-03 15:11:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2011 states, 2010 states have (on average 1.3432835820895523) internal successors, (2700), 2010 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 2700 transitions. [2025-03-03 15:11:48,809 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 2700 transitions. Word has length 79 [2025-03-03 15:11:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,809 INFO L471 AbstractCegarLoop]: Abstraction has 2011 states and 2700 transitions. [2025-03-03 15:11:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 2700 transitions. [2025-03-03 15:11:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:11:48,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:11:48,811 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1209814900, now seen corresponding path program 1 times [2025-03-03 15:11:48,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647331162] [2025-03-03 15:11:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:48,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:11:48,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:11:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647331162] [2025-03-03 15:11:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647331162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:11:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719781698] [2025-03-03 15:11:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:48,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:11:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:48,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:11:48,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,886 INFO L87 Difference]: Start difference. First operand 2011 states and 2700 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:48,913 INFO L93 Difference]: Finished difference Result 5687 states and 7578 transitions. [2025-03-03 15:11:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:11:48,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:11:48,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:48,922 INFO L225 Difference]: With dead ends: 5687 [2025-03-03 15:11:48,922 INFO L226 Difference]: Without dead ends: 3737 [2025-03-03 15:11:48,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:11:48,924 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:48,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2025-03-03 15:11:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3511. [2025-03-03 15:11:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 3510 states have (on average 1.3122507122507123) internal successors, (4606), 3510 states have internal predecessors, (4606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 4606 transitions. [2025-03-03 15:11:48,993 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 4606 transitions. Word has length 80 [2025-03-03 15:11:48,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:48,993 INFO L471 AbstractCegarLoop]: Abstraction has 3511 states and 4606 transitions. [2025-03-03 15:11:48,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 4606 transitions. [2025-03-03 15:11:48,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:11:48,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:48,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:11:48,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:11:48,994 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:48,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2036109121, now seen corresponding path program 1 times [2025-03-03 15:11:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405279635] [2025-03-03 15:11:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:49,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:11:49,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:11:49,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:49,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405279635] [2025-03-03 15:11:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405279635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:11:49,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:11:49,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:11:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739506810] [2025-03-03 15:11:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:11:49,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:11:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:49,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:11:49,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:11:49,129 INFO L87 Difference]: Start difference. First operand 3511 states and 4606 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:49,160 INFO L93 Difference]: Finished difference Result 3609 states and 4735 transitions. [2025-03-03 15:11:49,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:11:49,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:11:49,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:49,169 INFO L225 Difference]: With dead ends: 3609 [2025-03-03 15:11:49,170 INFO L226 Difference]: Without dead ends: 3607 [2025-03-03 15:11:49,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:11:49,171 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:49,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 603 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:11:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3607 states. [2025-03-03 15:11:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3607 to 3607. [2025-03-03 15:11:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3607 states, 3606 states have (on average 1.2928452579034941) internal successors, (4662), 3606 states have internal predecessors, (4662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:49,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3607 states to 3607 states and 4662 transitions. [2025-03-03 15:11:49,232 INFO L78 Accepts]: Start accepts. Automaton has 3607 states and 4662 transitions. Word has length 81 [2025-03-03 15:11:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:49,232 INFO L471 AbstractCegarLoop]: Abstraction has 3607 states and 4662 transitions. [2025-03-03 15:11:49,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 3607 states and 4662 transitions. [2025-03-03 15:11:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:11:49,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:49,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:11:49,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:11:49,234 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:49,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:49,235 INFO L85 PathProgramCache]: Analyzing trace with hash -933750219, now seen corresponding path program 1 times [2025-03-03 15:11:49,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758066688] [2025-03-03 15:11:49,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:49,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:49,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:11:49,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:11:49,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:49,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:49,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758066688] [2025-03-03 15:11:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758066688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858843882] [2025-03-03 15:11:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:49,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:49,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:49,520 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-03 15:11:49,522 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-03 15:11:49,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:11:49,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:11:49,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:49,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:49,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:11:49,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:50,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858843882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:51,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:51,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 29 [2025-03-03 15:11:51,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933980191] [2025-03-03 15:11:51,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:11:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:11:51,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:11:51,418 INFO L87 Difference]: Start difference. First operand 3607 states and 4662 transitions. Second operand has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 29 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:55,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:55,042 INFO L93 Difference]: Finished difference Result 33524 states and 43334 transitions. [2025-03-03 15:11:55,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-03 15:11:55,043 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 29 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 15:11:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:11:55,136 INFO L225 Difference]: With dead ends: 33524 [2025-03-03 15:11:55,136 INFO L226 Difference]: Without dead ends: 29978 [2025-03-03 15:11:55,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7141 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3290, Invalid=18466, Unknown=0, NotChecked=0, Total=21756 [2025-03-03 15:11:55,146 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 2135 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2135 SdHoareTripleChecker+Valid, 2277 SdHoareTripleChecker+Invalid, 2364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:11:55,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2135 Valid, 2277 Invalid, 2364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 15:11:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29978 states. [2025-03-03 15:11:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29978 to 18932. [2025-03-03 15:11:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18932 states, 18931 states have (on average 1.2860387723839206) internal successors, (24346), 18931 states have internal predecessors, (24346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:55,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18932 states to 18932 states and 24346 transitions. [2025-03-03 15:11:55,455 INFO L78 Accepts]: Start accepts. Automaton has 18932 states and 24346 transitions. Word has length 103 [2025-03-03 15:11:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:11:55,455 INFO L471 AbstractCegarLoop]: Abstraction has 18932 states and 24346 transitions. [2025-03-03 15:11:55,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 29 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:55,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18932 states and 24346 transitions. [2025-03-03 15:11:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:11:55,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:11:55,459 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:11:55,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 15:11:55,664 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,SelfDestructingSolverStorable26 [2025-03-03 15:11:55,664 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:11:55,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:11:55,669 INFO L85 PathProgramCache]: Analyzing trace with hash -244196588, now seen corresponding path program 1 times [2025-03-03 15:11:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:11:55,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280014700] [2025-03-03 15:11:55,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:55,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:11:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:11:55,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:11:55,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:55,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:56,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:11:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280014700] [2025-03-03 15:11:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280014700] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:11:56,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328352899] [2025-03-03 15:11:56,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:11:56,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:11:56,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:11:56,100 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-03 15:11:56,102 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-03 15:11:56,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:11:56,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:11:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:11:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:11:56,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 15:11:56,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:11:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:56,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:11:57,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:11:57,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328352899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:11:57,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:11:57,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 10] total 34 [2025-03-03 15:11:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028987968] [2025-03-03 15:11:57,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:11:57,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 15:11:57,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:11:57,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 15:11:57,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1024, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:11:57,193 INFO L87 Difference]: Start difference. First operand 18932 states and 24346 transitions. Second operand has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:11:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:11:59,959 INFO L93 Difference]: Finished difference Result 65925 states and 85149 transitions. [2025-03-03 15:11:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 15:11:59,959 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 15:11:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:00,022 INFO L225 Difference]: With dead ends: 65925 [2025-03-03 15:12:00,023 INFO L226 Difference]: Without dead ends: 47084 [2025-03-03 15:12:00,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4187 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1904, Invalid=13102, Unknown=0, NotChecked=0, Total=15006 [2025-03-03 15:12:00,051 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 2272 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 5138 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:00,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 5138 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:12:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47084 states. [2025-03-03 15:12:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47084 to 30442. [2025-03-03 15:12:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30442 states, 30441 states have (on average 1.2860287112775532) internal successors, (39148), 30441 states have internal predecessors, (39148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30442 states to 30442 states and 39148 transitions. [2025-03-03 15:12:00,491 INFO L78 Accepts]: Start accepts. Automaton has 30442 states and 39148 transitions. Word has length 104 [2025-03-03 15:12:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:00,491 INFO L471 AbstractCegarLoop]: Abstraction has 30442 states and 39148 transitions. [2025-03-03 15:12:00,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.235294117647058) internal successors, (280), 34 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 30442 states and 39148 transitions. [2025-03-03 15:12:00,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 15:12:00,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:00,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:00,502 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-03 15:12:00,696 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,SelfDestructingSolverStorable27 [2025-03-03 15:12:00,696 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:00,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash 471359311, now seen corresponding path program 1 times [2025-03-03 15:12:00,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:00,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351514246] [2025-03-03 15:12:00,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:00,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:00,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:12:00,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:12:00,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:00,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:00,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351514246] [2025-03-03 15:12:00,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351514246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:00,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578856333] [2025-03-03 15:12:00,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:00,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:00,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:00,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:12:01,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 15:12:01,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 15:12:01,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:01,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:01,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:12:01,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:01,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:02,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:02,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578856333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:02,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:02,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2025-03-03 15:12:02,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111256857] [2025-03-03 15:12:02,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:02,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 15:12:02,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:02,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 15:12:02,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:12:02,138 INFO L87 Difference]: Start difference. First operand 30442 states and 39148 transitions. Second operand has 24 states, 24 states have (on average 11.625) internal successors, (279), 24 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:05,242 INFO L93 Difference]: Finished difference Result 79758 states and 102702 transitions. [2025-03-03 15:12:05,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-03 15:12:05,243 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 11.625) internal successors, (279), 24 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-03-03 15:12:05,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:05,331 INFO L225 Difference]: With dead ends: 79758 [2025-03-03 15:12:05,331 INFO L226 Difference]: Without dead ends: 76212 [2025-03-03 15:12:05,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5637 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2506, Invalid=14006, Unknown=0, NotChecked=0, Total=16512 [2025-03-03 15:12:05,358 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 2610 mSDsluCounter, 1417 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:05,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 1542 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:12:05,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76212 states. [2025-03-03 15:12:05,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76212 to 40539. [2025-03-03 15:12:05,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40539 states, 40538 states have (on average 1.2848191820020722) internal successors, (52084), 40538 states have internal predecessors, (52084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:05,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40539 states to 40539 states and 52084 transitions. [2025-03-03 15:12:05,944 INFO L78 Accepts]: Start accepts. Automaton has 40539 states and 52084 transitions. Word has length 104 [2025-03-03 15:12:05,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:05,945 INFO L471 AbstractCegarLoop]: Abstraction has 40539 states and 52084 transitions. [2025-03-03 15:12:05,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 11.625) internal successors, (279), 24 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 40539 states and 52084 transitions. [2025-03-03 15:12:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:12:05,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:05,950 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:05,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 15:12:06,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 15:12:06,154 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:06,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:06,154 INFO L85 PathProgramCache]: Analyzing trace with hash -697453547, now seen corresponding path program 1 times [2025-03-03 15:12:06,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:06,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044654720] [2025-03-03 15:12:06,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:06,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:06,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:06,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:06,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:06,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:06,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 15:12:06,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:06,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044654720] [2025-03-03 15:12:06,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044654720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:06,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:06,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499370776] [2025-03-03 15:12:06,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:06,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:06,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:06,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:06,194 INFO L87 Difference]: Start difference. First operand 40539 states and 52084 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:06,332 INFO L93 Difference]: Finished difference Result 72809 states and 93765 transitions. [2025-03-03 15:12:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:06,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:12:06,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:06,374 INFO L225 Difference]: With dead ends: 72809 [2025-03-03 15:12:06,375 INFO L226 Difference]: Without dead ends: 32384 [2025-03-03 15:12:06,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:06,407 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 88 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:06,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 142 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32384 states. [2025-03-03 15:12:06,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32384 to 32384. [2025-03-03 15:12:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32384 states, 32383 states have (on average 1.2662816910107155) internal successors, (41006), 32383 states have internal predecessors, (41006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32384 states to 32384 states and 41006 transitions. [2025-03-03 15:12:06,831 INFO L78 Accepts]: Start accepts. Automaton has 32384 states and 41006 transitions. Word has length 105 [2025-03-03 15:12:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 32384 states and 41006 transitions. [2025-03-03 15:12:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32384 states and 41006 transitions. [2025-03-03 15:12:06,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:12:06,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:06,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:06,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:12:06,836 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:06,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -365896499, now seen corresponding path program 1 times [2025-03-03 15:12:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570662823] [2025-03-03 15:12:06,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:06,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:06,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:06,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:06,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:12:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:06,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570662823] [2025-03-03 15:12:06,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570662823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:06,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:06,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:06,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074074487] [2025-03-03 15:12:06,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:06,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:06,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:06,870 INFO L87 Difference]: Start difference. First operand 32384 states and 41006 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:07,126 INFO L93 Difference]: Finished difference Result 59883 states and 75978 transitions. [2025-03-03 15:12:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:12:07,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:07,162 INFO L225 Difference]: With dead ends: 59883 [2025-03-03 15:12:07,162 INFO L226 Difference]: Without dead ends: 27613 [2025-03-03 15:12:07,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:07,182 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:07,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 104 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:07,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27613 states. [2025-03-03 15:12:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27613 to 27613. [2025-03-03 15:12:07,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27613 states, 27612 states have (on average 1.254780530204259) internal successors, (34647), 27612 states have internal predecessors, (34647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27613 states to 27613 states and 34647 transitions. [2025-03-03 15:12:07,609 INFO L78 Accepts]: Start accepts. Automaton has 27613 states and 34647 transitions. Word has length 105 [2025-03-03 15:12:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:07,609 INFO L471 AbstractCegarLoop]: Abstraction has 27613 states and 34647 transitions. [2025-03-03 15:12:07,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:07,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27613 states and 34647 transitions. [2025-03-03 15:12:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:12:07,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:07,612 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:07,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:12:07,612 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:07,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:07,613 INFO L85 PathProgramCache]: Analyzing trace with hash 871960270, now seen corresponding path program 1 times [2025-03-03 15:12:07,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:07,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012934452] [2025-03-03 15:12:07,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:07,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:07,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:07,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:07,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:07,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012934452] [2025-03-03 15:12:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012934452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802617269] [2025-03-03 15:12:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:07,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:07,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:07,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:07,667 INFO L87 Difference]: Start difference. First operand 27613 states and 34647 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:07,840 INFO L93 Difference]: Finished difference Result 55111 states and 69169 transitions. [2025-03-03 15:12:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:12:07,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:07,868 INFO L225 Difference]: With dead ends: 55111 [2025-03-03 15:12:07,869 INFO L226 Difference]: Without dead ends: 27615 [2025-03-03 15:12:07,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:07,880 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 53 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:07,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27615 states. [2025-03-03 15:12:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27615 to 27613. [2025-03-03 15:12:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27613 states, 27612 states have (on average 1.2297551789077212) internal successors, (33956), 27612 states have internal predecessors, (33956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27613 states to 27613 states and 33956 transitions. [2025-03-03 15:12:08,107 INFO L78 Accepts]: Start accepts. Automaton has 27613 states and 33956 transitions. Word has length 105 [2025-03-03 15:12:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:08,107 INFO L471 AbstractCegarLoop]: Abstraction has 27613 states and 33956 transitions. [2025-03-03 15:12:08,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 27613 states and 33956 transitions. [2025-03-03 15:12:08,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:12:08,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:08,109 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:08,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:12:08,110 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:08,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:08,110 INFO L85 PathProgramCache]: Analyzing trace with hash -358987775, now seen corresponding path program 1 times [2025-03-03 15:12:08,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:08,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822980669] [2025-03-03 15:12:08,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:08,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:08,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:08,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:08,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:08,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:08,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:08,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822980669] [2025-03-03 15:12:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822980669] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618156887] [2025-03-03 15:12:08,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:08,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:08,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:08,471 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:08,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:12:08,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:12:08,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:12:08,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:08,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:08,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 15:12:08,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 15:12:08,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:12:08,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618156887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:08,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:12:08,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-03 15:12:08,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929153928] [2025-03-03 15:12:08,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:08,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:12:08,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:08,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:12:08,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:12:08,840 INFO L87 Difference]: Start difference. First operand 27613 states and 33956 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:09,140 INFO L93 Difference]: Finished difference Result 75834 states and 93344 transitions. [2025-03-03 15:12:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:12:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-03-03 15:12:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:09,187 INFO L225 Difference]: With dead ends: 75834 [2025-03-03 15:12:09,187 INFO L226 Difference]: Without dead ends: 48314 [2025-03-03 15:12:09,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:12:09,209 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 252 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 466 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:12:09,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48314 states. [2025-03-03 15:12:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48314 to 27613. [2025-03-03 15:12:09,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27613 states, 27612 states have (on average 1.229646530493988) internal successors, (33953), 27612 states have internal predecessors, (33953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27613 states to 27613 states and 33953 transitions. [2025-03-03 15:12:09,580 INFO L78 Accepts]: Start accepts. Automaton has 27613 states and 33953 transitions. Word has length 105 [2025-03-03 15:12:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:09,580 INFO L471 AbstractCegarLoop]: Abstraction has 27613 states and 33953 transitions. [2025-03-03 15:12:09,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 8 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 27613 states and 33953 transitions. [2025-03-03 15:12:09,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 15:12:09,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:09,581 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:09,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 15:12:09,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:09,783 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:09,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:09,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1492803597, now seen corresponding path program 1 times [2025-03-03 15:12:09,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:09,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613905694] [2025-03-03 15:12:09,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:09,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:09,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:09,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:09,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:10,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613905694] [2025-03-03 15:12:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613905694] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614488376] [2025-03-03 15:12:10,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:10,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:10,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:10,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:10,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:12:10,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 15:12:10,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 15:12:10,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:10,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:10,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:12:10,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:10,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:11,824 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614488376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:11,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-03 15:12:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968458495] [2025-03-03 15:12:11,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:11,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-03 15:12:11,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:11,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-03 15:12:11,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-03-03 15:12:11,826 INFO L87 Difference]: Start difference. First operand 27613 states and 33953 transitions. Second operand has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:12,688 INFO L93 Difference]: Finished difference Result 50199 states and 61724 transitions. [2025-03-03 15:12:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:12:12,689 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-03 15:12:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:12,724 INFO L225 Difference]: With dead ends: 50199 [2025-03-03 15:12:12,724 INFO L226 Difference]: Without dead ends: 39249 [2025-03-03 15:12:12,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 15:12:12,737 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 986 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:12,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1062 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:12:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39249 states. [2025-03-03 15:12:13,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39249 to 38561. [2025-03-03 15:12:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38561 states, 38560 states have (on average 1.2303163900414937) internal successors, (47441), 38560 states have internal predecessors, (47441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38561 states to 38561 states and 47441 transitions. [2025-03-03 15:12:13,067 INFO L78 Accepts]: Start accepts. Automaton has 38561 states and 47441 transitions. Word has length 106 [2025-03-03 15:12:13,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:13,067 INFO L471 AbstractCegarLoop]: Abstraction has 38561 states and 47441 transitions. [2025-03-03 15:12:13,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.206896551724139) internal successors, (267), 28 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:13,068 INFO L276 IsEmpty]: Start isEmpty. Operand 38561 states and 47441 transitions. [2025-03-03 15:12:13,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:12:13,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:13,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:13,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-03 15:12:13,270 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:13,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:13,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1012762444, now seen corresponding path program 1 times [2025-03-03 15:12:13,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:13,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616953477] [2025-03-03 15:12:13,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:13,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:13,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:13,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:13,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:13,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616953477] [2025-03-03 15:12:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616953477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296778296] [2025-03-03 15:12:13,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:13,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:13,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:14,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:14,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:12:14,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:14,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:14,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:14,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:14,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 15:12:14,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:16,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296778296] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:17,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 50 [2025-03-03 15:12:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249915643] [2025-03-03 15:12:17,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:17,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 15:12:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:17,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 15:12:17,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2281, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 15:12:17,672 INFO L87 Difference]: Start difference. First operand 38561 states and 47441 transitions. Second operand has 50 states, 50 states have (on average 5.92) internal successors, (296), 50 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:25,407 INFO L93 Difference]: Finished difference Result 185080 states and 229210 transitions. [2025-03-03 15:12:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-03-03 15:12:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.92) internal successors, (296), 50 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:12:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:25,566 INFO L225 Difference]: With dead ends: 185080 [2025-03-03 15:12:25,566 INFO L226 Difference]: Without dead ends: 163182 [2025-03-03 15:12:25,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3811 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1862, Invalid=14908, Unknown=0, NotChecked=0, Total=16770 [2025-03-03 15:12:25,612 INFO L435 NwaCegarLoop]: 458 mSDtfsCounter, 2737 mSDsluCounter, 12422 mSDsCounter, 0 mSdLazyCounter, 6695 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2737 SdHoareTripleChecker+Valid, 12880 SdHoareTripleChecker+Invalid, 6713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:25,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2737 Valid, 12880 Invalid, 6713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6695 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-03 15:12:25,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163182 states. [2025-03-03 15:12:26,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163182 to 87817. [2025-03-03 15:12:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87817 states, 87816 states have (on average 1.2373485469618293) internal successors, (108659), 87816 states have internal predecessors, (108659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:26,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87817 states to 87817 states and 108659 transitions. [2025-03-03 15:12:26,794 INFO L78 Accepts]: Start accepts. Automaton has 87817 states and 108659 transitions. Word has length 107 [2025-03-03 15:12:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 87817 states and 108659 transitions. [2025-03-03 15:12:26,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.92) internal successors, (296), 50 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 87817 states and 108659 transitions. [2025-03-03 15:12:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:12:26,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:26,797 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:26,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 15:12:26,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:26,997 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:26,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:26,998 INFO L85 PathProgramCache]: Analyzing trace with hash -940232082, now seen corresponding path program 1 times [2025-03-03 15:12:26,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:26,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824829415] [2025-03-03 15:12:26,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:26,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:27,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:27,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:27,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:27,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824829415] [2025-03-03 15:12:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824829415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822863215] [2025-03-03 15:12:27,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:27,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:27,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:27,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:27,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:12:27,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:27,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:27,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:27,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:27,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 15:12:27,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:27,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822863215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:28,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:28,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-03 15:12:28,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793908600] [2025-03-03 15:12:28,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 15:12:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:28,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 15:12:28,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2025-03-03 15:12:28,761 INFO L87 Difference]: Start difference. First operand 87817 states and 108659 transitions. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 27 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:29,548 INFO L93 Difference]: Finished difference Result 211357 states and 261345 transitions. [2025-03-03 15:12:29,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:12:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 27 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:12:29,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:29,691 INFO L225 Difference]: With dead ends: 211357 [2025-03-03 15:12:29,691 INFO L226 Difference]: Without dead ends: 143255 [2025-03-03 15:12:29,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=436, Invalid=1544, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 15:12:29,744 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 960 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 960 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:29,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [960 Valid, 914 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:12:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143255 states. [2025-03-03 15:12:30,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143255 to 124857. [2025-03-03 15:12:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124857 states, 124856 states have (on average 1.230986095982572) internal successors, (153696), 124856 states have internal predecessors, (153696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124857 states to 124857 states and 153696 transitions. [2025-03-03 15:12:31,261 INFO L78 Accepts]: Start accepts. Automaton has 124857 states and 153696 transitions. Word has length 107 [2025-03-03 15:12:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:31,261 INFO L471 AbstractCegarLoop]: Abstraction has 124857 states and 153696 transitions. [2025-03-03 15:12:31,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 27 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 124857 states and 153696 transitions. [2025-03-03 15:12:31,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:12:31,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:31,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:31,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 15:12:31,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:31,471 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:31,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash 390540777, now seen corresponding path program 1 times [2025-03-03 15:12:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:31,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551925503] [2025-03-03 15:12:31,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:31,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:31,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:31,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:31,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:31,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551925503] [2025-03-03 15:12:31,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551925503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:31,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541635643] [2025-03-03 15:12:31,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:31,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:31,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:31,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:31,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:12:31,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:12:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:12:31,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:31,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:31,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 15:12:31,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:33,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541635643] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:34,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 38 [2025-03-03 15:12:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891429194] [2025-03-03 15:12:34,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 15:12:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:34,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 15:12:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 15:12:34,400 INFO L87 Difference]: Start difference. First operand 124857 states and 153696 transitions. Second operand has 39 states, 39 states have (on average 7.846153846153846) internal successors, (306), 38 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:42,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:42,329 INFO L93 Difference]: Finished difference Result 334545 states and 410776 transitions. [2025-03-03 15:12:42,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2025-03-03 15:12:42,329 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 7.846153846153846) internal successors, (306), 38 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-03 15:12:42,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:42,684 INFO L225 Difference]: With dead ends: 334545 [2025-03-03 15:12:42,684 INFO L226 Difference]: Without dead ends: 282195 [2025-03-03 15:12:42,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15954 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6070, Invalid=35342, Unknown=0, NotChecked=0, Total=41412 [2025-03-03 15:12:42,737 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 2285 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:42,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 2473 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 15:12:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282195 states. [2025-03-03 15:12:44,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282195 to 170321. [2025-03-03 15:12:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170321 states, 170320 states have (on average 1.2318400657585722) internal successors, (209807), 170320 states have internal predecessors, (209807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170321 states to 170321 states and 209807 transitions. [2025-03-03 15:12:45,128 INFO L78 Accepts]: Start accepts. Automaton has 170321 states and 209807 transitions. Word has length 107 [2025-03-03 15:12:45,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:45,129 INFO L471 AbstractCegarLoop]: Abstraction has 170321 states and 209807 transitions. [2025-03-03 15:12:45,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.846153846153846) internal successors, (306), 38 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 170321 states and 209807 transitions. [2025-03-03 15:12:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:12:45,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:45,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:45,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:12:45,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-03 15:12:45,333 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:45,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1309970095, now seen corresponding path program 1 times [2025-03-03 15:12:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:45,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555997608] [2025-03-03 15:12:45,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:45,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:45,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:12:45,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:12:45,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:45,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 15:12:45,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:45,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555997608] [2025-03-03 15:12:45,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555997608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:45,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:45,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:45,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012135291] [2025-03-03 15:12:45,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:45,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:45,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:45,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:45,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:45,367 INFO L87 Difference]: Start difference. First operand 170321 states and 209807 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:46,302 INFO L93 Difference]: Finished difference Result 299837 states and 369432 transitions. [2025-03-03 15:12:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:46,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:12:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:46,466 INFO L225 Difference]: With dead ends: 299837 [2025-03-03 15:12:46,466 INFO L226 Difference]: Without dead ends: 129656 [2025-03-03 15:12:46,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:46,532 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 81 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:46,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 119 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129656 states. [2025-03-03 15:12:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129656 to 109298. [2025-03-03 15:12:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109298 states, 109297 states have (on average 1.2179931745610584) internal successors, (133123), 109297 states have internal predecessors, (133123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109298 states to 109298 states and 133123 transitions. [2025-03-03 15:12:47,945 INFO L78 Accepts]: Start accepts. Automaton has 109298 states and 133123 transitions. Word has length 108 [2025-03-03 15:12:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:47,945 INFO L471 AbstractCegarLoop]: Abstraction has 109298 states and 133123 transitions. [2025-03-03 15:12:47,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109298 states and 133123 transitions. [2025-03-03 15:12:47,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:12:47,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:47,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:47,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:12:47,948 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:47,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1235293129, now seen corresponding path program 1 times [2025-03-03 15:12:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:47,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327289839] [2025-03-03 15:12:47,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:47,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:12:47,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:12:47,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:47,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:48,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:48,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327289839] [2025-03-03 15:12:48,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327289839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:12:48,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:12:48,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:12:48,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889137630] [2025-03-03 15:12:48,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:12:48,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:12:48,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:48,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:12:48,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:48,001 INFO L87 Difference]: Start difference. First operand 109298 states and 133123 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:12:48,239 INFO L93 Difference]: Finished difference Result 156632 states and 190654 transitions. [2025-03-03 15:12:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:12:48,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-03-03 15:12:48,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:12:48,290 INFO L225 Difference]: With dead ends: 156632 [2025-03-03 15:12:48,290 INFO L226 Difference]: Without dead ends: 47491 [2025-03-03 15:12:48,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:12:48,337 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:12:48,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 206 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:12:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47491 states. [2025-03-03 15:12:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47491 to 47379. [2025-03-03 15:12:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47379 states, 47378 states have (on average 1.190341508717126) internal successors, (56396), 47378 states have internal predecessors, (56396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47379 states to 47379 states and 56396 transitions. [2025-03-03 15:12:48,881 INFO L78 Accepts]: Start accepts. Automaton has 47379 states and 56396 transitions. Word has length 108 [2025-03-03 15:12:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:12:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 47379 states and 56396 transitions. [2025-03-03 15:12:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:12:48,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47379 states and 56396 transitions. [2025-03-03 15:12:48,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:12:48,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:12:48,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 15:12:48,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:12:48,883 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-03 15:12:48,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:12:48,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1671947764, now seen corresponding path program 1 times [2025-03-03 15:12:48,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:12:48,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816338615] [2025-03-03 15:12:48,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:48,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:12:48,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:12:48,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:12:48,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:48,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:49,482 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:49,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:12:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816338615] [2025-03-03 15:12:49,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816338615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:12:49,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470392846] [2025-03-03 15:12:49,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:12:49,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:12:49,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:12:49,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:12:49,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:12:49,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:12:49,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:12:49,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:12:49,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:12:49,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 15:12:49,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:12:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:50,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:12:51,603 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:12:51,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470392846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:12:51,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:12:51,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 15] total 45 [2025-03-03 15:12:51,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707439036] [2025-03-03 15:12:51,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:12:51,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 15:12:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:12:51,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 15:12:51,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1818, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 15:12:51,604 INFO L87 Difference]: Start difference. First operand 47379 states and 56396 transitions. Second operand has 45 states, 45 states have (on average 6.2444444444444445) internal successors, (281), 45 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)