./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b67ecf5848be9c2e67ab202f4088edc38ff4a91991b1583263c2018f06031ba2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:34:58,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:34:58,575 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:34:58,578 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:34:58,579 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:34:58,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:34:58,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:34:58,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:34:58,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:34:58,596 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:34:58,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:34:58,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:34:58,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:34:58,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:34:58,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:34:58,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:34:58,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:34:58,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:34:58,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:34:58,598 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-jdk21/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 -> b67ecf5848be9c2e67ab202f4088edc38ff4a91991b1583263c2018f06031ba2 [2025-02-05 16:34:58,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:34:58,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:34:58,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:34:58,860 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:34:58,860 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:34:58,861 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:35:00,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85ab61f70/60551c6710d34e50a60b370e0902007b/FLAG6d7864585 [2025-02-05 16:35:00,572 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:35:00,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:35:00,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85ab61f70/60551c6710d34e50a60b370e0902007b/FLAG6d7864585 [2025-02-05 16:35:00,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/85ab61f70/60551c6710d34e50a60b370e0902007b [2025-02-05 16:35:00,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:35:00,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:35:00,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:00,618 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:35:00,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:35:00,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:00" (1/1) ... [2025-02-05 16:35:00,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f270079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:00, skipping insertion in model container [2025-02-05 16:35:00,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:35:00" (1/1) ... [2025-02-05 16:35:00,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:35:00,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12458,12471] [2025-02-05 16:35:00,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19724,19737] [2025-02-05 16:35:00,966 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22076,22089] [2025-02-05 16:35:00,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23196,23209] [2025-02-05 16:35:00,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26746,26759] [2025-02-05 16:35:00,997 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27869,27882] [2025-02-05 16:35:01,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30184,30197] [2025-02-05 16:35:01,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:01,322 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:35:01,379 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12458,12471] [2025-02-05 16:35:01,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[19724,19737] [2025-02-05 16:35:01,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[22076,22089] [2025-02-05 16:35:01,402 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23196,23209] [2025-02-05 16:35:01,409 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26746,26759] [2025-02-05 16:35:01,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[27869,27882] [2025-02-05 16:35:01,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30184,30197] [2025-02-05 16:35:01,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:35:01,628 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:35:01,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01 WrapperNode [2025-02-05 16:35:01,630 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:35:01,631 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:01,631 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:35:01,631 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:35:01,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,781 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7677 [2025-02-05 16:35:01,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:35:01,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:35:01,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:35:01,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:35:01,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,851 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-02-05 16:35:01,852 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,852 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,938 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:01,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:35:01,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:35:01,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:35:01,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:35:02,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (1/1) ... [2025-02-05 16:35:02,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:35:02,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:35:02,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:35:02,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:35:02,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:35:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:35:02,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:35:02,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:35:02,340 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:35:02,343 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:35:05,028 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4462: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~49#1; [2025-02-05 16:35:05,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: havoc main_~node3__m3~0#1; [2025-02-05 16:35:05,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4067: havoc main_~node4__m4~16#1; [2025-02-05 16:35:05,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5917: havoc main_~main____CPAchecker_TMP_0~61#1;havoc main_~__tmp_68~0#1, main_~assert__arg~67#1;havoc main_~check__tmp~71#1; [2025-02-05 16:35:05,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11070: havoc main_~main____CPAchecker_TMP_0~138#1;havoc main_~__tmp_145~0#1, main_~assert__arg~144#1;havoc main_~check__tmp~148#1; [2025-02-05 16:35:05,029 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9749: havoc main_~main____CPAchecker_TMP_0~118#1;havoc main_~__tmp_125~0#1, main_~assert__arg~124#1;havoc main_~check__tmp~128#1; [2025-02-05 16:35:05,030 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3275: havoc main_~node3__m3~6#1; [2025-02-05 16:35:05,030 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7107: havoc main_~main____CPAchecker_TMP_0~79#1;havoc main_~__tmp_86~0#1, main_~assert__arg~85#1;havoc main_~check__tmp~89#1; [2025-02-05 16:35:05,030 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6315: havoc main_~main____CPAchecker_TMP_0~67#1;havoc main_~__tmp_74~0#1, main_~assert__arg~73#1;havoc main_~check__tmp~77#1; [2025-02-05 16:35:05,030 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8034: havoc main_~main____CPAchecker_TMP_0~93#1;havoc main_~__tmp_100~0#1, main_~assert__arg~99#1;havoc main_~check__tmp~103#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6713: havoc main_~main____CPAchecker_TMP_0~73#1;havoc main_~__tmp_80~0#1, main_~assert__arg~79#1;havoc main_~check__tmp~83#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297: havoc main_~node3__m3~3#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8432: havoc main_~main____CPAchecker_TMP_0~99#1;havoc main_~__tmp_106~0#1, main_~assert__arg~105#1;havoc main_~check__tmp~109#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3808: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: havoc main_~node4__m4~12#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6848: havoc main_~main____CPAchecker_TMP_0~75#1;havoc main_~__tmp_82~0#1, main_~assert__arg~81#1;havoc main_~check__tmp~85#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8698: havoc main_~main____CPAchecker_TMP_0~102#1;havoc main_~__tmp_109~0#1, main_~assert__arg~108#1;havoc main_~check__tmp~112#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: havoc main_~main____CPAchecker_TMP_0~63#1;havoc main_~__tmp_70~0#1, main_~assert__arg~69#1;havoc main_~check__tmp~73#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5133: havoc main_~node4__m4~20#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5662: havoc main_~main____CPAchecker_TMP_0~57#1;havoc main_~__tmp_64~0#1, main_~assert__arg~63#1;havoc main_~check__tmp~67#1; [2025-02-05 16:35:05,031 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10815: havoc main_~main____CPAchecker_TMP_0~134#1;havoc main_~__tmp_141~0#1, main_~assert__arg~140#1;havoc main_~check__tmp~144#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L377: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4341: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4077: havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8173: havoc main_~main____CPAchecker_TMP_0~95#1;havoc main_~__tmp_102~0#1, main_~assert__arg~101#1;havoc main_~check__tmp~105#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3549: havoc main_~node4__m4~14#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3285: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2757: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7779: havoc main_~main____CPAchecker_TMP_0~89#1;havoc main_~__tmp_96~0#1, main_~assert__arg~95#1;havoc main_~check__tmp~99#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5797: havoc main_~main____CPAchecker_TMP_0~59#1;havoc main_~__tmp_66~0#1, main_~assert__arg~65#1;havoc main_~check__tmp~69#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5401: havoc main_~node2__m2~4#1; [2025-02-05 16:35:05,032 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4874: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7914: havoc main_~main____CPAchecker_TMP_0~91#1;havoc main_~__tmp_98~0#1, main_~assert__arg~97#1;havoc main_~check__tmp~101#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3818: havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6593: havoc main_~main____CPAchecker_TMP_0~71#1;havoc main_~__tmp_78~0#1, main_~assert__arg~77#1;havoc main_~check__tmp~81#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3026: havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1969: havoc main_~node3__m3~5#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2498: havoc main_~node4__m4~10#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1178: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L386: havoc main_~node4__m4~0#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5143: havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L915: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4615: havoc main_~node4__m4~18#1; [2025-02-05 16:35:05,033 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4351: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3294: havoc main_~node4__m4~13#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3559: havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2767: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L653: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5542: havoc main_~main____CPAchecker_TMP_0~55#1;havoc main_~__tmp_62~0#1, main_~assert__arg~61#1;havoc main_~check__tmp~65#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1314: havoc main_~node4__m4~4#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5411: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1845: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4884: havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10698: havoc main_~main____CPAchecker_TMP_0~133#1;havoc main_~__tmp_140~0#1, main_~assert__arg~139#1;havoc main_~check__tmp~143#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7659: havoc main_~main____CPAchecker_TMP_0~87#1;havoc main_~__tmp_94~0#1, main_~assert__arg~93#1;havoc main_~check__tmp~97#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7264: havoc main_~node4__m4~28#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1715: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:35:05,034 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2508: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6472: havoc main_~node3__m3~9#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1452: havoc main_~node4__m4~5#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4360: havoc main_~node4__m4~17#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4625: havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3304: havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4229: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10439: havoc main_~main____CPAchecker_TMP_0~129#1;havoc main_~__tmp_136~0#1, main_~assert__arg~135#1;havoc main_~check__tmp~139#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9647: havoc main_~main____CPAchecker_TMP_0~117#1;havoc main_~__tmp_124~0#1, main_~assert__arg~123#1;havoc main_~check__tmp~127#1; [2025-02-05 16:35:05,035 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7005: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6213: havoc main_~node4__m4~24#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5421: havoc main_~node3__m3~8#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc main_~node4__m4~8#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11764: havoc main_~main____CPAchecker_TMP_0~149#1;havoc main_~__tmp_156~0#1, main_~assert__arg~155#1;havoc main_~check__tmp~159#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8330: havoc main_~node4__m4~32#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10180: havoc main_~main____CPAchecker_TMP_0~125#1;havoc main_~__tmp_132~0#1, main_~assert__arg~131#1;havoc main_~check__tmp~135#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3970: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7538: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9388: havoc main_~main____CPAchecker_TMP_0~113#1;havoc main_~__tmp_120~0#1, main_~assert__arg~119#1;havoc main_~check__tmp~123#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7274: havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3178: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6746: havoc main_~node4__m4~26#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10578: havoc main_~main____CPAchecker_TMP_0~131#1;havoc main_~__tmp_138~0#1, main_~assert__arg~137#1;havoc main_~check__tmp~141#1; [2025-02-05 16:35:05,036 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6482: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5954: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L801: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4370: havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5295: havoc main_~main____CPAchecker_TMP_0~52#1;havoc main_~__tmp_59~0#1, main_~assert__arg~58#1;havoc main_~check__tmp~62#1;havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11505: havoc main_~main____CPAchecker_TMP_0~145#1;havoc main_~__tmp_152~0#1, main_~assert__arg~151#1;havoc main_~check__tmp~155#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8071: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3711: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7015: havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2919: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9129: havoc main_~main____CPAchecker_TMP_0~109#1;havoc main_~__tmp_116~0#1, main_~assert__arg~115#1;havoc main_~check__tmp~119#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6223: havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10319: havoc main_~main____CPAchecker_TMP_0~127#1;havoc main_~__tmp_134~0#1, main_~assert__arg~133#1;havoc main_~check__tmp~137#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5695: havoc main_~node4__m4~22#1; [2025-02-05 16:35:05,037 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5431: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9527: havoc main_~main____CPAchecker_TMP_0~115#1;havoc main_~__tmp_122~0#1, main_~assert__arg~121#1;havoc main_~check__tmp~125#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11246: havoc main_~main____CPAchecker_TMP_0~141#1;havoc main_~__tmp_148~0#1, main_~assert__arg~147#1;havoc main_~check__tmp~151#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5036: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9925: havoc main_~main____CPAchecker_TMP_0~121#1;havoc main_~__tmp_128~0#1, main_~assert__arg~127#1;havoc main_~check__tmp~131#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L544: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8340: havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7812: havoc main_~node4__m4~30#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11644: havoc main_~main____CPAchecker_TMP_0~147#1;havoc main_~__tmp_154~0#1, main_~assert__arg~153#1;havoc main_~check__tmp~157#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6491: havoc main_~node4__m4~25#1; [2025-02-05 16:35:05,038 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7548: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4113: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~44#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2660: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6756: havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10060: havoc main_~main____CPAchecker_TMP_0~123#1;havoc main_~__tmp_130~0#1, main_~assert__arg~129#1;havoc main_~check__tmp~133#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5964: havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9268: havoc main_~main____CPAchecker_TMP_0~111#1;havoc main_~__tmp_118~0#1, main_~assert__arg~117#1;havoc main_~check__tmp~121#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4777: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3456: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8081: havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8874: havoc main_~main____CPAchecker_TMP_0~105#1;havoc main_~__tmp_112~0#1, main_~assert__arg~111#1;havoc main_~check__tmp~115#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11385: havoc main_~main____CPAchecker_TMP_0~143#1;havoc main_~__tmp_150~0#1, main_~assert__arg~149#1;havoc main_~check__tmp~153#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3854: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~40#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5440: havoc main_~node4__m4~21#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3062: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5705: havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9009: havoc main_~main____CPAchecker_TMP_0~107#1;havoc main_~__tmp_114~0#1, main_~assert__arg~113#1;havoc main_~check__tmp~117#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10991: havoc main_~main____CPAchecker_TMP_0~137#1;havoc main_~__tmp_144~0#1, main_~assert__arg~143#1;havoc main_~check__tmp~147#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8613: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7557: havoc main_~node4__m4~29#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5179: havoc main_~main____CPAchecker_TMP_0~50#1;havoc main_~__tmp_57~0#1, main_~assert__arg~56#1;havoc main_~check__tmp~60#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7822: havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7426: havoc main_~main____CPAchecker_TMP_0~84#1;havoc main_~__tmp_91~0#1, main_~assert__arg~90#1;havoc main_~check__tmp~94#1;havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2405: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6501: havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-02-05 16:35:05,039 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1084: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11126: havoc main_~main____CPAchecker_TMP_0~139#1;havoc main_~__tmp_146~0#1, main_~assert__arg~145#1;havoc main_~check__tmp~149#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9805: havoc main_~main____CPAchecker_TMP_0~119#1;havoc main_~__tmp_126~0#1, main_~assert__arg~125#1;havoc main_~check__tmp~129#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~36#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1878: havoc main_~check__tmp~13#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2803: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4522: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4920: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~56#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7167: havoc main_~main____CPAchecker_TMP_0~80#1;havoc main_~__tmp_87~0#1, main_~assert__arg~86#1;havoc main_~check__tmp~90#1;havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5450: havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6375: havoc main_~main____CPAchecker_TMP_0~68#1;havoc main_~__tmp_75~0#1, main_~assert__arg~74#1;havoc main_~check__tmp~78#1;havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1222: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8754: havoc main_~main____CPAchecker_TMP_0~103#1;havoc main_~__tmp_110~0#1, main_~assert__arg~109#1;havoc main_~check__tmp~113#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L563: havoc main_~node2__m2~2#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1488: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8623: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7567: havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8492: havoc main_~main____CPAchecker_TMP_0~100#1;havoc main_~__tmp_107~0#1, main_~assert__arg~106#1;havoc main_~check__tmp~110#1;havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L829: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4661: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~52#1; [2025-02-05 16:35:05,040 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10871: havoc main_~main____CPAchecker_TMP_0~135#1;havoc main_~__tmp_142~0#1, main_~assert__arg~141#1;havoc main_~check__tmp~145#1; [2025-02-05 16:35:05,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1358: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:35:05,041 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3340: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~32#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6908: havoc main_~main____CPAchecker_TMP_0~76#1;havoc main_~__tmp_83~0#1, main_~assert__arg~82#1;havoc main_~check__tmp~86#1;havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10476: havoc main_~node4__m4~40#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6116: havoc main_~main____CPAchecker_TMP_0~64#1;havoc main_~__tmp_71~0#1, main_~assert__arg~70#1;havoc main_~check__tmp~74#1;havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9684: havoc main_~node3__m3~12#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2022: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8233: havoc main_~main____CPAchecker_TMP_0~96#1;havoc main_~__tmp_103~0#1, main_~assert__arg~102#1;havoc main_~check__tmp~106#1;havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1759: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7310: havoc main_~main____CPAchecker_TMP_0~82#1;havoc main_~__tmp_89~0#1, main_~assert__arg~88#1;havoc main_~check__tmp~92#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10217: havoc main_~node4__m4~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5857: havoc main_~main____CPAchecker_TMP_0~60#1;havoc main_~__tmp_67~0#1, main_~assert__arg~66#1;havoc main_~check__tmp~70#1;havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9425: havoc main_~node4__m4~36#1; [2025-02-05 16:35:05,042 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8633: havoc main_~node3__m3~11#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4406: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~48#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7974: havoc main_~main____CPAchecker_TMP_0~92#1;havoc main_~__tmp_99~0#1, main_~assert__arg~98#1;havoc main_~check__tmp~102#1;havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6653: havoc main_~main____CPAchecker_TMP_0~72#1;havoc main_~__tmp_79~0#1, main_~assert__arg~78#1;havoc main_~check__tmp~82#1;havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11542: havoc main_~node4__m4~44#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10750: havoc main_~node3__m3~13#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10486: havoc main_~node4____CPAchecker_TMP_0~32#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L973: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7051: havoc main_~main____CPAchecker_TMP_0~78#1;havoc main_~__tmp_85~0#1, main_~assert__arg~84#1;havoc main_~check__tmp~88#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9958: havoc main_~node4__m4~38#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9694: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6259: havoc main_~main____CPAchecker_TMP_0~66#1;havoc main_~__tmp_73~0#1, main_~assert__arg~72#1;havoc main_~check__tmp~76#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9166: havoc main_~node4__m4~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:35:05,043 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1637: havoc main_~node2__m2~3#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8376: havoc main_~main____CPAchecker_TMP_0~98#1;havoc main_~__tmp_105~0#1, main_~assert__arg~104#1;havoc main_~check__tmp~108#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11283: havoc main_~node4__m4~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L581: havoc main_~node3__m3~2#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5602: havoc main_~main____CPAchecker_TMP_0~56#1;havoc main_~__tmp_63~0#1, main_~assert__arg~62#1;havoc main_~check__tmp~66#1;havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10227: havoc main_~node4____CPAchecker_TMP_0~31#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6792: havoc main_~main____CPAchecker_TMP_0~74#1;havoc main_~__tmp_81~0#1, main_~assert__arg~80#1;havoc main_~check__tmp~84#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9435: havoc main_~node4____CPAchecker_TMP_0~28#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8907: havoc main_~node4__m4~34#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6000: havoc main_~main____CPAchecker_TMP_0~62#1;havoc main_~__tmp_69~0#1, main_~assert__arg~68#1;havoc main_~check__tmp~72#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8643: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7719: havoc main_~main____CPAchecker_TMP_0~88#1;havoc main_~__tmp_95~0#1, main_~assert__arg~94#1;havoc main_~check__tmp~98#1;havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11552: havoc main_~node4____CPAchecker_TMP_0~36#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8117: havoc main_~main____CPAchecker_TMP_0~94#1;havoc main_~__tmp_101~0#1, main_~assert__arg~100#1;havoc main_~check__tmp~104#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11024: havoc main_~node4__m4~42#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10760: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9703: havoc main_~node4__m4~37#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9968: havoc main_~node4____CPAchecker_TMP_0~30#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9176: havoc main_~node4____CPAchecker_TMP_0~27#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5741: havoc main_~main____CPAchecker_TMP_0~58#1;havoc main_~__tmp_65~0#1, main_~assert__arg~64#1;havoc main_~check__tmp~68#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4289: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~47#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L458: havoc main_~node2__m2~1#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11293: havoc main_~node4____CPAchecker_TMP_0~35#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7858: havoc main_~main____CPAchecker_TMP_0~90#1;havoc main_~__tmp_97~0#1, main_~assert__arg~96#1;havoc main_~check__tmp~100#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L327: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6537: havoc main_~main____CPAchecker_TMP_0~70#1;havoc main_~__tmp_77~0#1, main_~assert__arg~76#1;havoc main_~check__tmp~80#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8652: havoc main_~node4__m4~33#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8917: havoc main_~node4____CPAchecker_TMP_0~26#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4030: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~43#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10769: havoc main_~node4__m4~41#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3238: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11034: havoc main_~node4____CPAchecker_TMP_0~34#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1521: havoc main_~check__tmp~9#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9713: havoc main_~node4____CPAchecker_TMP_0~29#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10638: havoc main_~main____CPAchecker_TMP_0~132#1;havoc main_~__tmp_139~0#1, main_~assert__arg~138#1;havoc main_~check__tmp~142#1;havoc main_~node4____CPAchecker_TMP_1~32#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1654: havoc main_~node3__m3~4#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5486: havoc main_~main____CPAchecker_TMP_0~54#1;havoc main_~__tmp_61~0#1, main_~assert__arg~60#1;havoc main_~check__tmp~64#1; [2025-02-05 16:35:05,044 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5355: havoc main_~main____CPAchecker_TMP_0~53#1;havoc main_~__tmp_60~0#1, main_~assert__arg~59#1;havoc main_~check__tmp~63#1; [2025-02-05 16:35:05,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L599: havoc main_~node4__m4~2#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3771: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~39#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7603: havoc main_~main____CPAchecker_TMP_0~86#1;havoc main_~__tmp_93~0#1, main_~assert__arg~92#1;havoc main_~check__tmp~96#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L337: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10379: havoc main_~main____CPAchecker_TMP_0~128#1;havoc main_~__tmp_135~0#1, main_~assert__arg~134#1;havoc main_~check__tmp~138#1;havoc main_~node4____CPAchecker_TMP_1~31#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4169: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~45#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2055: havoc main_~check__tmp~15#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9587: havoc main_~main____CPAchecker_TMP_0~116#1;havoc main_~__tmp_123~0#1, main_~assert__arg~122#1;havoc main_~check__tmp~126#1;havoc main_~node4____CPAchecker_TMP_1~28#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8662: havoc main_~node4____CPAchecker_TMP_0~25#1; [2025-02-05 16:35:05,048 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5096: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~59#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1001: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10779: havoc main_~node4____CPAchecker_TMP_0~33#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11704: havoc main_~main____CPAchecker_TMP_0~148#1;havoc main_~__tmp_155~0#1, main_~assert__arg~154#1;havoc main_~check__tmp~158#1;havoc main_~node4____CPAchecker_TMP_1~36#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134: havoc main_~node4__m4~3#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2720: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3910: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~41#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10120: havoc main_~main____CPAchecker_TMP_0~124#1;havoc main_~__tmp_131~0#1, main_~assert__arg~130#1;havoc main_~check__tmp~134#1;havoc main_~node4____CPAchecker_TMP_1~30#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L475: havoc main_~node3__m3~1#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3118: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9328: havoc main_~main____CPAchecker_TMP_0~112#1;havoc main_~__tmp_119~0#1, main_~assert__arg~118#1;havoc main_~check__tmp~122#1;havoc main_~node4____CPAchecker_TMP_1~27#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4837: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~55#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3516: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~35#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1402: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11445: havoc main_~main____CPAchecker_TMP_0~144#1;havoc main_~__tmp_151~0#1, main_~assert__arg~150#1;havoc main_~check__tmp~154#1;havoc main_~node4____CPAchecker_TMP_1~35#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5235: havoc main_~main____CPAchecker_TMP_0~51#1;havoc main_~__tmp_58~0#1, main_~assert__arg~57#1;havoc main_~check__tmp~61#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L347: havoc main_~node2__m2~0#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3651: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~37#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10522: havoc main_~main____CPAchecker_TMP_0~130#1;havoc main_~__tmp_137~0#1, main_~assert__arg~136#1;havoc main_~check__tmp~140#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9069: havoc main_~main____CPAchecker_TMP_0~108#1;havoc main_~__tmp_115~0#1, main_~assert__arg~114#1;havoc main_~check__tmp~118#1;havoc main_~node4____CPAchecker_TMP_1~26#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1671: havoc main_~node4__m4~6#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7486: havoc main_~main____CPAchecker_TMP_0~85#1;havoc main_~__tmp_92~0#1, main_~assert__arg~91#1;havoc main_~check__tmp~95#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2465: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11186: havoc main_~main____CPAchecker_TMP_0~140#1;havoc main_~__tmp_147~0#1, main_~assert__arg~146#1;havoc main_~check__tmp~150#1;havoc main_~node4____CPAchecker_TMP_1~34#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4976: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~57#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9865: havoc main_~main____CPAchecker_TMP_0~120#1;havoc main_~__tmp_127~0#1, main_~assert__arg~126#1;havoc main_~check__tmp~130#1;havoc main_~node4____CPAchecker_TMP_1~29#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10263: havoc main_~main____CPAchecker_TMP_0~126#1;havoc main_~__tmp_133~0#1, main_~assert__arg~132#1;havoc main_~check__tmp~136#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2600: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4582: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~51#1; [2025-02-05 16:35:05,049 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9471: havoc main_~main____CPAchecker_TMP_0~114#1;havoc main_~__tmp_121~0#1, main_~assert__arg~120#1;havoc main_~check__tmp~124#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1809: havoc main_~node4__m4~7#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7227: havoc main_~main____CPAchecker_TMP_0~81#1;havoc main_~__tmp_88~0#1, main_~assert__arg~87#1;havoc main_~check__tmp~91#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4717: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~53#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11588: havoc main_~main____CPAchecker_TMP_0~146#1;havoc main_~__tmp_153~0#1, main_~assert__arg~152#1;havoc main_~check__tmp~156#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3396: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~33#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6435: havoc main_~main____CPAchecker_TMP_0~69#1;havoc main_~__tmp_76~0#1, main_~assert__arg~75#1;havoc main_~check__tmp~79#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8814: havoc main_~main____CPAchecker_TMP_0~104#1;havoc main_~__tmp_111~0#1, main_~assert__arg~110#1;havoc main_~check__tmp~114#1;havoc main_~node4____CPAchecker_TMP_1~25#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10004: havoc main_~main____CPAchecker_TMP_0~122#1;havoc main_~__tmp_129~0#1, main_~assert__arg~128#1;havoc main_~check__tmp~132#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L887: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L9212: havoc main_~main____CPAchecker_TMP_0~110#1;havoc main_~__tmp_117~0#1, main_~assert__arg~116#1;havoc main_~check__tmp~120#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L492: havoc main_~node4__m4~1#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8552: havoc main_~main____CPAchecker_TMP_0~101#1;havoc main_~__tmp_108~0#1, main_~assert__arg~107#1;havoc main_~check__tmp~111#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10931: havoc main_~main____CPAchecker_TMP_0~136#1;havoc main_~__tmp_143~0#1, main_~assert__arg~142#1;havoc main_~check__tmp~146#1;havoc main_~node4____CPAchecker_TMP_1~33#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6968: havoc main_~main____CPAchecker_TMP_0~77#1;havoc main_~__tmp_84~0#1, main_~assert__arg~83#1;havoc main_~check__tmp~87#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6176: havoc main_~main____CPAchecker_TMP_0~65#1;havoc main_~__tmp_72~0#1, main_~assert__arg~71#1;havoc main_~check__tmp~75#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L11329: havoc main_~main____CPAchecker_TMP_0~142#1;havoc main_~__tmp_149~0#1, main_~assert__arg~148#1;havoc main_~check__tmp~152#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7366: havoc main_~main____CPAchecker_TMP_0~83#1;havoc main_~__tmp_90~0#1, main_~assert__arg~89#1;havoc main_~check__tmp~93#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8953: havoc main_~main____CPAchecker_TMP_0~106#1;havoc main_~__tmp_113~0#1, main_~assert__arg~112#1;havoc main_~check__tmp~116#1; [2025-02-05 16:35:05,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8293: havoc main_~main____CPAchecker_TMP_0~97#1;havoc main_~__tmp_104~0#1, main_~assert__arg~103#1;havoc main_~check__tmp~107#1; [2025-02-05 16:35:05,241 INFO L? ?]: Removed 1280 outVars from TransFormulas that were not future-live. [2025-02-05 16:35:05,242 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:35:05,307 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:35:05,307 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:35:05,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:05 BoogieIcfgContainer [2025-02-05 16:35:05,308 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:35:05,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:35:05,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:35:05,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:35:05,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:35:00" (1/3) ... [2025-02-05 16:35:05,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666d5b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:05, skipping insertion in model container [2025-02-05 16:35:05,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:35:01" (2/3) ... [2025-02-05 16:35:05,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666d5b95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:35:05, skipping insertion in model container [2025-02-05 16:35:05,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:35:05" (3/3) ... [2025-02-05 16:35:05,314 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-05 16:35:05,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:35:05,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 1106 locations, 1 initial locations, 0 loop locations, and 7 error locations. [2025-02-05 16:35:05,434 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:35:05,454 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;@63b5b2ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:35:05,457 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-05 16:35:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 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-02-05 16:35:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:35:05,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:05,483 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] [2025-02-05 16:35:05,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1718258462, now seen corresponding path program 1 times [2025-02-05 16:35:05,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:05,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107248475] [2025-02-05 16:35:05,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:05,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:35:05,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:35:05,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:05,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:05,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107248475] [2025-02-05 16:35:05,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107248475] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:05,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:05,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:05,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889021964] [2025-02-05 16:35:05,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:05,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:05,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:05,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:05,861 INFO L87 Difference]: Start difference. First operand has 1106 states, 1098 states have (on average 1.8852459016393444) internal successors, (2070), 1105 states have internal predecessors, (2070), 0 states have call successors, (0), 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 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-05 16:35:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:06,046 INFO L93 Difference]: Finished difference Result 1465 states and 2651 transitions. [2025-02-05 16:35:06,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:06,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:35:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:06,065 INFO L225 Difference]: With dead ends: 1465 [2025-02-05 16:35:06,066 INFO L226 Difference]: Without dead ends: 1288 [2025-02-05 16:35:06,072 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-02-05 16:35:06,073 INFO L435 NwaCegarLoop]: 2055 mSDtfsCounter, 969 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 3330 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:06,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 3330 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:06,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-02-05 16:35:06,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1280. [2025-02-05 16:35:06,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1273 states have (on average 1.3165750196386488) internal successors, (1676), 1279 states have internal predecessors, (1676), 0 states have call successors, (0), 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-02-05 16:35:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1676 transitions. [2025-02-05 16:35:06,163 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1676 transitions. Word has length 64 [2025-02-05 16:35:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:06,164 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1676 transitions. [2025-02-05 16:35:06,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-05 16:35:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1676 transitions. [2025-02-05 16:35:06,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:35:06,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:06,170 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] [2025-02-05 16:35:06,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:35:06,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:06,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:06,171 INFO L85 PathProgramCache]: Analyzing trace with hash -639613202, now seen corresponding path program 1 times [2025-02-05 16:35:06,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873413962] [2025-02-05 16:35:06,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:06,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:06,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:35:06,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:35:06,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:06,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873413962] [2025-02-05 16:35:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873413962] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293357370] [2025-02-05 16:35:06,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:06,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:06,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:06,456 INFO L87 Difference]: Start difference. First operand 1280 states and 1676 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-05 16:35:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:07,149 INFO L93 Difference]: Finished difference Result 2262 states and 3056 transitions. [2025-02-05 16:35:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-02-05 16:35:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:07,157 INFO L225 Difference]: With dead ends: 2262 [2025-02-05 16:35:07,157 INFO L226 Difference]: Without dead ends: 1291 [2025-02-05 16:35:07,159 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-02-05 16:35:07,162 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 3665 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3665 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:07,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3665 Valid, 834 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:35:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2025-02-05 16:35:07,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1283. [2025-02-05 16:35:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 1276 states have (on average 1.3691222570532915) internal successors, (1747), 1282 states have internal predecessors, (1747), 0 states have call successors, (0), 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-02-05 16:35:07,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1747 transitions. [2025-02-05 16:35:07,202 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1747 transitions. Word has length 64 [2025-02-05 16:35:07,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:07,203 INFO L471 AbstractCegarLoop]: Abstraction has 1283 states and 1747 transitions. [2025-02-05 16:35:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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-02-05 16:35:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1747 transitions. [2025-02-05 16:35:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:07,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:07,210 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] [2025-02-05 16:35:07,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:35:07,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:07,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash 788624528, now seen corresponding path program 1 times [2025-02-05 16:35:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790014668] [2025-02-05 16:35:07,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:07,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:07,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:07,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:07,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:07,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:07,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:07,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790014668] [2025-02-05 16:35:07,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790014668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:07,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:07,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:07,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513333048] [2025-02-05 16:35:07,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:07,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:07,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:07,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:07,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:07,324 INFO L87 Difference]: Start difference. First operand 1283 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:07,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:07,355 INFO L93 Difference]: Finished difference Result 2386 states and 3309 transitions. [2025-02-05 16:35:07,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:07,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 16:35:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:07,361 INFO L225 Difference]: With dead ends: 2386 [2025-02-05 16:35:07,361 INFO L226 Difference]: Without dead ends: 1817 [2025-02-05 16:35:07,362 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-02-05 16:35:07,362 INFO L435 NwaCegarLoop]: 1421 mSDtfsCounter, 897 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:07,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2138 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-02-05 16:35:07,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1807. [2025-02-05 16:35:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1800 states have (on average 1.3583333333333334) internal successors, (2445), 1806 states have internal predecessors, (2445), 0 states have call successors, (0), 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-02-05 16:35:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2445 transitions. [2025-02-05 16:35:07,390 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2445 transitions. Word has length 65 [2025-02-05 16:35:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2445 transitions. [2025-02-05 16:35:07,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2445 transitions. [2025-02-05 16:35:07,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:07,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:07,393 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] [2025-02-05 16:35:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:35:07,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:07,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:07,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2019045977, now seen corresponding path program 1 times [2025-02-05 16:35:07,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:07,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155881612] [2025-02-05 16:35:07,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:07,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:07,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:07,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:07,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:07,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155881612] [2025-02-05 16:35:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155881612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:07,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519865543] [2025-02-05 16:35:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:07,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:07,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:07,577 INFO L87 Difference]: Start difference. First operand 1807 states and 2445 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:08,056 INFO L93 Difference]: Finished difference Result 3177 states and 4369 transitions. [2025-02-05 16:35:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:08,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 16:35:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:08,063 INFO L225 Difference]: With dead ends: 3177 [2025-02-05 16:35:08,063 INFO L226 Difference]: Without dead ends: 1975 [2025-02-05 16:35:08,065 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-02-05 16:35:08,066 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 3060 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3060 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:08,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3060 Valid, 696 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:35:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-02-05 16:35:08,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1964. [2025-02-05 16:35:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1964 states, 1957 states have (on average 1.3479816044966786) internal successors, (2638), 1963 states have internal predecessors, (2638), 0 states have call successors, (0), 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-02-05 16:35:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 2638 transitions. [2025-02-05 16:35:08,100 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 2638 transitions. Word has length 65 [2025-02-05 16:35:08,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:08,101 INFO L471 AbstractCegarLoop]: Abstraction has 1964 states and 2638 transitions. [2025-02-05 16:35:08,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:08,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 2638 transitions. [2025-02-05 16:35:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:35:08,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:08,104 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] [2025-02-05 16:35:08,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:35:08,104 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:08,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash -794782081, now seen corresponding path program 1 times [2025-02-05 16:35:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:08,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160005738] [2025-02-05 16:35:08,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:08,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:35:08,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:35:08,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:08,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160005738] [2025-02-05 16:35:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160005738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:08,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516035321] [2025-02-05 16:35:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:08,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:08,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:08,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:08,260 INFO L87 Difference]: Start difference. First operand 1964 states and 2638 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:08,643 INFO L93 Difference]: Finished difference Result 4307 states and 5977 transitions. [2025-02-05 16:35:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:08,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-02-05 16:35:08,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:08,651 INFO L225 Difference]: With dead ends: 4307 [2025-02-05 16:35:08,651 INFO L226 Difference]: Without dead ends: 2633 [2025-02-05 16:35:08,653 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-02-05 16:35:08,653 INFO L435 NwaCegarLoop]: 490 mSDtfsCounter, 2721 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2721 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:08,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2721 Valid, 647 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2025-02-05 16:35:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2625. [2025-02-05 16:35:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2625 states, 2618 states have (on average 1.394576012223071) internal successors, (3651), 2624 states have internal predecessors, (3651), 0 states have call successors, (0), 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-02-05 16:35:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 3651 transitions. [2025-02-05 16:35:08,696 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 3651 transitions. Word has length 65 [2025-02-05 16:35:08,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:08,697 INFO L471 AbstractCegarLoop]: Abstraction has 2625 states and 3651 transitions. [2025-02-05 16:35:08,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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-02-05 16:35:08,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 3651 transitions. [2025-02-05 16:35:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:35:08,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:08,699 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] [2025-02-05 16:35:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:35:08,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1212043705, now seen corresponding path program 1 times [2025-02-05 16:35:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609415949] [2025-02-05 16:35:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:08,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:35:08,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:35:08,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:08,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:08,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609415949] [2025-02-05 16:35:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609415949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:08,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501451045] [2025-02-05 16:35:08,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:08,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:08,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:08,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:08,764 INFO L87 Difference]: Start difference. First operand 2625 states and 3651 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-05 16:35:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:08,808 INFO L93 Difference]: Finished difference Result 5454 states and 7689 transitions. [2025-02-05 16:35:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-02-05 16:35:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:08,819 INFO L225 Difference]: With dead ends: 5454 [2025-02-05 16:35:08,819 INFO L226 Difference]: Without dead ends: 3656 [2025-02-05 16:35:08,822 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-02-05 16:35:08,822 INFO L435 NwaCegarLoop]: 963 mSDtfsCounter, 584 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:08,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1530 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2025-02-05 16:35:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3639. [2025-02-05 16:35:08,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3639 states, 3632 states have (on average 1.3755506607929515) internal successors, (4996), 3638 states have internal predecessors, (4996), 0 states have call successors, (0), 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-02-05 16:35:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3639 states to 3639 states and 4996 transitions. [2025-02-05 16:35:08,957 INFO L78 Accepts]: Start accepts. Automaton has 3639 states and 4996 transitions. Word has length 66 [2025-02-05 16:35:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:08,958 INFO L471 AbstractCegarLoop]: Abstraction has 3639 states and 4996 transitions. [2025-02-05 16:35:08,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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-02-05 16:35:08,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3639 states and 4996 transitions. [2025-02-05 16:35:08,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:08,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:08,964 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] [2025-02-05 16:35:08,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:35:08,965 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:08,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:08,965 INFO L85 PathProgramCache]: Analyzing trace with hash 102780454, now seen corresponding path program 1 times [2025-02-05 16:35:08,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:08,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662864855] [2025-02-05 16:35:08,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:09,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:09,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:09,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:09,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:09,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:09,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662864855] [2025-02-05 16:35:09,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662864855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:09,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:09,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:35:09,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224306860] [2025-02-05 16:35:09,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:09,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:35:09,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:09,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:35:09,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:35:09,120 INFO L87 Difference]: Start difference. First operand 3639 states and 4996 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-05 16:35:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:09,520 INFO L93 Difference]: Finished difference Result 8859 states and 12400 transitions. [2025-02-05 16:35:09,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:35:09,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:09,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:09,537 INFO L225 Difference]: With dead ends: 8859 [2025-02-05 16:35:09,537 INFO L226 Difference]: Without dead ends: 5657 [2025-02-05 16:35:09,543 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-02-05 16:35:09,543 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 2411 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2411 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:09,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2411 Valid, 583 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:09,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5657 states. [2025-02-05 16:35:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5657 to 5649. [2025-02-05 16:35:09,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5649 states, 5642 states have (on average 1.390464374335342) internal successors, (7845), 5648 states have internal predecessors, (7845), 0 states have call successors, (0), 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-02-05 16:35:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 7845 transitions. [2025-02-05 16:35:09,647 INFO L78 Accepts]: Start accepts. Automaton has 5649 states and 7845 transitions. Word has length 67 [2025-02-05 16:35:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:09,647 INFO L471 AbstractCegarLoop]: Abstraction has 5649 states and 7845 transitions. [2025-02-05 16:35:09,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-05 16:35:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 5649 states and 7845 transitions. [2025-02-05 16:35:09,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:35:09,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:09,654 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] [2025-02-05 16:35:09,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:35:09,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:09,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:09,655 INFO L85 PathProgramCache]: Analyzing trace with hash 327520293, now seen corresponding path program 1 times [2025-02-05 16:35:09,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:09,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442365036] [2025-02-05 16:35:09,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:09,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:09,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:35:09,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:35:09,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:09,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:09,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442365036] [2025-02-05 16:35:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442365036] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665984681] [2025-02-05 16:35:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:09,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:09,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:09,730 INFO L87 Difference]: Start difference. First operand 5649 states and 7845 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-05 16:35:09,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:09,793 INFO L93 Difference]: Finished difference Result 12003 states and 16851 transitions. [2025-02-05 16:35:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:09,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-02-05 16:35:09,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:09,821 INFO L225 Difference]: With dead ends: 12003 [2025-02-05 16:35:09,821 INFO L226 Difference]: Without dead ends: 7617 [2025-02-05 16:35:09,830 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-02-05 16:35:09,830 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 400 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:09,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1186 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:09,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7617 states. [2025-02-05 16:35:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7617 to 7582. [2025-02-05 16:35:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7582 states, 7575 states have (on average 1.372145214521452) internal successors, (10394), 7581 states have internal predecessors, (10394), 0 states have call successors, (0), 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-02-05 16:35:10,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 10394 transitions. [2025-02-05 16:35:10,068 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 10394 transitions. Word has length 67 [2025-02-05 16:35:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:10,069 INFO L471 AbstractCegarLoop]: Abstraction has 7582 states and 10394 transitions. [2025-02-05 16:35:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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-02-05 16:35:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 10394 transitions. [2025-02-05 16:35:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:10,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:10,074 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] [2025-02-05 16:35:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:35:10,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1709772015, now seen corresponding path program 1 times [2025-02-05 16:35:10,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:10,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620983609] [2025-02-05 16:35:10,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:10,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:10,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620983609] [2025-02-05 16:35:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620983609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:10,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36169377] [2025-02-05 16:35:10,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:10,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:10,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:10,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:10,260 INFO L87 Difference]: Start difference. First operand 7582 states and 10394 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:11,002 INFO L93 Difference]: Finished difference Result 21804 states and 30442 transitions. [2025-02-05 16:35:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:35:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:11,062 INFO L225 Difference]: With dead ends: 21804 [2025-02-05 16:35:11,066 INFO L226 Difference]: Without dead ends: 18153 [2025-02-05 16:35:11,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:11,082 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 3224 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3224 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:11,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3224 Valid, 1122 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:35:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18153 states. [2025-02-05 16:35:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18153 to 7650. [2025-02-05 16:35:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7650 states, 7643 states have (on average 1.3714510009158707) internal successors, (10482), 7649 states have internal predecessors, (10482), 0 states have call successors, (0), 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-02-05 16:35:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7650 states to 7650 states and 10482 transitions. [2025-02-05 16:35:11,319 INFO L78 Accepts]: Start accepts. Automaton has 7650 states and 10482 transitions. Word has length 68 [2025-02-05 16:35:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:11,320 INFO L471 AbstractCegarLoop]: Abstraction has 7650 states and 10482 transitions. [2025-02-05 16:35:11,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7650 states and 10482 transitions. [2025-02-05 16:35:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:11,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:11,333 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] [2025-02-05 16:35:11,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:35:11,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:11,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:11,334 INFO L85 PathProgramCache]: Analyzing trace with hash -19122361, now seen corresponding path program 1 times [2025-02-05 16:35:11,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:11,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800026906] [2025-02-05 16:35:11,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:11,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:11,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:11,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:11,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800026906] [2025-02-05 16:35:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800026906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016296147] [2025-02-05 16:35:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:11,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:11,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:11,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:11,590 INFO L87 Difference]: Start difference. First operand 7650 states and 10482 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:12,199 INFO L93 Difference]: Finished difference Result 19874 states and 27644 transitions. [2025-02-05 16:35:12,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:12,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:35:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:12,224 INFO L225 Difference]: With dead ends: 19874 [2025-02-05 16:35:12,224 INFO L226 Difference]: Without dead ends: 16405 [2025-02-05 16:35:12,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:12,233 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 3128 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3128 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:12,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3128 Valid, 1104 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16405 states. [2025-02-05 16:35:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16405 to 7772. [2025-02-05 16:35:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7772 states, 7765 states have (on average 1.3707662588538312) internal successors, (10644), 7771 states have internal predecessors, (10644), 0 states have call successors, (0), 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-02-05 16:35:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7772 states to 7772 states and 10644 transitions. [2025-02-05 16:35:12,360 INFO L78 Accepts]: Start accepts. Automaton has 7772 states and 10644 transitions. Word has length 68 [2025-02-05 16:35:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:12,360 INFO L471 AbstractCegarLoop]: Abstraction has 7772 states and 10644 transitions. [2025-02-05 16:35:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 7772 states and 10644 transitions. [2025-02-05 16:35:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:12,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:12,365 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] [2025-02-05 16:35:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:35:12,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 285260238, now seen corresponding path program 1 times [2025-02-05 16:35:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928008244] [2025-02-05 16:35:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:12,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:12,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:12,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:12,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:12,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928008244] [2025-02-05 16:35:12,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928008244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:12,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:12,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:12,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601966150] [2025-02-05 16:35:12,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:12,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:12,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:12,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:12,506 INFO L87 Difference]: Start difference. First operand 7772 states and 10644 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:13,322 INFO L93 Difference]: Finished difference Result 16402 states and 22623 transitions. [2025-02-05 16:35:13,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:35:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:13,364 INFO L225 Difference]: With dead ends: 16402 [2025-02-05 16:35:13,367 INFO L226 Difference]: Without dead ends: 12731 [2025-02-05 16:35:13,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:13,383 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 2880 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2880 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:13,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2880 Valid, 1060 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 16:35:13,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12731 states. [2025-02-05 16:35:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12731 to 7807. [2025-02-05 16:35:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7807 states, 7800 states have (on average 1.3703846153846153) internal successors, (10689), 7806 states have internal predecessors, (10689), 0 states have call successors, (0), 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-02-05 16:35:13,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7807 states to 7807 states and 10689 transitions. [2025-02-05 16:35:13,616 INFO L78 Accepts]: Start accepts. Automaton has 7807 states and 10689 transitions. Word has length 68 [2025-02-05 16:35:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:13,617 INFO L471 AbstractCegarLoop]: Abstraction has 7807 states and 10689 transitions. [2025-02-05 16:35:13,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 7807 states and 10689 transitions. [2025-02-05 16:35:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:35:13,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:13,627 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] [2025-02-05 16:35:13,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:35:13,628 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:13,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1432095475, now seen corresponding path program 1 times [2025-02-05 16:35:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:13,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779250553] [2025-02-05 16:35:13,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:13,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:13,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:35:13,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:35:13,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779250553] [2025-02-05 16:35:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779250553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:13,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597789239] [2025-02-05 16:35:13,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:35:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:13,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:35:13,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:35:13,763 INFO L87 Difference]: Start difference. First operand 7807 states and 10689 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:14,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:14,300 INFO L93 Difference]: Finished difference Result 18043 states and 24979 transitions. [2025-02-05 16:35:14,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:14,301 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-02-05 16:35:14,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:14,321 INFO L225 Difference]: With dead ends: 18043 [2025-02-05 16:35:14,322 INFO L226 Difference]: Without dead ends: 14838 [2025-02-05 16:35:14,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:14,328 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 3051 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3051 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:14,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3051 Valid, 1085 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:14,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14838 states. [2025-02-05 16:35:14,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14838 to 7878. [2025-02-05 16:35:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7878 states, 7871 states have (on average 1.3706009401600814) internal successors, (10788), 7877 states have internal predecessors, (10788), 0 states have call successors, (0), 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-02-05 16:35:14,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7878 states to 7878 states and 10788 transitions. [2025-02-05 16:35:14,443 INFO L78 Accepts]: Start accepts. Automaton has 7878 states and 10788 transitions. Word has length 68 [2025-02-05 16:35:14,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:14,443 INFO L471 AbstractCegarLoop]: Abstraction has 7878 states and 10788 transitions. [2025-02-05 16:35:14,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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-02-05 16:35:14,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7878 states and 10788 transitions. [2025-02-05 16:35:14,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:14,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:14,449 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] [2025-02-05 16:35:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:35:14,450 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1962422874, now seen corresponding path program 1 times [2025-02-05 16:35:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:14,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788782513] [2025-02-05 16:35:14,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:14,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:14,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:14,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788782513] [2025-02-05 16:35:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788782513] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:14,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:35:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471652615] [2025-02-05 16:35:14,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:14,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:35:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:14,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:35:14,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:35:14,776 INFO L87 Difference]: Start difference. First operand 7878 states and 10788 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:15,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:15,394 INFO L93 Difference]: Finished difference Result 16535 states and 22985 transitions. [2025-02-05 16:35:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:35:15,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:35:15,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:15,408 INFO L225 Difference]: With dead ends: 16535 [2025-02-05 16:35:15,408 INFO L226 Difference]: Without dead ends: 11022 [2025-02-05 16:35:15,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:15,414 INFO L435 NwaCegarLoop]: 421 mSDtfsCounter, 2838 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2838 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:15,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2838 Valid, 1561 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11022 states. [2025-02-05 16:35:15,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11022 to 7572. [2025-02-05 16:35:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7572 states, 7565 states have (on average 1.3688037012557832) internal successors, (10355), 7571 states have internal predecessors, (10355), 0 states have call successors, (0), 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-02-05 16:35:15,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7572 states to 7572 states and 10355 transitions. [2025-02-05 16:35:15,506 INFO L78 Accepts]: Start accepts. Automaton has 7572 states and 10355 transitions. Word has length 69 [2025-02-05 16:35:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:15,506 INFO L471 AbstractCegarLoop]: Abstraction has 7572 states and 10355 transitions. [2025-02-05 16:35:15,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:15,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 10355 transitions. [2025-02-05 16:35:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:15,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:15,511 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] [2025-02-05 16:35:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:35:15,511 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:15,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1938803911, now seen corresponding path program 1 times [2025-02-05 16:35:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490225294] [2025-02-05 16:35:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:15,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:15,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:15,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:15,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:15,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490225294] [2025-02-05 16:35:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490225294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708685265] [2025-02-05 16:35:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:15,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:15,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:15,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:15,800 INFO L87 Difference]: Start difference. First operand 7572 states and 10355 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:16,473 INFO L93 Difference]: Finished difference Result 16181 states and 22464 transitions. [2025-02-05 16:35:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:35:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:16,488 INFO L225 Difference]: With dead ends: 16181 [2025-02-05 16:35:16,488 INFO L226 Difference]: Without dead ends: 11383 [2025-02-05 16:35:16,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:16,493 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 3483 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3483 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:16,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3483 Valid, 1829 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11383 states. [2025-02-05 16:35:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11383 to 7563. [2025-02-05 16:35:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7563 states, 7556 states have (on average 1.368184224457385) internal successors, (10338), 7562 states have internal predecessors, (10338), 0 states have call successors, (0), 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-02-05 16:35:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7563 states to 7563 states and 10338 transitions. [2025-02-05 16:35:16,578 INFO L78 Accepts]: Start accepts. Automaton has 7563 states and 10338 transitions. Word has length 69 [2025-02-05 16:35:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:16,578 INFO L471 AbstractCegarLoop]: Abstraction has 7563 states and 10338 transitions. [2025-02-05 16:35:16,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 7563 states and 10338 transitions. [2025-02-05 16:35:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:16,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:16,583 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] [2025-02-05 16:35:16,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:35:16,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:16,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:16,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1342138928, now seen corresponding path program 1 times [2025-02-05 16:35:16,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:16,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709335684] [2025-02-05 16:35:16,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:16,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:16,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:16,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:16,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:16,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:16,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709335684] [2025-02-05 16:35:16,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709335684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:16,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:16,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:16,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537109269] [2025-02-05 16:35:16,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:16,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:16,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:16,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:16,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:16,852 INFO L87 Difference]: Start difference. First operand 7563 states and 10338 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:17,481 INFO L93 Difference]: Finished difference Result 16322 states and 22669 transitions. [2025-02-05 16:35:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:17,481 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:35:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:17,490 INFO L225 Difference]: With dead ends: 16322 [2025-02-05 16:35:17,490 INFO L226 Difference]: Without dead ends: 11491 [2025-02-05 16:35:17,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:35:17,496 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 3563 mSDsluCounter, 1335 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3563 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:17,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3563 Valid, 1777 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:17,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11491 states. [2025-02-05 16:35:17,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11491 to 7539. [2025-02-05 16:35:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7539 states, 7532 states have (on average 1.3673659054699947) internal successors, (10299), 7538 states have internal predecessors, (10299), 0 states have call successors, (0), 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-02-05 16:35:17,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7539 states to 7539 states and 10299 transitions. [2025-02-05 16:35:17,566 INFO L78 Accepts]: Start accepts. Automaton has 7539 states and 10299 transitions. Word has length 69 [2025-02-05 16:35:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:17,566 INFO L471 AbstractCegarLoop]: Abstraction has 7539 states and 10299 transitions. [2025-02-05 16:35:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7539 states and 10299 transitions. [2025-02-05 16:35:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:35:17,570 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:17,570 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] [2025-02-05 16:35:17,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:35:17,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash 905323558, now seen corresponding path program 1 times [2025-02-05 16:35:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:17,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560831049] [2025-02-05 16:35:17,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:17,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:35:17,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:35:17,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:17,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:17,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:17,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560831049] [2025-02-05 16:35:17,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560831049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:17,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:17,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:17,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301395640] [2025-02-05 16:35:17,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:17,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:17,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:17,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:17,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:17,837 INFO L87 Difference]: Start difference. First operand 7539 states and 10299 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:18,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:18,532 INFO L93 Difference]: Finished difference Result 16457 states and 22845 transitions. [2025-02-05 16:35:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-02-05 16:35:18,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:18,545 INFO L225 Difference]: With dead ends: 16457 [2025-02-05 16:35:18,545 INFO L226 Difference]: Without dead ends: 11402 [2025-02-05 16:35:18,549 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-02-05 16:35:18,550 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 3052 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:18,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 2263 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:35:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11402 states. [2025-02-05 16:35:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11402 to 7404. [2025-02-05 16:35:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7404 states, 7397 states have (on average 1.3667703122887658) internal successors, (10110), 7403 states have internal predecessors, (10110), 0 states have call successors, (0), 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-02-05 16:35:18,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7404 states to 7404 states and 10110 transitions. [2025-02-05 16:35:18,627 INFO L78 Accepts]: Start accepts. Automaton has 7404 states and 10110 transitions. Word has length 69 [2025-02-05 16:35:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:18,627 INFO L471 AbstractCegarLoop]: Abstraction has 7404 states and 10110 transitions. [2025-02-05 16:35:18,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 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-02-05 16:35:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7404 states and 10110 transitions. [2025-02-05 16:35:18,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:18,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:18,631 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] [2025-02-05 16:35:18,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:35:18,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:18,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:18,632 INFO L85 PathProgramCache]: Analyzing trace with hash -317392737, now seen corresponding path program 1 times [2025-02-05 16:35:18,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:18,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957219636] [2025-02-05 16:35:18,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:18,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:18,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:18,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:18,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:18,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:19,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957219636] [2025-02-05 16:35:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957219636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:19,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:19,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:35:19,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006087473] [2025-02-05 16:35:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:19,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:35:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:19,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:35:19,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:35:19,391 INFO L87 Difference]: Start difference. First operand 7404 states and 10110 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:20,757 INFO L93 Difference]: Finished difference Result 25731 states and 35950 transitions. [2025-02-05 16:35:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:35:20,757 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:20,782 INFO L225 Difference]: With dead ends: 25731 [2025-02-05 16:35:20,782 INFO L226 Difference]: Without dead ends: 20936 [2025-02-05 16:35:20,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:35:20,793 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 4611 mSDsluCounter, 3083 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 3682 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:20,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 3682 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:35:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20936 states. [2025-02-05 16:35:20,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20936 to 7390. [2025-02-05 16:35:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7390 states, 7384 states have (on average 1.3657908992416035) internal successors, (10085), 7389 states have internal predecessors, (10085), 0 states have call successors, (0), 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-02-05 16:35:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7390 states to 7390 states and 10085 transitions. [2025-02-05 16:35:20,912 INFO L78 Accepts]: Start accepts. Automaton has 7390 states and 10085 transitions. Word has length 70 [2025-02-05 16:35:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 7390 states and 10085 transitions. [2025-02-05 16:35:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 13 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 7390 states and 10085 transitions. [2025-02-05 16:35:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:20,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:20,916 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] [2025-02-05 16:35:20,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:35:20,916 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:20,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:20,917 INFO L85 PathProgramCache]: Analyzing trace with hash 20539696, now seen corresponding path program 1 times [2025-02-05 16:35:20,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:20,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351866194] [2025-02-05 16:35:20,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:20,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:20,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:20,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:20,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:21,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351866194] [2025-02-05 16:35:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351866194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:21,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:21,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:35:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501781298] [2025-02-05 16:35:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:21,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:35:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:21,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:35:21,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:21,355 INFO L87 Difference]: Start difference. First operand 7390 states and 10085 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:21,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:21,888 INFO L93 Difference]: Finished difference Result 17496 states and 24394 transitions. [2025-02-05 16:35:21,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:21,889 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:21,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:21,902 INFO L225 Difference]: With dead ends: 17496 [2025-02-05 16:35:21,903 INFO L226 Difference]: Without dead ends: 12436 [2025-02-05 16:35:21,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:35:21,909 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 4211 mSDsluCounter, 2945 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4211 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4211 Valid, 3558 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12436 states. [2025-02-05 16:35:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12436 to 7105. [2025-02-05 16:35:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 7101 states have (on average 1.367553865652725) internal successors, (9711), 7104 states have internal predecessors, (9711), 0 states have call successors, (0), 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-02-05 16:35:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 9711 transitions. [2025-02-05 16:35:21,997 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 9711 transitions. Word has length 70 [2025-02-05 16:35:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:21,997 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 9711 transitions. [2025-02-05 16:35:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 9711 transitions. [2025-02-05 16:35:22,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:22,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:22,002 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] [2025-02-05 16:35:22,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:35:22,003 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:22,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1159622793, now seen corresponding path program 1 times [2025-02-05 16:35:22,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:22,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866563033] [2025-02-05 16:35:22,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:22,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:22,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:22,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:22,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:22,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:22,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:22,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866563033] [2025-02-05 16:35:22,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866563033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:22,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:22,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:35:22,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902915549] [2025-02-05 16:35:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:22,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:35:22,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:22,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:35:22,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:35:22,430 INFO L87 Difference]: Start difference. First operand 7105 states and 9711 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:22,979 INFO L93 Difference]: Finished difference Result 17193 states and 23989 transitions. [2025-02-05 16:35:22,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:35:22,979 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:22,992 INFO L225 Difference]: With dead ends: 17193 [2025-02-05 16:35:22,993 INFO L226 Difference]: Without dead ends: 12325 [2025-02-05 16:35:22,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:35:23,001 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2855 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:23,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 3304 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:35:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12325 states. [2025-02-05 16:35:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12325 to 7018. [2025-02-05 16:35:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7018 states, 7015 states have (on average 1.3657875980042766) internal successors, (9581), 7017 states have internal predecessors, (9581), 0 states have call successors, (0), 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-02-05 16:35:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7018 states to 7018 states and 9581 transitions. [2025-02-05 16:35:23,082 INFO L78 Accepts]: Start accepts. Automaton has 7018 states and 9581 transitions. Word has length 70 [2025-02-05 16:35:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:23,083 INFO L471 AbstractCegarLoop]: Abstraction has 7018 states and 9581 transitions. [2025-02-05 16:35:23,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 7018 states and 9581 transitions. [2025-02-05 16:35:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:35:23,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:23,086 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] [2025-02-05 16:35:23,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:35:23,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:23,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:23,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1925569480, now seen corresponding path program 1 times [2025-02-05 16:35:23,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:23,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713112518] [2025-02-05 16:35:23,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:23,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:23,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:35:23,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:35:23,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:23,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:23,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:23,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713112518] [2025-02-05 16:35:23,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713112518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:23,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:23,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:35:23,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837505119] [2025-02-05 16:35:23,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:23,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:35:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:23,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:35:23,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:35:23,551 INFO L87 Difference]: Start difference. First operand 7018 states and 9581 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:24,338 INFO L93 Difference]: Finished difference Result 23722 states and 33205 transitions. [2025-02-05 16:35:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:35:24,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2025-02-05 16:35:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:24,357 INFO L225 Difference]: With dead ends: 23722 [2025-02-05 16:35:24,357 INFO L226 Difference]: Without dead ends: 18722 [2025-02-05 16:35:24,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:35:24,365 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 3535 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3535 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:24,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3535 Valid, 2336 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:35:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18722 states. [2025-02-05 16:35:24,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18722 to 6817. [2025-02-05 16:35:24,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6817 states, 6815 states have (on average 1.3643433602347763) internal successors, (9298), 6816 states have internal predecessors, (9298), 0 states have call successors, (0), 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-02-05 16:35:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6817 states to 6817 states and 9298 transitions. [2025-02-05 16:35:24,509 INFO L78 Accepts]: Start accepts. Automaton has 6817 states and 9298 transitions. Word has length 70 [2025-02-05 16:35:24,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:24,509 INFO L471 AbstractCegarLoop]: Abstraction has 6817 states and 9298 transitions. [2025-02-05 16:35:24,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 0 states have call successors, (0), 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-02-05 16:35:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 6817 states and 9298 transitions. [2025-02-05 16:35:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:35:24,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:24,512 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] [2025-02-05 16:35:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:35:24,513 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash 921836899, now seen corresponding path program 1 times [2025-02-05 16:35:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:24,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604635146] [2025-02-05 16:35:24,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:35:24,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:35:24,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:24,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:24,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:24,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:24,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604635146] [2025-02-05 16:35:24,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604635146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:24,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:24,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:24,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643359609] [2025-02-05 16:35:24,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:24,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:24,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:24,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:24,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:24,555 INFO L87 Difference]: Start difference. First operand 6817 states and 9298 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-05 16:35:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:24,636 INFO L93 Difference]: Finished difference Result 13901 states and 19188 transitions. [2025-02-05 16:35:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-02-05 16:35:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:24,643 INFO L225 Difference]: With dead ends: 13901 [2025-02-05 16:35:24,643 INFO L226 Difference]: Without dead ends: 9715 [2025-02-05 16:35:24,646 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-02-05 16:35:24,646 INFO L435 NwaCegarLoop]: 385 mSDtfsCounter, 380 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:24,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 526 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:24,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9715 states. [2025-02-05 16:35:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9715 to 9686. [2025-02-05 16:35:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9686 states, 9685 states have (on average 1.3854414042333505) internal successors, (13418), 9685 states have internal predecessors, (13418), 0 states have call successors, (0), 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-02-05 16:35:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9686 states to 9686 states and 13418 transitions. [2025-02-05 16:35:24,767 INFO L78 Accepts]: Start accepts. Automaton has 9686 states and 13418 transitions. Word has length 72 [2025-02-05 16:35:24,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:24,767 INFO L471 AbstractCegarLoop]: Abstraction has 9686 states and 13418 transitions. [2025-02-05 16:35:24,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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-02-05 16:35:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 9686 states and 13418 transitions. [2025-02-05 16:35:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 16:35:24,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:24,775 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:24,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:35:24,775 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-02-05 16:35:24,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:24,776 INFO L85 PathProgramCache]: Analyzing trace with hash -973304734, now seen corresponding path program 1 times [2025-02-05 16:35:24,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:24,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892607588] [2025-02-05 16:35:24,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:24,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:24,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 16:35:24,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 16:35:24,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:24,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:24,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:24,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892607588] [2025-02-05 16:35:24,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892607588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:24,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:24,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:24,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696513687] [2025-02-05 16:35:24,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:24,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:24,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:24,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:24,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:24,859 INFO L87 Difference]: Start difference. First operand 9686 states and 13418 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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-02-05 16:35:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:25,055 INFO L93 Difference]: Finished difference Result 48981 states and 69583 transitions. [2025-02-05 16:35:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-02-05 16:35:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:25,101 INFO L225 Difference]: With dead ends: 48981 [2025-02-05 16:35:25,101 INFO L226 Difference]: Without dead ends: 41122 [2025-02-05 16:35:25,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:25,119 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 2032 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:25,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 1248 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:25,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41122 states. [2025-02-05 16:35:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41122 to 17543. [2025-02-05 16:35:25,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17543 states, 17542 states have (on average 1.389807319575875) internal successors, (24380), 17542 states have internal predecessors, (24380), 0 states have call successors, (0), 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-02-05 16:35:25,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17543 states to 17543 states and 24380 transitions. [2025-02-05 16:35:25,662 INFO L78 Accepts]: Start accepts. Automaton has 17543 states and 24380 transitions. Word has length 86 [2025-02-05 16:35:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:25,663 INFO L471 AbstractCegarLoop]: Abstraction has 17543 states and 24380 transitions. [2025-02-05 16:35:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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-02-05 16:35:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17543 states and 24380 transitions. [2025-02-05 16:35:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:35:25,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:25,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:25,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:35:25,691 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-02-05 16:35:25,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:25,691 INFO L85 PathProgramCache]: Analyzing trace with hash -78091071, now seen corresponding path program 1 times [2025-02-05 16:35:25,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:25,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933381395] [2025-02-05 16:35:25,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:25,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:25,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:35:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:35:25,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:25,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:25,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:25,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933381395] [2025-02-05 16:35:25,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933381395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:25,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:25,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:25,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171409856] [2025-02-05 16:35:25,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:25,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:25,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:25,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:25,909 INFO L87 Difference]: Start difference. First operand 17543 states and 24380 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-02-05 16:35:26,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:26,102 INFO L93 Difference]: Finished difference Result 29817 states and 41351 transitions. [2025-02-05 16:35:26,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-02-05 16:35:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:26,122 INFO L225 Difference]: With dead ends: 29817 [2025-02-05 16:35:26,123 INFO L226 Difference]: Without dead ends: 20223 [2025-02-05 16:35:26,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:26,136 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 936 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:26,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1278 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20223 states. [2025-02-05 16:35:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20223 to 14919. [2025-02-05 16:35:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14919 states, 14918 states have (on average 1.3687491620860706) internal successors, (20419), 14918 states have internal predecessors, (20419), 0 states have call successors, (0), 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-02-05 16:35:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14919 states to 14919 states and 20419 transitions. [2025-02-05 16:35:26,353 INFO L78 Accepts]: Start accepts. Automaton has 14919 states and 20419 transitions. Word has length 87 [2025-02-05 16:35:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:26,353 INFO L471 AbstractCegarLoop]: Abstraction has 14919 states and 20419 transitions. [2025-02-05 16:35:26,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-02-05 16:35:26,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14919 states and 20419 transitions. [2025-02-05 16:35:26,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 16:35:26,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:26,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:26,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:35:26,366 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-02-05 16:35:26,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:26,367 INFO L85 PathProgramCache]: Analyzing trace with hash 824229442, now seen corresponding path program 1 times [2025-02-05 16:35:26,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:26,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973381271] [2025-02-05 16:35:26,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:26,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 16:35:26,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 16:35:26,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:26,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:26,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973381271] [2025-02-05 16:35:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973381271] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:26,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927991095] [2025-02-05 16:35:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:26,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:26,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:26,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:26,643 INFO L87 Difference]: Start difference. First operand 14919 states and 20419 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-02-05 16:35:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:26,735 INFO L93 Difference]: Finished difference Result 40551 states and 55917 transitions. [2025-02-05 16:35:26,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:26,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-02-05 16:35:26,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:26,760 INFO L225 Difference]: With dead ends: 40551 [2025-02-05 16:35:26,760 INFO L226 Difference]: Without dead ends: 27325 [2025-02-05 16:35:26,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:26,774 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 154 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:26,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 883 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27325 states. [2025-02-05 16:35:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27325 to 25683. [2025-02-05 16:35:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25683 states, 25682 states have (on average 1.364808036757262) internal successors, (35051), 25682 states have internal predecessors, (35051), 0 states have call successors, (0), 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-02-05 16:35:26,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25683 states to 25683 states and 35051 transitions. [2025-02-05 16:35:26,993 INFO L78 Accepts]: Start accepts. Automaton has 25683 states and 35051 transitions. Word has length 88 [2025-02-05 16:35:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:26,994 INFO L471 AbstractCegarLoop]: Abstraction has 25683 states and 35051 transitions. [2025-02-05 16:35:26,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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-02-05 16:35:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 25683 states and 35051 transitions. [2025-02-05 16:35:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 16:35:27,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:27,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:35:27,002 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-02-05 16:35:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1319093004, now seen corresponding path program 1 times [2025-02-05 16:35:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749583543] [2025-02-05 16:35:27,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:27,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 16:35:27,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 16:35:27,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:27,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:27,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:27,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749583543] [2025-02-05 16:35:27,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749583543] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:27,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:27,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518705336] [2025-02-05 16:35:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:27,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:27,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:27,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:27,165 INFO L87 Difference]: Start difference. First operand 25683 states and 35051 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-02-05 16:35:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:27,280 INFO L93 Difference]: Finished difference Result 68535 states and 93845 transitions. [2025-02-05 16:35:27,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:27,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-02-05 16:35:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:27,323 INFO L225 Difference]: With dead ends: 68535 [2025-02-05 16:35:27,324 INFO L226 Difference]: Without dead ends: 44545 [2025-02-05 16:35:27,348 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-02-05 16:35:27,348 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 142 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:27,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 872 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44545 states. [2025-02-05 16:35:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44545 to 40511. [2025-02-05 16:35:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40511 states, 40510 states have (on average 1.3566773636139224) internal successors, (54959), 40510 states have internal predecessors, (54959), 0 states have call successors, (0), 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-02-05 16:35:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40511 states to 40511 states and 54959 transitions. [2025-02-05 16:35:27,822 INFO L78 Accepts]: Start accepts. Automaton has 40511 states and 54959 transitions. Word has length 89 [2025-02-05 16:35:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:27,822 INFO L471 AbstractCegarLoop]: Abstraction has 40511 states and 54959 transitions. [2025-02-05 16:35:27,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 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-02-05 16:35:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 40511 states and 54959 transitions. [2025-02-05 16:35:27,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:35:27,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:27,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:35:27,840 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-02-05 16:35:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash 12863080, now seen corresponding path program 1 times [2025-02-05 16:35:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145379022] [2025-02-05 16:35:27,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:27,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:35:27,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:35:27,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:27,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145379022] [2025-02-05 16:35:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145379022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:27,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:27,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750220512] [2025-02-05 16:35:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:27,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:27,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:27,896 INFO L87 Difference]: Start difference. First operand 40511 states and 54959 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 16:35:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:28,012 INFO L93 Difference]: Finished difference Result 61196 states and 82946 transitions. [2025-02-05 16:35:28,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:28,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-02-05 16:35:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:28,055 INFO L225 Difference]: With dead ends: 61196 [2025-02-05 16:35:28,055 INFO L226 Difference]: Without dead ends: 38001 [2025-02-05 16:35:28,077 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-02-05 16:35:28,078 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 241 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:28,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 917 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:28,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38001 states. [2025-02-05 16:35:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38001 to 37999. [2025-02-05 16:35:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37999 states, 37998 states have (on average 1.3487815148165694) internal successors, (51251), 37998 states have internal predecessors, (51251), 0 states have call successors, (0), 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-02-05 16:35:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37999 states to 37999 states and 51251 transitions. [2025-02-05 16:35:28,800 INFO L78 Accepts]: Start accepts. Automaton has 37999 states and 51251 transitions. Word has length 90 [2025-02-05 16:35:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:28,800 INFO L471 AbstractCegarLoop]: Abstraction has 37999 states and 51251 transitions. [2025-02-05 16:35:28,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 16:35:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 37999 states and 51251 transitions. [2025-02-05 16:35:28,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:35:28,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:28,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:28,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:35:28,807 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-02-05 16:35:28,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1466965167, now seen corresponding path program 1 times [2025-02-05 16:35:28,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:28,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086333361] [2025-02-05 16:35:28,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:28,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:28,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:35:28,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:35:28,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:28,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:28,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086333361] [2025-02-05 16:35:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086333361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:28,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:28,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970147851] [2025-02-05 16:35:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:28,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:28,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:28,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:28,889 INFO L87 Difference]: Start difference. First operand 37999 states and 51251 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 16:35:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:29,245 INFO L93 Difference]: Finished difference Result 104523 states and 140941 transitions. [2025-02-05 16:35:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-02-05 16:35:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:29,323 INFO L225 Difference]: With dead ends: 104523 [2025-02-05 16:35:29,323 INFO L226 Difference]: Without dead ends: 68185 [2025-02-05 16:35:29,349 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-02-05 16:35:29,349 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 129 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:29,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 854 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:29,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68185 states. [2025-02-05 16:35:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68185 to 60359. [2025-02-05 16:35:30,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60359 states, 60358 states have (on average 1.3335597600980815) internal successors, (80491), 60358 states have internal predecessors, (80491), 0 states have call successors, (0), 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-02-05 16:35:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60359 states to 60359 states and 80491 transitions. [2025-02-05 16:35:30,108 INFO L78 Accepts]: Start accepts. Automaton has 60359 states and 80491 transitions. Word has length 90 [2025-02-05 16:35:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:30,108 INFO L471 AbstractCegarLoop]: Abstraction has 60359 states and 80491 transitions. [2025-02-05 16:35:30,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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-02-05 16:35:30,108 INFO L276 IsEmpty]: Start isEmpty. Operand 60359 states and 80491 transitions. [2025-02-05 16:35:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:35:30,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:30,118 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:30,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:35:30,118 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-02-05 16:35:30,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1593704593, now seen corresponding path program 1 times [2025-02-05 16:35:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:30,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864785913] [2025-02-05 16:35:30,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:30,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:35:30,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:35:30,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:30,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864785913] [2025-02-05 16:35:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864785913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569911843] [2025-02-05 16:35:30,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:30,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:30,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:30,214 INFO L87 Difference]: Start difference. First operand 60359 states and 80491 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-05 16:35:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:30,422 INFO L93 Difference]: Finished difference Result 77858 states and 103646 transitions. [2025-02-05 16:35:30,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 16:35:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:30,489 INFO L225 Difference]: With dead ends: 77858 [2025-02-05 16:35:30,490 INFO L226 Difference]: Without dead ends: 54525 [2025-02-05 16:35:30,516 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-02-05 16:35:30,516 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 198 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:30,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 885 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54525 states. [2025-02-05 16:35:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54525 to 54523. [2025-02-05 16:35:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54523 states, 54522 states have (on average 1.3296284068816258) internal successors, (72494), 54522 states have internal predecessors, (72494), 0 states have call successors, (0), 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-02-05 16:35:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54523 states to 54523 states and 72494 transitions. [2025-02-05 16:35:31,169 INFO L78 Accepts]: Start accepts. Automaton has 54523 states and 72494 transitions. Word has length 91 [2025-02-05 16:35:31,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:31,169 INFO L471 AbstractCegarLoop]: Abstraction has 54523 states and 72494 transitions. [2025-02-05 16:35:31,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-05 16:35:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 54523 states and 72494 transitions. [2025-02-05 16:35:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 16:35:31,175 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:31,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:31,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:35:31,175 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-02-05 16:35:31,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1540372141, now seen corresponding path program 1 times [2025-02-05 16:35:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208207478] [2025-02-05 16:35:31,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:31,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:31,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 16:35:31,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 16:35:31,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:31,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:31,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:31,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208207478] [2025-02-05 16:35:31,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208207478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:31,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:31,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:31,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402686072] [2025-02-05 16:35:31,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:31,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:31,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:31,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:31,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:31,256 INFO L87 Difference]: Start difference. First operand 54523 states and 72494 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-05 16:35:31,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:31,399 INFO L93 Difference]: Finished difference Result 81122 states and 107803 transitions. [2025-02-05 16:35:31,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:31,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-02-05 16:35:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:31,446 INFO L225 Difference]: With dead ends: 81122 [2025-02-05 16:35:31,447 INFO L226 Difference]: Without dead ends: 46418 [2025-02-05 16:35:31,472 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-02-05 16:35:31,472 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 250 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:31,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 976 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46418 states. [2025-02-05 16:35:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46418 to 46416. [2025-02-05 16:35:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46416 states, 46415 states have (on average 1.3234299256705806) internal successors, (61427), 46415 states have internal predecessors, (61427), 0 states have call successors, (0), 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-02-05 16:35:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46416 states to 46416 states and 61427 transitions. [2025-02-05 16:35:32,221 INFO L78 Accepts]: Start accepts. Automaton has 46416 states and 61427 transitions. Word has length 91 [2025-02-05 16:35:32,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:32,221 INFO L471 AbstractCegarLoop]: Abstraction has 46416 states and 61427 transitions. [2025-02-05 16:35:32,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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-02-05 16:35:32,221 INFO L276 IsEmpty]: Start isEmpty. Operand 46416 states and 61427 transitions. [2025-02-05 16:35:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:35:32,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:32,226 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:32,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:35:32,226 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-02-05 16:35:32,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 954610342, now seen corresponding path program 1 times [2025-02-05 16:35:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058478562] [2025-02-05 16:35:32,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:32,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:35:32,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:35:32,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:32,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:32,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:32,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058478562] [2025-02-05 16:35:32,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058478562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:32,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:32,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:32,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060810358] [2025-02-05 16:35:32,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:32,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:32,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:32,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:32,403 INFO L87 Difference]: Start difference. First operand 46416 states and 61427 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-05 16:35:32,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:32,999 INFO L93 Difference]: Finished difference Result 132468 states and 175077 transitions. [2025-02-05 16:35:33,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:33,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 16:35:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:33,088 INFO L225 Difference]: With dead ends: 132468 [2025-02-05 16:35:33,088 INFO L226 Difference]: Without dead ends: 87602 [2025-02-05 16:35:33,107 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-02-05 16:35:33,107 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 107 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:33,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 834 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87602 states. [2025-02-05 16:35:33,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87602 to 81968. [2025-02-05 16:35:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81968 states, 81967 states have (on average 1.310808008100821) internal successors, (107443), 81967 states have internal predecessors, (107443), 0 states have call successors, (0), 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-02-05 16:35:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81968 states to 81968 states and 107443 transitions. [2025-02-05 16:35:34,110 INFO L78 Accepts]: Start accepts. Automaton has 81968 states and 107443 transitions. Word has length 92 [2025-02-05 16:35:34,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:34,110 INFO L471 AbstractCegarLoop]: Abstraction has 81968 states and 107443 transitions. [2025-02-05 16:35:34,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 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-02-05 16:35:34,110 INFO L276 IsEmpty]: Start isEmpty. Operand 81968 states and 107443 transitions. [2025-02-05 16:35:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:35:34,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:34,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:35:34,117 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1323860144, now seen corresponding path program 1 times [2025-02-05 16:35:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219540098] [2025-02-05 16:35:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:34,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:35:34,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:35:34,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:34,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:34,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:34,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219540098] [2025-02-05 16:35:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219540098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52722855] [2025-02-05 16:35:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:34,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:34,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:34,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:34,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:34,526 INFO L87 Difference]: Start difference. First operand 81968 states and 107443 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-02-05 16:35:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:34,855 INFO L93 Difference]: Finished difference Result 88210 states and 115764 transitions. [2025-02-05 16:35:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:34,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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 94 [2025-02-05 16:35:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:34,935 INFO L225 Difference]: With dead ends: 88210 [2025-02-05 16:35:34,935 INFO L226 Difference]: Without dead ends: 88208 [2025-02-05 16:35:34,952 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-02-05 16:35:34,953 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 0 mSDsluCounter, 1649 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2071 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:34,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2071 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88208 states. [2025-02-05 16:35:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88208 to 88208. [2025-02-05 16:35:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88208 states, 88207 states have (on average 1.2888206151439228) internal successors, (113683), 88207 states have internal predecessors, (113683), 0 states have call successors, (0), 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-02-05 16:35:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88208 states to 88208 states and 113683 transitions. [2025-02-05 16:35:35,925 INFO L78 Accepts]: Start accepts. Automaton has 88208 states and 113683 transitions. Word has length 94 [2025-02-05 16:35:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:35,925 INFO L471 AbstractCegarLoop]: Abstraction has 88208 states and 113683 transitions. [2025-02-05 16:35:35,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 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-02-05 16:35:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 88208 states and 113683 transitions. [2025-02-05 16:35:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:35:35,929 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:35,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:35:35,929 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:35,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2057803795, now seen corresponding path program 1 times [2025-02-05 16:35:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416161830] [2025-02-05 16:35:35,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:35,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:35,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:35:35,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:35:35,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:35,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416161830] [2025-02-05 16:35:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416161830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442227498] [2025-02-05 16:35:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:35,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:35,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:35,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:35,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:35,974 INFO L87 Difference]: Start difference. First operand 88208 states and 113683 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-02-05 16:35:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:36,623 INFO L93 Difference]: Finished difference Result 222380 states and 285181 transitions. [2025-02-05 16:35:36,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:36,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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 95 [2025-02-05 16:35:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:36,780 INFO L225 Difference]: With dead ends: 222380 [2025-02-05 16:35:36,780 INFO L226 Difference]: Without dead ends: 135722 [2025-02-05 16:35:36,822 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-02-05 16:35:36,823 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 325 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:36,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 610 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:36,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135722 states. [2025-02-05 16:35:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135722 to 135720. [2025-02-05 16:35:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135720 states, 135719 states have (on average 1.2692916982883753) internal successors, (172267), 135719 states have internal predecessors, (172267), 0 states have call successors, (0), 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-02-05 16:35:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135720 states to 135720 states and 172267 transitions. [2025-02-05 16:35:38,498 INFO L78 Accepts]: Start accepts. Automaton has 135720 states and 172267 transitions. Word has length 95 [2025-02-05 16:35:38,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:38,498 INFO L471 AbstractCegarLoop]: Abstraction has 135720 states and 172267 transitions. [2025-02-05 16:35:38,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 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-02-05 16:35:38,499 INFO L276 IsEmpty]: Start isEmpty. Operand 135720 states and 172267 transitions. [2025-02-05 16:35:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:35:38,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:38,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:35:38,503 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:38,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:38,503 INFO L85 PathProgramCache]: Analyzing trace with hash 478904614, now seen corresponding path program 1 times [2025-02-05 16:35:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548661612] [2025-02-05 16:35:38,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:38,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:35:38,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:35:38,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:38,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:38,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:38,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:38,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548661612] [2025-02-05 16:35:38,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548661612] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:38,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:38,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848808700] [2025-02-05 16:35:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:38,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:38,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:38,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:38,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:38,591 INFO L87 Difference]: Start difference. First operand 135720 states and 172267 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:39,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:39,035 INFO L93 Difference]: Finished difference Result 211170 states and 269192 transitions. [2025-02-05 16:35:39,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:39,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:35:39,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:39,544 INFO L225 Difference]: With dead ends: 211170 [2025-02-05 16:35:39,544 INFO L226 Difference]: Without dead ends: 181756 [2025-02-05 16:35:39,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:39,581 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 1578 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1578 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:39,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1578 Valid, 1305 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181756 states. [2025-02-05 16:35:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181756 to 155876. [2025-02-05 16:35:41,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155876 states, 155875 states have (on average 1.2671884522854853) internal successors, (197523), 155875 states have internal predecessors, (197523), 0 states have call successors, (0), 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-02-05 16:35:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155876 states to 155876 states and 197523 transitions. [2025-02-05 16:35:41,600 INFO L78 Accepts]: Start accepts. Automaton has 155876 states and 197523 transitions. Word has length 97 [2025-02-05 16:35:41,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:41,600 INFO L471 AbstractCegarLoop]: Abstraction has 155876 states and 197523 transitions. [2025-02-05 16:35:41,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:41,600 INFO L276 IsEmpty]: Start isEmpty. Operand 155876 states and 197523 transitions. [2025-02-05 16:35:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:35:41,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:41,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:41,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:35:41,605 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:41,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1793121660, now seen corresponding path program 1 times [2025-02-05 16:35:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929479985] [2025-02-05 16:35:41,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:41,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:35:41,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:35:41,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:41,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:41,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:41,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929479985] [2025-02-05 16:35:41,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929479985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:41,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:41,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:35:41,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126323253] [2025-02-05 16:35:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:41,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:35:41,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:41,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:35:41,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:35:41,649 INFO L87 Difference]: Start difference. First operand 155876 states and 197523 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-02-05 16:35:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:42,651 INFO L93 Difference]: Finished difference Result 309321 states and 391949 transitions. [2025-02-05 16:35:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:35:42,652 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-02-05 16:35:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:42,966 INFO L225 Difference]: With dead ends: 309321 [2025-02-05 16:35:42,966 INFO L226 Difference]: Without dead ends: 220024 [2025-02-05 16:35:43,021 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-02-05 16:35:43,021 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 375 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:43,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 567 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:35:43,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220024 states. [2025-02-05 16:35:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220024 to 153484. [2025-02-05 16:35:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153484 states, 153483 states have (on average 1.264198640891825) internal successors, (194033), 153483 states have internal predecessors, (194033), 0 states have call successors, (0), 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-02-05 16:35:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153484 states to 153484 states and 194033 transitions. [2025-02-05 16:35:45,054 INFO L78 Accepts]: Start accepts. Automaton has 153484 states and 194033 transitions. Word has length 98 [2025-02-05 16:35:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:45,054 INFO L471 AbstractCegarLoop]: Abstraction has 153484 states and 194033 transitions. [2025-02-05 16:35:45,054 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-02-05 16:35:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 153484 states and 194033 transitions. [2025-02-05 16:35:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:35:45,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:45,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:45,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:35:45,060 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:45,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1932494263, now seen corresponding path program 1 times [2025-02-05 16:35:45,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:45,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348549931] [2025-02-05 16:35:45,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:45,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:45,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:35:45,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:35:45,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:45,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:45,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:45,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348549931] [2025-02-05 16:35:45,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348549931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:45,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:45,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:35:45,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952553570] [2025-02-05 16:35:45,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:45,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:35:45,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:45,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:35:45,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:35:45,175 INFO L87 Difference]: Start difference. First operand 153484 states and 194033 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:46,479 INFO L93 Difference]: Finished difference Result 216890 states and 275230 transitions. [2025-02-05 16:35:46,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:35:46,480 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 16:35:46,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:46,690 INFO L225 Difference]: With dead ends: 216890 [2025-02-05 16:35:46,690 INFO L226 Difference]: Without dead ends: 188340 [2025-02-05 16:35:46,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:46,737 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 1566 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1566 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:46,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1566 Valid, 1302 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:35:46,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188340 states. [2025-02-05 16:35:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188340 to 173160. [2025-02-05 16:35:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173160 states, 173159 states have (on average 1.2622445267066684) internal successors, (218569), 173159 states have internal predecessors, (218569), 0 states have call successors, (0), 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-02-05 16:35:48,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173160 states to 173160 states and 218569 transitions. [2025-02-05 16:35:48,813 INFO L78 Accepts]: Start accepts. Automaton has 173160 states and 218569 transitions. Word has length 99 [2025-02-05 16:35:48,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 173160 states and 218569 transitions. [2025-02-05 16:35:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:35:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 173160 states and 218569 transitions. [2025-02-05 16:35:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:35:48,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:48,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:48,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:35:48,834 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:48,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:48,834 INFO L85 PathProgramCache]: Analyzing trace with hash -434637792, now seen corresponding path program 1 times [2025-02-05 16:35:48,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:48,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050578127] [2025-02-05 16:35:48,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:48,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:48,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:35:48,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:35:48,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:48,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050578127] [2025-02-05 16:35:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050578127] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:35:49,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099172009] [2025-02-05 16:35:49,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:49,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:35:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:35:49,121 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 16:35:49,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 16:35:49,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:35:49,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:35:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:49,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:35:49,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:35:50,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:50,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:35:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:35:51,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099172009] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:35:51,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:35:51,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-02-05 16:35:51,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609691881] [2025-02-05 16:35:51,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:35:51,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 16:35:51,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:51,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 16:35:51,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-02-05 16:35:51,126 INFO L87 Difference]: Start difference. First operand 173160 states and 218569 transitions. Second operand has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 0 states have call successors, (0), 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-02-05 16:35:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:35:53,928 INFO L93 Difference]: Finished difference Result 460986 states and 584289 transitions. [2025-02-05 16:35:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:35:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 0 states have call successors, (0), 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 121 [2025-02-05 16:35:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:35:54,461 INFO L225 Difference]: With dead ends: 460986 [2025-02-05 16:35:54,461 INFO L226 Difference]: Without dead ends: 385720 [2025-02-05 16:35:54,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=542, Invalid=1714, Unknown=0, NotChecked=0, Total=2256 [2025-02-05 16:35:54,557 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 3811 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 2351 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3811 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:35:54,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3811 Valid, 3141 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2351 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 16:35:54,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385720 states. [2025-02-05 16:35:57,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385720 to 278845. [2025-02-05 16:35:57,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278845 states, 278844 states have (on average 1.2647250792557847) internal successors, (352661), 278844 states have internal predecessors, (352661), 0 states have call successors, (0), 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-02-05 16:35:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278845 states to 278845 states and 352661 transitions. [2025-02-05 16:35:58,495 INFO L78 Accepts]: Start accepts. Automaton has 278845 states and 352661 transitions. Word has length 121 [2025-02-05 16:35:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:35:58,496 INFO L471 AbstractCegarLoop]: Abstraction has 278845 states and 352661 transitions. [2025-02-05 16:35:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.653846153846153) internal successors, (303), 25 states have internal predecessors, (303), 0 states have call successors, (0), 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-02-05 16:35:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 278845 states and 352661 transitions. [2025-02-05 16:35:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:35:59,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:35:59,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:35:59,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 16:35:59,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-05 16:35:59,252 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-05 16:35:59,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:35:59,253 INFO L85 PathProgramCache]: Analyzing trace with hash -904162405, now seen corresponding path program 1 times [2025-02-05 16:35:59,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:35:59,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715608574] [2025-02-05 16:35:59,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:35:59,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:35:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:35:59,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:35:59,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:35:59,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:35:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 16:35:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:35:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715608574] [2025-02-05 16:35:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715608574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:35:59,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:35:59,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:35:59,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366132596] [2025-02-05 16:35:59,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:35:59,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:35:59,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:35:59,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:35:59,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:35:59,591 INFO L87 Difference]: Start difference. First operand 278845 states and 352661 transitions. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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-02-05 16:36:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:02,096 INFO L93 Difference]: Finished difference Result 768296 states and 968944 transitions. [2025-02-05 16:36:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:36:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 8 states have internal predecessors, (111), 0 states have call successors, (0), 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 121 [2025-02-05 16:36:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:03,124 INFO L225 Difference]: With dead ends: 768296 [2025-02-05 16:36:03,124 INFO L226 Difference]: Without dead ends: 639519 [2025-02-05 16:36:03,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:36:03,275 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1951 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:03,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 1234 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639519 states.