./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.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 0d2234696348c57e259060be7fd705b6cb557422b7cc5a74e51b2a22fa3392bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:23:32,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:23:32,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:23:32,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:23:32,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:23:32,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:23:32,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:23:32,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:23:32,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:23:32,740 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:23:32,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:23:32,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:23:32,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:23:32,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:23:32,741 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:23:32,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:23:32,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:23:32,741 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:23:32,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:23:32,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:23:32,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:23:32,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:23:32,743 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 -> 0d2234696348c57e259060be7fd705b6cb557422b7cc5a74e51b2a22fa3392bc [2025-03-08 06:23:32,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:23:32,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:23:32,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:23:32,955 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:23:32,955 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:23:32,956 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.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:23:34,027 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee18b15af/4e192e58091145f5abbd15f7efcff3eb/FLAGe4779ec47 [2025-03-08 06:23:34,315 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:23:34,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:23:34,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee18b15af/4e192e58091145f5abbd15f7efcff3eb/FLAGe4779ec47 [2025-03-08 06:23:34,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee18b15af/4e192e58091145f5abbd15f7efcff3eb [2025-03-08 06:23:34,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:23:34,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:23:34,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:23:34,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:23:34,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:23:34,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:34,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64bc7117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34, skipping insertion in model container [2025-03-08 06:23:34,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:34,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:23:34,796 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.UNBOUNDED.pals.c.v+sep-reducer.c[5817,5830] [2025-03-08 06:23:34,813 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.UNBOUNDED.pals.c.v+sep-reducer.c[8470,8483] [2025-03-08 06:23:34,824 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.UNBOUNDED.pals.c.v+sep-reducer.c[11277,11290] [2025-03-08 06:23:34,831 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.UNBOUNDED.pals.c.v+sep-reducer.c[13832,13845] [2025-03-08 06:23:34,839 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.UNBOUNDED.pals.c.v+sep-reducer.c[16838,16851] [2025-03-08 06:23:34,845 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.UNBOUNDED.pals.c.v+sep-reducer.c[19408,19421] [2025-03-08 06:23:34,852 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.UNBOUNDED.pals.c.v+sep-reducer.c[22168,22181] [2025-03-08 06:23:34,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:23:34,880 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:23:34,902 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.UNBOUNDED.pals.c.v+sep-reducer.c[5817,5830] [2025-03-08 06:23:34,910 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.UNBOUNDED.pals.c.v+sep-reducer.c[8470,8483] [2025-03-08 06:23:34,918 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.UNBOUNDED.pals.c.v+sep-reducer.c[11277,11290] [2025-03-08 06:23:34,926 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.UNBOUNDED.pals.c.v+sep-reducer.c[13832,13845] [2025-03-08 06:23:34,934 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.UNBOUNDED.pals.c.v+sep-reducer.c[16838,16851] [2025-03-08 06:23:34,943 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.UNBOUNDED.pals.c.v+sep-reducer.c[19408,19421] [2025-03-08 06:23:34,949 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.UNBOUNDED.pals.c.v+sep-reducer.c[22168,22181] [2025-03-08 06:23:34,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:23:34,981 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:23:34,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34 WrapperNode [2025-03-08 06:23:34,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:23:34,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:23:34,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:23:34,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:23:34,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:34,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,027 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1335 [2025-03-08 06:23:35,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:23:35,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:23:35,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:23:35,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:23:35,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,073 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-08 06:23:35,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:23:35,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:23:35,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:23:35,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:23:35,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (1/1) ... [2025-03-08 06:23:35,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:23:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:35,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:23:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:23:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:23:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:23:35,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:23:35,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:23:35,258 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:23:35,260 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: 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_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: 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_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1656: 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_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~12#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1095: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2087: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2058: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1431: 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_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~10#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: 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_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1531: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~9#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L640: havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__m3~3#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L146: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2030: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:23:36,159 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1866: havoc main_~node1__m1~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_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~14#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L975: 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_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1078: havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__m2~5#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1939: havoc main_~node3__m3~12#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1907: havoc main_~node2__m2~10#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1217: 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_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1977: havoc main_~check__tmp~16#1; [2025-03-08 06:23:36,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L163: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-03-08 06:23:36,200 INFO L? ?]: Removed 222 outVars from TransFormulas that were not future-live. [2025-03-08 06:23:36,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:23:36,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:23:36,212 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:23:36,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:23:36 BoogieIcfgContainer [2025-03-08 06:23:36,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:23:36,214 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:23:36,214 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:23:36,217 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:23:36,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:23:34" (1/3) ... [2025-03-08 06:23:36,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106eb666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:23:36, skipping insertion in model container [2025-03-08 06:23:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:23:34" (2/3) ... [2025-03-08 06:23:36,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106eb666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:23:36, skipping insertion in model container [2025-03-08 06:23:36,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:23:36" (3/3) ... [2025-03-08 06:23:36,219 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2025-03-08 06:23:36,228 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:23:36,231 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c that has 1 procedures, 266 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-03-08 06:23:36,273 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:23:36,284 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;@6d375709, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:23:36,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-08 06:23:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 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-08 06:23:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:23:36,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:36,293 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] [2025-03-08 06:23:36,293 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-08 06:23:36,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1578492662, now seen corresponding path program 1 times [2025-03-08 06:23:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761929359] [2025-03-08 06:23:36,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:36,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:23:36,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:23:36,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:36,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:36,673 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-08 06:23:36,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761929359] [2025-03-08 06:23:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761929359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:36,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:23:36,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390786079] [2025-03-08 06:23:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:36,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:36,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:36,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:36,697 INFO L87 Difference]: Start difference. First operand has 266 states, 258 states have (on average 1.8294573643410852) internal successors, (472), 265 states have internal predecessors, (472), 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.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:36,925 INFO L93 Difference]: Finished difference Result 359 states and 614 transitions. [2025-03-08 06:23:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-03-08 06:23:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:36,936 INFO L225 Difference]: With dead ends: 359 [2025-03-08 06:23:36,936 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 06:23:36,938 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-08 06:23:36,940 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1022 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:36,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 243 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 06:23:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-08 06:23:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 205 states have internal predecessors, (257), 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-08 06:23:36,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2025-03-08 06:23:36,974 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 47 [2025-03-08 06:23:36,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:36,974 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2025-03-08 06:23:36,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2025-03-08 06:23:36,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:23:36,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:36,975 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] [2025-03-08 06:23:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:23:36,976 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-08 06:23:36,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1393368872, now seen corresponding path program 1 times [2025-03-08 06:23:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:36,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912615702] [2025-03-08 06:23:36,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:36,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:36,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:23:37,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:23:37,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:37,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:37,101 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-08 06:23:37,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:37,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912615702] [2025-03-08 06:23:37,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912615702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:37,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:37,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:23:37,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367779992] [2025-03-08 06:23:37,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:37,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:37,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:37,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:37,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:37,105 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:37,224 INFO L93 Difference]: Finished difference Result 274 states and 345 transitions. [2025-03-08 06:23:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:37,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-03-08 06:23:37,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:37,227 INFO L225 Difference]: With dead ends: 274 [2025-03-08 06:23:37,227 INFO L226 Difference]: Without dead ends: 163 [2025-03-08 06:23:37,228 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-08 06:23:37,228 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 564 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:37,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 131 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:23:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-08 06:23:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-03-08 06:23:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 156 states have (on average 1.294871794871795) internal successors, (202), 162 states have internal predecessors, (202), 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-08 06:23:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2025-03-08 06:23:37,235 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 47 [2025-03-08 06:23:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:37,235 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2025-03-08 06:23:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2025-03-08 06:23:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 06:23:37,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:37,239 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] [2025-03-08 06:23:37,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:23:37,240 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-08 06:23:37,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:37,241 INFO L85 PathProgramCache]: Analyzing trace with hash 600037070, now seen corresponding path program 1 times [2025-03-08 06:23:37,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:37,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587570904] [2025-03-08 06:23:37,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:37,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 06:23:37,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 06:23:37,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:37,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:37,367 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-08 06:23:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587570904] [2025-03-08 06:23:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587570904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:37,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:37,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:23:37,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074385711] [2025-03-08 06:23:37,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:37,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:37,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:37,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:37,368 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:37,491 INFO L93 Difference]: Finished difference Result 246 states and 313 transitions. [2025-03-08 06:23:37,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:37,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2025-03-08 06:23:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:37,493 INFO L225 Difference]: With dead ends: 246 [2025-03-08 06:23:37,495 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 06:23:37,495 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-08 06:23:37,496 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 521 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:37,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 128 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:23:37,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 06:23:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-08 06:23:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2972972972972974) internal successors, (192), 154 states have internal predecessors, (192), 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-08 06:23:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 192 transitions. [2025-03-08 06:23:37,505 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 192 transitions. Word has length 47 [2025-03-08 06:23:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:37,505 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 192 transitions. [2025-03-08 06:23:37,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 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-08 06:23:37,506 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 192 transitions. [2025-03-08 06:23:37,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:23:37,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:37,506 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-08 06:23:37,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:23:37,507 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-08 06:23:37,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:37,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2476914, now seen corresponding path program 1 times [2025-03-08 06:23:37,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:37,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130076024] [2025-03-08 06:23:37,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:37,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:37,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:23:37,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:23:37,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:37,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:37,800 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-08 06:23:37,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:37,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130076024] [2025-03-08 06:23:37,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130076024] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:37,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:37,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:23:37,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196395114] [2025-03-08 06:23:37,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:23:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:37,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:23:37,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:23:37,802 INFO L87 Difference]: Start difference. First operand 155 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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-08 06:23:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:38,057 INFO L93 Difference]: Finished difference Result 310 states and 392 transitions. [2025-03-08 06:23:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:23:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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-08 06:23:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:38,058 INFO L225 Difference]: With dead ends: 310 [2025-03-08 06:23:38,058 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 06:23:38,058 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-08 06:23:38,059 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 984 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:38,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 382 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:38,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 06:23:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 155. [2025-03-08 06:23:38,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 154 states have internal predecessors, (191), 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-08 06:23:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 191 transitions. [2025-03-08 06:23:38,063 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 191 transitions. Word has length 48 [2025-03-08 06:23:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:38,064 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 191 transitions. [2025-03-08 06:23:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 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-08 06:23:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 191 transitions. [2025-03-08 06:23:38,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:23:38,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:38,064 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-08 06:23:38,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:23:38,065 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:38,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:38,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1461732619, now seen corresponding path program 1 times [2025-03-08 06:23:38,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:38,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126716457] [2025-03-08 06:23:38,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:38,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:38,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:23:38,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:23:38,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:38,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:38,294 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-08 06:23:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:38,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126716457] [2025-03-08 06:23:38,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126716457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:38,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:38,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:23:38,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963020295] [2025-03-08 06:23:38,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:38,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:23:38,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:38,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:23:38,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:23:38,296 INFO L87 Difference]: Start difference. First operand 155 states and 191 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:38,665 INFO L93 Difference]: Finished difference Result 301 states and 387 transitions. [2025-03-08 06:23:38,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:23:38,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:38,667 INFO L225 Difference]: With dead ends: 301 [2025-03-08 06:23:38,667 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 06:23:38,668 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-08 06:23:38,668 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 830 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 748 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-08 06:23:38,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 748 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:38,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 06:23:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2025-03-08 06:23:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.2837837837837838) internal successors, (190), 154 states have internal predecessors, (190), 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-08 06:23:38,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2025-03-08 06:23:38,678 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 48 [2025-03-08 06:23:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2025-03-08 06:23:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2025-03-08 06:23:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 06:23:38,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:38,681 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-08 06:23:38,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:23:38,681 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:38,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:38,682 INFO L85 PathProgramCache]: Analyzing trace with hash -649804618, now seen corresponding path program 1 times [2025-03-08 06:23:38,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:38,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843349453] [2025-03-08 06:23:38,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:38,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 06:23:38,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 06:23:38,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:38,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:38,926 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-08 06:23:38,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:38,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843349453] [2025-03-08 06:23:38,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843349453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:38,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:38,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:23:38,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528332119] [2025-03-08 06:23:38,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:38,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:23:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:38,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:23:38,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:23:38,928 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:39,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:39,306 INFO L93 Difference]: Finished difference Result 242 states and 301 transitions. [2025-03-08 06:23:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:23:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:39,309 INFO L225 Difference]: With dead ends: 242 [2025-03-08 06:23:39,309 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 06:23:39,309 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-08 06:23:39,309 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 785 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:39,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 819 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 06:23:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155. [2025-03-08 06:23:39,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 148 states have (on average 1.277027027027027) internal successors, (189), 154 states have internal predecessors, (189), 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-08 06:23:39,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 189 transitions. [2025-03-08 06:23:39,318 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 189 transitions. Word has length 48 [2025-03-08 06:23:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:39,318 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 189 transitions. [2025-03-08 06:23:39,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 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-08 06:23:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 189 transitions. [2025-03-08 06:23:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:23:39,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:39,319 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-08 06:23:39,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:23:39,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:39,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1625010527, now seen corresponding path program 1 times [2025-03-08 06:23:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938361548] [2025-03-08 06:23:39,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:39,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:39,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:23:39,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:23:39,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:39,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:40,139 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-08 06:23:40,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:40,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938361548] [2025-03-08 06:23:40,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938361548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:40,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:40,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-08 06:23:40,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508192813] [2025-03-08 06:23:40,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:40,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:23:40,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:40,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:23:40,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:23:40,140 INFO L87 Difference]: Start difference. First operand 155 states and 189 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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-08 06:23:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:41,332 INFO L93 Difference]: Finished difference Result 391 states and 495 transitions. [2025-03-08 06:23:41,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 06:23:41,332 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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-08 06:23:41,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:41,333 INFO L225 Difference]: With dead ends: 391 [2025-03-08 06:23:41,333 INFO L226 Difference]: Without dead ends: 387 [2025-03-08 06:23:41,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 06:23:41,334 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 1704 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2856 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:41,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 2856 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 06:23:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-08 06:23:41,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 165. [2025-03-08 06:23:41,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 164 states have internal predecessors, (204), 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-08 06:23:41,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 204 transitions. [2025-03-08 06:23:41,340 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 204 transitions. Word has length 50 [2025-03-08 06:23:41,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:41,340 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 204 transitions. [2025-03-08 06:23:41,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 19 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-08 06:23:41,340 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 204 transitions. [2025-03-08 06:23:41,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 06:23:41,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:41,341 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-08 06:23:41,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:23:41,341 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:41,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 272054837, now seen corresponding path program 1 times [2025-03-08 06:23:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176011291] [2025-03-08 06:23:41,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:41,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:41,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 06:23:41,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 06:23:41,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:41,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:41,679 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-08 06:23:41,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:41,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176011291] [2025-03-08 06:23:41,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176011291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:41,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:41,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:23:41,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625823305] [2025-03-08 06:23:41,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:41,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 06:23:41,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:41,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 06:23:41,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:23:41,680 INFO L87 Difference]: Start difference. First operand 165 states and 204 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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-08 06:23:42,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,027 INFO L93 Difference]: Finished difference Result 394 states and 516 transitions. [2025-03-08 06:23:42,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:23:42,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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-08 06:23:42,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,029 INFO L225 Difference]: With dead ends: 394 [2025-03-08 06:23:42,029 INFO L226 Difference]: Without dead ends: 318 [2025-03-08 06:23:42,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-03-08 06:23:42,030 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 972 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:42,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 849 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:42,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-08 06:23:42,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 132. [2025-03-08 06:23:42,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.2890625) internal successors, (165), 131 states have internal predecessors, (165), 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-08 06:23:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 165 transitions. [2025-03-08 06:23:42,035 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 165 transitions. Word has length 50 [2025-03-08 06:23:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:42,035 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 165 transitions. [2025-03-08 06:23:42,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 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-08 06:23:42,036 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 165 transitions. [2025-03-08 06:23:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:23:42,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:42,036 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-08 06:23:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:23:42,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:42,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:42,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2097485101, now seen corresponding path program 1 times [2025-03-08 06:23:42,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:42,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867278473] [2025-03-08 06:23:42,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:42,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:23:42,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:23:42,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:42,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:42,180 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-08 06:23:42,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:42,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867278473] [2025-03-08 06:23:42,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867278473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:42,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:42,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:23:42,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085337153] [2025-03-08 06:23:42,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:42,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:23:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:42,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:23:42,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:23:42,182 INFO L87 Difference]: Start difference. First operand 132 states and 165 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,494 INFO L93 Difference]: Finished difference Result 265 states and 343 transitions. [2025-03-08 06:23:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:23:42,495 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,496 INFO L225 Difference]: With dead ends: 265 [2025-03-08 06:23:42,496 INFO L226 Difference]: Without dead ends: 204 [2025-03-08 06:23:42,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:23:42,496 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 309 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:42,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 627 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-08 06:23:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 132. [2025-03-08 06:23:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.2734375) internal successors, (163), 131 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-08 06:23:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 163 transitions. [2025-03-08 06:23:42,499 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 163 transitions. Word has length 51 [2025-03-08 06:23:42,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:42,500 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 163 transitions. [2025-03-08 06:23:42,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 163 transitions. [2025-03-08 06:23:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:23:42,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:42,500 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-08 06:23:42,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:23:42,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:42,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:42,501 INFO L85 PathProgramCache]: Analyzing trace with hash 776208117, now seen corresponding path program 1 times [2025-03-08 06:23:42,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:42,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475022580] [2025-03-08 06:23:42,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:42,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:23:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:23:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:42,663 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-08 06:23:42,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:42,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475022580] [2025-03-08 06:23:42,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475022580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:42,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:42,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:23:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121310960] [2025-03-08 06:23:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:42,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 06:23:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:42,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 06:23:42,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:23:42,664 INFO L87 Difference]: Start difference. First operand 132 states and 163 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:42,933 INFO L93 Difference]: Finished difference Result 203 states and 256 transitions. [2025-03-08 06:23:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 06:23:42,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:42,934 INFO L225 Difference]: With dead ends: 203 [2025-03-08 06:23:42,934 INFO L226 Difference]: Without dead ends: 196 [2025-03-08 06:23:42,934 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-08 06:23:42,935 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 588 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:42,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 707 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-08 06:23:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 132. [2025-03-08 06:23:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.2578125) internal successors, (161), 131 states have internal predecessors, (161), 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-08 06:23:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2025-03-08 06:23:42,941 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 51 [2025-03-08 06:23:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:42,941 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2025-03-08 06:23:42,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 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-08 06:23:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2025-03-08 06:23:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 06:23:42,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:42,942 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-08 06:23:42,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:23:42,944 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:42,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash 852577934, now seen corresponding path program 1 times [2025-03-08 06:23:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:42,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041424467] [2025-03-08 06:23:42,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:42,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:42,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 06:23:42,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 06:23:42,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:42,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:43,246 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-08 06:23:43,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:43,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041424467] [2025-03-08 06:23:43,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041424467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:43,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:23:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022263041] [2025-03-08 06:23:43,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:43,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:23:43,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:43,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:23:43,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:23:43,247 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 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-08 06:23:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:43,541 INFO L93 Difference]: Finished difference Result 194 states and 246 transitions. [2025-03-08 06:23:43,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:23:43,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 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-08 06:23:43,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:43,542 INFO L225 Difference]: With dead ends: 194 [2025-03-08 06:23:43,542 INFO L226 Difference]: Without dead ends: 174 [2025-03-08 06:23:43,542 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-08 06:23:43,543 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 580 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:43,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1112 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:23:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-08 06:23:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 106. [2025-03-08 06:23:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 105 states have internal predecessors, (131), 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-08 06:23:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 131 transitions. [2025-03-08 06:23:43,545 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 131 transitions. Word has length 51 [2025-03-08 06:23:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:43,545 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 131 transitions. [2025-03-08 06:23:43,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 12 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-08 06:23:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 131 transitions. [2025-03-08 06:23:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 06:23:43,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:43,546 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] [2025-03-08 06:23:43,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:23:43,546 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-08 06:23:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash 738591154, now seen corresponding path program 1 times [2025-03-08 06:23:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:43,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427565936] [2025-03-08 06:23:43,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:43,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 06:23:43,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 06:23:43,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:43,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:43,883 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-08 06:23:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:43,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427565936] [2025-03-08 06:23:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427565936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 06:23:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828374194] [2025-03-08 06:23:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:43,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:23:43,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:43,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:23:43,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:23:43,884 INFO L87 Difference]: Start difference. First operand 106 states and 131 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-08 06:23:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,309 INFO L93 Difference]: Finished difference Result 162 states and 211 transitions. [2025-03-08 06:23:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 06:23:44,310 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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 53 [2025-03-08 06:23:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,310 INFO L225 Difference]: With dead ends: 162 [2025-03-08 06:23:44,310 INFO L226 Difference]: Without dead ends: 156 [2025-03-08 06:23:44,311 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-08 06:23:44,311 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 452 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:44,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1106 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:23:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-08 06:23:44,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 100. [2025-03-08 06:23:44,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 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-08 06:23:44,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2025-03-08 06:23:44,313 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 53 [2025-03-08 06:23:44,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,313 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2025-03-08 06:23:44,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 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-08 06:23:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2025-03-08 06:23:44,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-08 06:23:44,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,314 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] [2025-03-08 06:23:44,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:23:44,314 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:44,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2093824018, now seen corresponding path program 1 times [2025-03-08 06:23:44,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857797351] [2025-03-08 06:23:44,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-08 06:23:44,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-08 06:23:44,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,374 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-08 06:23:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857797351] [2025-03-08 06:23:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857797351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:23:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418896459] [2025-03-08 06:23:44,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:44,375 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-08 06:23:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,427 INFO L93 Difference]: Finished difference Result 358 states and 509 transitions. [2025-03-08 06:23:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:23:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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 71 [2025-03-08 06:23:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,429 INFO L225 Difference]: With dead ends: 358 [2025-03-08 06:23:44,429 INFO L226 Difference]: Without dead ends: 315 [2025-03-08 06:23:44,429 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-08 06:23:44,430 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 480 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:44,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 504 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-03-08 06:23:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 141. [2025-03-08 06:23:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 140 states have internal predecessors, (186), 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-08 06:23:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2025-03-08 06:23:44,433 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 71 [2025-03-08 06:23:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2025-03-08 06:23:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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-08 06:23:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2025-03-08 06:23:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:23:44,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,434 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] [2025-03-08 06:23:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:23:44,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:44,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash -242806958, now seen corresponding path program 1 times [2025-03-08 06:23:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588985281] [2025-03-08 06:23:44,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:23:44,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:23:44,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,495 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-08 06:23:44,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588985281] [2025-03-08 06:23:44,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588985281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:23:44,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391561227] [2025-03-08 06:23:44,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:44,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:44,497 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-08 06:23:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,539 INFO L93 Difference]: Finished difference Result 436 states and 623 transitions. [2025-03-08 06:23:44,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:44,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2025-03-08 06:23:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,540 INFO L225 Difference]: With dead ends: 436 [2025-03-08 06:23:44,540 INFO L226 Difference]: Without dead ends: 352 [2025-03-08 06:23:44,540 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-08 06:23:44,541 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 283 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:44,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 430 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-03-08 06:23:44,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 223. [2025-03-08 06:23:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 1.3918918918918919) internal successors, (309), 222 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-08 06:23:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 309 transitions. [2025-03-08 06:23:44,545 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 309 transitions. Word has length 73 [2025-03-08 06:23:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 309 transitions. [2025-03-08 06:23:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-08 06:23:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 309 transitions. [2025-03-08 06:23:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:23:44,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,546 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] [2025-03-08 06:23:44,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:23:44,546 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-03-08 06:23:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -787410990, now seen corresponding path program 1 times [2025-03-08 06:23:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969298689] [2025-03-08 06:23:44,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:23:44,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:23:44,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,618 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-08 06:23:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969298689] [2025-03-08 06:23:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969298689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:23:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280947492] [2025-03-08 06:23:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:44,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:44,620 INFO L87 Difference]: Start difference. First operand 223 states and 309 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-08 06:23:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,663 INFO L93 Difference]: Finished difference Result 518 states and 746 transitions. [2025-03-08 06:23:44,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:44,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 73 [2025-03-08 06:23:44,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,666 INFO L225 Difference]: With dead ends: 518 [2025-03-08 06:23:44,666 INFO L226 Difference]: Without dead ends: 434 [2025-03-08 06:23:44,667 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-08 06:23:44,667 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 291 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:44,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 431 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-08 06:23:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 346. [2025-03-08 06:23:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 1.4289855072463769) internal successors, (493), 345 states have internal predecessors, (493), 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-08 06:23:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 493 transitions. [2025-03-08 06:23:44,679 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 493 transitions. Word has length 73 [2025-03-08 06:23:44,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,679 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 493 transitions. [2025-03-08 06:23:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-08 06:23:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 493 transitions. [2025-03-08 06:23:44,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:23:44,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,680 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] [2025-03-08 06:23:44,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:23:44,680 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-08 06:23:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -749974426, now seen corresponding path program 1 times [2025-03-08 06:23:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040989247] [2025-03-08 06:23:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:23:44,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:23:44,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,716 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-08 06:23:44,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040989247] [2025-03-08 06:23:44,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040989247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:44,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376799144] [2025-03-08 06:23:44,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:44,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:44,718 INFO L87 Difference]: Start difference. First operand 346 states and 493 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-08 06:23:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,740 INFO L93 Difference]: Finished difference Result 879 states and 1278 transitions. [2025-03-08 06:23:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2025-03-08 06:23:44,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,742 INFO L225 Difference]: With dead ends: 879 [2025-03-08 06:23:44,742 INFO L226 Difference]: Without dead ends: 590 [2025-03-08 06:23:44,742 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-08 06:23:44,742 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:44,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 195 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-03-08 06:23:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 581. [2025-03-08 06:23:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4137931034482758) internal successors, (820), 580 states have internal predecessors, (820), 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-08 06:23:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 820 transitions. [2025-03-08 06:23:44,756 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 820 transitions. Word has length 73 [2025-03-08 06:23:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,756 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 820 transitions. [2025-03-08 06:23:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-08 06:23:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 820 transitions. [2025-03-08 06:23:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 06:23:44,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,757 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] [2025-03-08 06:23:44,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:23:44,757 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-08 06:23:44,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,758 INFO L85 PathProgramCache]: Analyzing trace with hash -714880628, now seen corresponding path program 1 times [2025-03-08 06:23:44,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136493518] [2025-03-08 06:23:44,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 06:23:44,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 06:23:44,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,795 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-08 06:23:44,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136493518] [2025-03-08 06:23:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136493518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824184218] [2025-03-08 06:23:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:44,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:44,796 INFO L87 Difference]: Start difference. First operand 581 states and 820 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-08 06:23:44,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,816 INFO L93 Difference]: Finished difference Result 1107 states and 1580 transitions. [2025-03-08 06:23:44,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:44,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2025-03-08 06:23:44,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,818 INFO L225 Difference]: With dead ends: 1107 [2025-03-08 06:23:44,818 INFO L226 Difference]: Without dead ends: 583 [2025-03-08 06:23:44,819 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-08 06:23:44,820 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 200 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-08 06:23:44,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-08 06:23:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2025-03-08 06:23:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.4068965517241379) internal successors, (816), 580 states have internal predecessors, (816), 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-08 06:23:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 816 transitions. [2025-03-08 06:23:44,829 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 816 transitions. Word has length 73 [2025-03-08 06:23:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,829 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 816 transitions. [2025-03-08 06:23:44,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-08 06:23:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 816 transitions. [2025-03-08 06:23:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-08 06:23:44,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,830 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] [2025-03-08 06:23:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:23:44,830 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-08 06:23:44,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash -650801140, now seen corresponding path program 1 times [2025-03-08 06:23:44,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260354015] [2025-03-08 06:23:44,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-08 06:23:44,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-08 06:23:44,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,887 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-08 06:23:44,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260354015] [2025-03-08 06:23:44,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260354015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:44,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241906603] [2025-03-08 06:23:44,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:44,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:44,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:44,888 INFO L87 Difference]: Start difference. First operand 581 states and 816 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-08 06:23:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:44,906 INFO L93 Difference]: Finished difference Result 1573 states and 2228 transitions. [2025-03-08 06:23:44,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:44,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-08 06:23:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:44,909 INFO L225 Difference]: With dead ends: 1573 [2025-03-08 06:23:44,909 INFO L226 Difference]: Without dead ends: 1049 [2025-03-08 06:23:44,910 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-08 06:23:44,911 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 54 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 256 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-08 06:23:44,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-03-08 06:23:44,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 991. [2025-03-08 06:23:44,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.402020202020202) internal successors, (1388), 990 states have internal predecessors, (1388), 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-08 06:23:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1388 transitions. [2025-03-08 06:23:44,927 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1388 transitions. Word has length 74 [2025-03-08 06:23:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:44,928 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1388 transitions. [2025-03-08 06:23:44,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-08 06:23:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1388 transitions. [2025-03-08 06:23:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-08 06:23:44,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:44,931 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-08 06:23:44,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:23:44,931 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-08 06:23:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1673020684, now seen corresponding path program 1 times [2025-03-08 06:23:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:44,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130583619] [2025-03-08 06:23:44,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:44,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:44,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-08 06:23:44,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-08 06:23:44,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:44,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:44,994 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-08 06:23:44,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:44,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130583619] [2025-03-08 06:23:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130583619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858457775] [2025-03-08 06:23:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:44,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:44,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:44,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:44,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:44,996 INFO L87 Difference]: Start difference. First operand 991 states and 1388 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-08 06:23:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:45,018 INFO L93 Difference]: Finished difference Result 2747 states and 3846 transitions. [2025-03-08 06:23:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:45,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-08 06:23:45,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:45,023 INFO L225 Difference]: With dead ends: 2747 [2025-03-08 06:23:45,023 INFO L226 Difference]: Without dead ends: 1813 [2025-03-08 06:23:45,024 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-08 06:23:45,025 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 44 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 256 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-08 06:23:45,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 256 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2025-03-08 06:23:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1699. [2025-03-08 06:23:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3839811542991756) internal successors, (2350), 1698 states have internal predecessors, (2350), 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-08 06:23:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2350 transitions. [2025-03-08 06:23:45,053 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2350 transitions. Word has length 75 [2025-03-08 06:23:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:45,053 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2350 transitions. [2025-03-08 06:23:45,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 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-08 06:23:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2350 transitions. [2025-03-08 06:23:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:45,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:45,055 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] [2025-03-08 06:23:45,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:23:45,055 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-08 06:23:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:45,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1208865792, now seen corresponding path program 1 times [2025-03-08 06:23:45,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:45,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660316833] [2025-03-08 06:23:45,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:45,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:45,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:45,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:45,217 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-08 06:23:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:45,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660316833] [2025-03-08 06:23:45,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660316833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:45,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:45,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:23:45,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903194257] [2025-03-08 06:23:45,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:45,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:23:45,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:45,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:23:45,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:23:45,218 INFO L87 Difference]: Start difference. First operand 1699 states and 2350 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-08 06:23:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:45,240 INFO L93 Difference]: Finished difference Result 1773 states and 2447 transitions. [2025-03-08 06:23:45,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:23:45,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2025-03-08 06:23:45,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:45,245 INFO L225 Difference]: With dead ends: 1773 [2025-03-08 06:23:45,246 INFO L226 Difference]: Without dead ends: 1771 [2025-03-08 06:23:45,246 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-08 06:23:45,247 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:45,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2025-03-08 06:23:45,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2025-03-08 06:23:45,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 1.3593220338983052) internal successors, (2406), 1770 states have internal predecessors, (2406), 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-08 06:23:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2406 transitions. [2025-03-08 06:23:45,272 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2406 transitions. Word has length 76 [2025-03-08 06:23:45,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:45,273 INFO L471 AbstractCegarLoop]: Abstraction has 1771 states and 2406 transitions. [2025-03-08 06:23:45,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-08 06:23:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2406 transitions. [2025-03-08 06:23:45,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-08 06:23:45,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:45,274 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] [2025-03-08 06:23:45,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:23:45,274 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-08 06:23:45,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash -386632834, now seen corresponding path program 1 times [2025-03-08 06:23:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468060721] [2025-03-08 06:23:45,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:45,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:45,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 06:23:45,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 06:23:45,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:45,343 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-08 06:23:45,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:45,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468060721] [2025-03-08 06:23:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468060721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:23:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800262880] [2025-03-08 06:23:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:45,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:23:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:45,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:23:45,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:23:45,345 INFO L87 Difference]: Start difference. First operand 1771 states and 2406 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-08 06:23:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:45,399 INFO L93 Difference]: Finished difference Result 3255 states and 4450 transitions. [2025-03-08 06:23:45,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:23:45,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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 76 [2025-03-08 06:23:45,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:45,407 INFO L225 Difference]: With dead ends: 3255 [2025-03-08 06:23:45,407 INFO L226 Difference]: Without dead ends: 2761 [2025-03-08 06:23:45,408 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-08 06:23:45,409 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 285 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:45,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 451 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2025-03-08 06:23:45,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2263. [2025-03-08 06:23:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 2262 states have (on average 1.3607427055702919) internal successors, (3078), 2262 states have internal predecessors, (3078), 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-08 06:23:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3078 transitions. [2025-03-08 06:23:45,452 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3078 transitions. Word has length 76 [2025-03-08 06:23:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3078 transitions. [2025-03-08 06:23:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-08 06:23:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3078 transitions. [2025-03-08 06:23:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 06:23:45,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:45,453 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-08 06:23:45,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:23:45,454 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-08 06:23:45,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1853381690, now seen corresponding path program 1 times [2025-03-08 06:23:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:45,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693919895] [2025-03-08 06:23:45,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:45,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-08 06:23:45,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-08 06:23:45,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:45,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:45,522 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-08 06:23:45,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:45,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693919895] [2025-03-08 06:23:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693919895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:45,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749919132] [2025-03-08 06:23:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:45,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:45,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:45,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:45,523 INFO L87 Difference]: Start difference. First operand 2263 states and 3078 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-08 06:23:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:45,552 INFO L93 Difference]: Finished difference Result 5883 states and 7992 transitions. [2025-03-08 06:23:45,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:45,553 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-08 06:23:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:45,563 INFO L225 Difference]: With dead ends: 5883 [2025-03-08 06:23:45,563 INFO L226 Difference]: Without dead ends: 3677 [2025-03-08 06:23:45,566 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-08 06:23:45,567 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 58 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 259 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-08 06:23:45,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 259 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-03-08 06:23:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3387. [2025-03-08 06:23:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3414057885410513) internal successors, (4542), 3386 states have internal predecessors, (4542), 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-08 06:23:45,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4542 transitions. [2025-03-08 06:23:45,643 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4542 transitions. Word has length 77 [2025-03-08 06:23:45,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:45,643 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4542 transitions. [2025-03-08 06:23:45,643 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-08 06:23:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4542 transitions. [2025-03-08 06:23:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:23:45,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:45,645 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:23:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:23:45,646 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-08 06:23:45,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1983638210, now seen corresponding path program 1 times [2025-03-08 06:23:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906558426] [2025-03-08 06:23:45,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:45,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:23:45,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:23:45,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:45,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:45,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:45,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906558426] [2025-03-08 06:23:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906558426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:23:45,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:23:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:23:45,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871793548] [2025-03-08 06:23:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:23:45,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:23:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:45,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:23:45,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:23:45,725 INFO L87 Difference]: Start difference. First operand 3387 states and 4542 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-08 06:23:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:45,759 INFO L93 Difference]: Finished difference Result 6719 states and 9024 transitions. [2025-03-08 06:23:45,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:23:45,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2025-03-08 06:23:45,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:45,768 INFO L225 Difference]: With dead ends: 6719 [2025-03-08 06:23:45,768 INFO L226 Difference]: Without dead ends: 3389 [2025-03-08 06:23:45,772 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-08 06:23:45,772 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 55 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 237 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-08 06:23:45,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 237 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:23:45,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3389 states. [2025-03-08 06:23:45,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3389 to 3387. [2025-03-08 06:23:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 3386 states have (on average 1.3201417601890135) internal successors, (4470), 3386 states have internal predecessors, (4470), 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-08 06:23:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4470 transitions. [2025-03-08 06:23:45,838 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4470 transitions. Word has length 98 [2025-03-08 06:23:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4470 transitions. [2025-03-08 06:23:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-08 06:23:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4470 transitions. [2025-03-08 06:23:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:23:45,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:45,840 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] [2025-03-08 06:23:45,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:23:45,840 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-08 06:23:45,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:45,840 INFO L85 PathProgramCache]: Analyzing trace with hash -849709986, now seen corresponding path program 1 times [2025-03-08 06:23:45,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:45,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401326609] [2025-03-08 06:23:45,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:45,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:23:45,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:23:45,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:45,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401326609] [2025-03-08 06:23:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401326609] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157332008] [2025-03-08 06:23:46,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:46,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:46,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:46,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:46,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:23:46,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:23:46,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:23:46,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:46,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:46,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 06:23:46,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:46,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:47,668 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:47,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157332008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:47,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:47,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2025-03-08 06:23:47,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48513910] [2025-03-08 06:23:47,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:47,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:23:47,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:47,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:23:47,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:23:47,670 INFO L87 Difference]: Start difference. First operand 3387 states and 4470 transitions. Second operand has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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-08 06:23:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:23:49,039 INFO L93 Difference]: Finished difference Result 17149 states and 22514 transitions. [2025-03-08 06:23:49,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 06:23:49,039 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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 98 [2025-03-08 06:23:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:23:49,074 INFO L225 Difference]: With dead ends: 17149 [2025-03-08 06:23:49,074 INFO L226 Difference]: Without dead ends: 13819 [2025-03-08 06:23:49,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=893, Invalid=3013, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 06:23:49,078 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2138 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:23:49,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 893 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:23:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13819 states. [2025-03-08 06:23:49,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13819 to 7230. [2025-03-08 06:23:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7230 states, 7229 states have (on average 1.3131830128648498) internal successors, (9493), 7229 states have internal predecessors, (9493), 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-08 06:23:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7230 states to 7230 states and 9493 transitions. [2025-03-08 06:23:49,202 INFO L78 Accepts]: Start accepts. Automaton has 7230 states and 9493 transitions. Word has length 98 [2025-03-08 06:23:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:23:49,202 INFO L471 AbstractCegarLoop]: Abstraction has 7230 states and 9493 transitions. [2025-03-08 06:23:49,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.423076923076923) internal successors, (245), 25 states have internal predecessors, (245), 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-08 06:23:49,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7230 states and 9493 transitions. [2025-03-08 06:23:49,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:23:49,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:23:49,203 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] [2025-03-08 06:23:49,211 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-08 06:23:49,404 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,SelfDestructingSolverStorable23 [2025-03-08 06:23:49,405 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-08 06:23:49,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:23:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 435139501, now seen corresponding path program 1 times [2025-03-08 06:23:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:23:49,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822476040] [2025-03-08 06:23:49,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:23:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:23:49,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:23:49,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:49,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:23:49,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:23:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822476040] [2025-03-08 06:23:49,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822476040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:23:49,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740891571] [2025-03-08 06:23:49,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:23:49,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:23:49,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:23:49,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:23:49,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:23:49,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:23:49,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:23:49,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:23:49,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:23:49,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 06:23:49,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:23:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:23:50,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:23:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:23:50,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740891571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:23:50,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:23:50,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 26 [2025-03-08 06:23:50,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993929080] [2025-03-08 06:23:50,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:23:50,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:23:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:23:50,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:23:50,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:23:50,710 INFO L87 Difference]: Start difference. First operand 7230 states and 9493 transitions. Second operand has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 26 states have internal predecessors, (283), 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-08 06:24:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:00,397 INFO L93 Difference]: Finished difference Result 108009 states and 140278 transitions. [2025-03-08 06:24:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2025-03-08 06:24:00,397 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 26 states have internal predecessors, (283), 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 99 [2025-03-08 06:24:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:00,632 INFO L225 Difference]: With dead ends: 108009 [2025-03-08 06:24:00,633 INFO L226 Difference]: Without dead ends: 99118 [2025-03-08 06:24:00,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31766 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8731, Invalid=64439, Unknown=0, NotChecked=0, Total=73170 [2025-03-08 06:24:00,670 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 7950 mSDsluCounter, 2038 mSDsCounter, 0 mSdLazyCounter, 4256 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7950 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 4559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 4256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:00,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7950 Valid, 2239 Invalid, 4559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 4256 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 06:24:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99118 states. [2025-03-08 06:24:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99118 to 74896. [2025-03-08 06:24:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74896 states, 74895 states have (on average 1.3024901528806996) internal successors, (97550), 74895 states have internal predecessors, (97550), 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-08 06:24:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74896 states to 74896 states and 97550 transitions. [2025-03-08 06:24:01,753 INFO L78 Accepts]: Start accepts. Automaton has 74896 states and 97550 transitions. Word has length 99 [2025-03-08 06:24:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:01,753 INFO L471 AbstractCegarLoop]: Abstraction has 74896 states and 97550 transitions. [2025-03-08 06:24:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.884615384615385) internal successors, (283), 26 states have internal predecessors, (283), 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-08 06:24:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 74896 states and 97550 transitions. [2025-03-08 06:24:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:24:01,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:01,756 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:24:01,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:24:01,961 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,SelfDestructingSolverStorable24 [2025-03-08 06:24:01,961 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-08 06:24:01,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1815613386, now seen corresponding path program 1 times [2025-03-08 06:24:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:01,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026365157] [2025-03-08 06:24:01,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:01,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:24:01,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:24:01,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:01,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:02,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026365157] [2025-03-08 06:24:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026365157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589338860] [2025-03-08 06:24:02,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:02,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:02,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:02,431 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-08 06:24:02,432 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-08 06:24:02,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:24:02,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:24:02,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:02,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:02,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 06:24:02,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:03,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:03,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589338860] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:03,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:03,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 12] total 32 [2025-03-08 06:24:03,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9386110] [2025-03-08 06:24:03,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 06:24:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:03,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 06:24:03,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:24:03,622 INFO L87 Difference]: Start difference. First operand 74896 states and 97550 transitions. Second operand has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 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-08 06:24:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:09,068 INFO L93 Difference]: Finished difference Result 450862 states and 584816 transitions. [2025-03-08 06:24:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2025-03-08 06:24:09,069 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 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 99 [2025-03-08 06:24:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:09,617 INFO L225 Difference]: With dead ends: 450862 [2025-03-08 06:24:09,617 INFO L226 Difference]: Without dead ends: 376050 [2025-03-08 06:24:09,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6448 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2593, Invalid=17713, Unknown=0, NotChecked=0, Total=20306 [2025-03-08 06:24:09,717 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 4003 mSDsluCounter, 2607 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4003 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 3993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:09,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4003 Valid, 2752 Invalid, 3993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 06:24:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376050 states. [2025-03-08 06:24:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376050 to 215054. [2025-03-08 06:24:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215054 states, 215053 states have (on average 1.298303208976392) internal successors, (279204), 215053 states have internal predecessors, (279204), 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-08 06:24:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215054 states to 215054 states and 279204 transitions. [2025-03-08 06:24:13,311 INFO L78 Accepts]: Start accepts. Automaton has 215054 states and 279204 transitions. Word has length 99 [2025-03-08 06:24:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:13,311 INFO L471 AbstractCegarLoop]: Abstraction has 215054 states and 279204 transitions. [2025-03-08 06:24:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.625) internal successors, (276), 32 states have internal predecessors, (276), 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-08 06:24:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 215054 states and 279204 transitions. [2025-03-08 06:24:13,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:24:13,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:13,316 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:24:13,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:24:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:13,517 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-08 06:24:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:13,518 INFO L85 PathProgramCache]: Analyzing trace with hash -776217893, now seen corresponding path program 1 times [2025-03-08 06:24:13,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:13,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927794339] [2025-03-08 06:24:13,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:13,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:13,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:24:13,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:24:13,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:13,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:14,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927794339] [2025-03-08 06:24:14,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927794339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:14,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734676321] [2025-03-08 06:24:14,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:14,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:14,094 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-08 06:24:14,095 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-08 06:24:14,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:24:14,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:24:14,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:14,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 06:24:14,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:15,335 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 06:24:15,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:24:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734676321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:24:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 29 [2025-03-08 06:24:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424387329] [2025-03-08 06:24:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:15,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 06:24:15,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:15,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 06:24:15,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:24:15,342 INFO L87 Difference]: Start difference. First operand 215054 states and 279204 transitions. Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 14 states have internal predecessors, (94), 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-08 06:24:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:17,893 INFO L93 Difference]: Finished difference Result 560849 states and 729567 transitions. [2025-03-08 06:24:17,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:24:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 14 states have internal predecessors, (94), 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 100 [2025-03-08 06:24:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:18,444 INFO L225 Difference]: With dead ends: 560849 [2025-03-08 06:24:18,444 INFO L226 Difference]: Without dead ends: 385657 [2025-03-08 06:24:18,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=197, Invalid=1135, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 06:24:18,703 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 810 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:18,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 792 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:24:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385657 states. [2025-03-08 06:24:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385657 to 215054. [2025-03-08 06:24:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215054 states, 215053 states have (on average 1.2982939089433767) internal successors, (279202), 215053 states have internal predecessors, (279202), 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-08 06:24:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215054 states to 215054 states and 279202 transitions. [2025-03-08 06:24:22,208 INFO L78 Accepts]: Start accepts. Automaton has 215054 states and 279202 transitions. Word has length 100 [2025-03-08 06:24:22,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:22,208 INFO L471 AbstractCegarLoop]: Abstraction has 215054 states and 279202 transitions. [2025-03-08 06:24:22,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 14 states have internal predecessors, (94), 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-08 06:24:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 215054 states and 279202 transitions. [2025-03-08 06:24:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:24:22,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:22,218 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:24:22,233 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-08 06:24:22,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 06:24:22,419 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-08 06:24:22,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:22,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1936475267, now seen corresponding path program 1 times [2025-03-08 06:24:22,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:22,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244636783] [2025-03-08 06:24:22,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:22,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:22,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:24:22,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:24:22,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:22,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 06:24:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:22,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244636783] [2025-03-08 06:24:22,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244636783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:22,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:22,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 06:24:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204319748] [2025-03-08 06:24:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 06:24:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 06:24:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:24:22,882 INFO L87 Difference]: Start difference. First operand 215054 states and 279202 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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-08 06:24:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:24,403 INFO L93 Difference]: Finished difference Result 412390 states and 532263 transitions. [2025-03-08 06:24:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 06:24:24,404 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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 100 [2025-03-08 06:24:24,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:25,070 INFO L225 Difference]: With dead ends: 412390 [2025-03-08 06:24:25,070 INFO L226 Difference]: Without dead ends: 337572 [2025-03-08 06:24:25,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:24:25,133 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1077 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:25,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 600 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:24:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337572 states. [2025-03-08 06:24:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337572 to 215054. [2025-03-08 06:24:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215054 states, 215053 states have (on average 1.298289258926869) internal successors, (279201), 215053 states have internal predecessors, (279201), 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-08 06:24:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215054 states to 215054 states and 279201 transitions. [2025-03-08 06:24:28,327 INFO L78 Accepts]: Start accepts. Automaton has 215054 states and 279201 transitions. Word has length 100 [2025-03-08 06:24:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:28,327 INFO L471 AbstractCegarLoop]: Abstraction has 215054 states and 279201 transitions. [2025-03-08 06:24:28,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 11 states have internal predecessors, (94), 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-08 06:24:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 215054 states and 279201 transitions. [2025-03-08 06:24:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:24:28,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:28,332 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:24:28,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 06:24:28,332 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-08 06:24:28,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:28,337 INFO L85 PathProgramCache]: Analyzing trace with hash -794606380, now seen corresponding path program 1 times [2025-03-08 06:24:28,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:28,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119449909] [2025-03-08 06:24:28,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:28,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:28,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:24:28,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:24:28,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:28,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 06:24:28,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:28,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119449909] [2025-03-08 06:24:28,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119449909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:24:28,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:24:28,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 06:24:28,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352434964] [2025-03-08 06:24:28,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:24:28,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 06:24:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:28,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 06:24:28,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-08 06:24:28,999 INFO L87 Difference]: Start difference. First operand 215054 states and 279201 transitions. Second operand has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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-08 06:24:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:30,350 INFO L93 Difference]: Finished difference Result 404061 states and 525997 transitions. [2025-03-08 06:24:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 06:24:30,351 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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 101 [2025-03-08 06:24:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:30,747 INFO L225 Difference]: With dead ends: 404061 [2025-03-08 06:24:30,747 INFO L226 Difference]: Without dead ends: 320426 [2025-03-08 06:24:30,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2025-03-08 06:24:30,818 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 636 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:30,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 1440 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:24:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320426 states. [2025-03-08 06:24:33,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320426 to 215047. [2025-03-08 06:24:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215047 states, 215046 states have (on average 1.2982943184248952) internal successors, (279193), 215046 states have internal predecessors, (279193), 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-08 06:24:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215047 states to 215047 states and 279193 transitions. [2025-03-08 06:24:34,009 INFO L78 Accepts]: Start accepts. Automaton has 215047 states and 279193 transitions. Word has length 101 [2025-03-08 06:24:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:24:34,009 INFO L471 AbstractCegarLoop]: Abstraction has 215047 states and 279193 transitions. [2025-03-08 06:24:34,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.9375) internal successors, (95), 16 states have internal predecessors, (95), 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-08 06:24:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 215047 states and 279193 transitions. [2025-03-08 06:24:34,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:24:34,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:24:34,013 INFO L218 NwaCegarLoop]: trace histogram [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-08 06:24:34,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 06:24:34,014 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-08 06:24:34,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:24:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash 882917988, now seen corresponding path program 1 times [2025-03-08 06:24:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:24:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012429621] [2025-03-08 06:24:34,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:24:34,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:24:34,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:24:34,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:34,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:34,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:24:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012429621] [2025-03-08 06:24:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012429621] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:24:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522691524] [2025-03-08 06:24:34,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:24:34,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:24:34,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:24:34,223 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-08 06:24:34,224 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-08 06:24:34,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:24:34,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:24:34,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:24:34,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:24:34,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 06:24:34,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:24:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:34,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:24:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:24:35,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522691524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:24:35,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:24:35,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 11] total 30 [2025-03-08 06:24:35,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088177523] [2025-03-08 06:24:35,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:24:35,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:24:35,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:24:35,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:24:35,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:24:35,570 INFO L87 Difference]: Start difference. First operand 215047 states and 279193 transitions. Second operand has 30 states, 30 states have (on average 9.266666666666667) internal successors, (278), 30 states have internal predecessors, (278), 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-08 06:24:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:24:47,409 INFO L93 Difference]: Finished difference Result 787458 states and 1019605 transitions. [2025-03-08 06:24:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2025-03-08 06:24:47,409 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.266666666666667) internal successors, (278), 30 states have internal predecessors, (278), 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 101 [2025-03-08 06:24:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:24:48,212 INFO L225 Difference]: With dead ends: 787458 [2025-03-08 06:24:48,212 INFO L226 Difference]: Without dead ends: 615634 [2025-03-08 06:24:48,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45726 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12383, Invalid=93567, Unknown=0, NotChecked=0, Total=105950 [2025-03-08 06:24:48,297 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 3625 mSDsluCounter, 2845 mSDsCounter, 0 mSdLazyCounter, 3983 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3625 SdHoareTripleChecker+Valid, 3004 SdHoareTripleChecker+Invalid, 4054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:24:48,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3625 Valid, 3004 Invalid, 4054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3983 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 06:24:48,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615634 states. [2025-03-08 06:24:52,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615634 to 214789. [2025-03-08 06:24:52,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214789 states, 214788 states have (on average 1.2914967316609867) internal successors, (277398), 214788 states have internal predecessors, (277398), 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)