./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a76dc897aa0702a7581955a590e68a0e3d7c15bffbb5939a80772bf70ad5d7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:07:36,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:07:36,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:07:36,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:07:36,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:07:36,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:07:36,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:07:36,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:07:36,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:07:36,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:07:36,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:07:36,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:07:36,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:07:36,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:07:36,189 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:07:36,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:07:36,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:07:36,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:07:36,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:07:36,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:07:36,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:07:36,192 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:07:36,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:36,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:07:36,193 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1a76dc897aa0702a7581955a590e68a0e3d7c15bffbb5939a80772bf70ad5d7a [2025-03-03 15:07:36,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:07:36,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:07:36,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:07:36,410 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:07:36,411 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:07:36,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:07:37,524 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0402bb937/657ef9d0710649c0b3a4a736d26630e9/FLAGee3f4c60a [2025-03-03 15:07:37,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:07:37,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:07:37,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0402bb937/657ef9d0710649c0b3a4a736d26630e9/FLAGee3f4c60a [2025-03-03 15:07:38,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0402bb937/657ef9d0710649c0b3a4a736d26630e9 [2025-03-03 15:07:38,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:07:38,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:07:38,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:38,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:07:38,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:07:38,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786d5755 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38, skipping insertion in model container [2025-03-03 15:07:38,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:07:38,391 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[10634,10647] [2025-03-03 15:07:38,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[25860,25873] [2025-03-03 15:07:38,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:38,603 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:07:38,647 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[10634,10647] [2025-03-03 15:07:38,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[25860,25873] [2025-03-03 15:07:38,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:07:38,785 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:07:38,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38 WrapperNode [2025-03-03 15:07:38,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:07:38,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:38,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:07:38,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:07:38,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,925 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3884 [2025-03-03 15:07:38,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:07:38,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:07:38,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:07:38,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:07:38,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,990 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:07:38,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:38,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,012 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,022 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:07:39,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:07:39,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:07:39,035 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:07:39,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (1/1) ... [2025-03-03 15:07:39,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:07:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:39,063 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:07:39,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:07:39,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:07:39,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:07:39,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:07:39,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:07:39,250 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:07:39,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:07:40,842 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5850: havoc main_~node4__m4~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5983: havoc main_~main____CPAchecker_TMP_0~47#1;havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~59#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3935: havoc main_~main____CPAchecker_TMP_0~24#1;havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~36#1;havoc main_~node4____CPAchecker_TMP_0~12#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2482: havoc main_~node4__m4~12#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4795: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4663: havoc main_~main____CPAchecker_TMP_0~32#1;havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~44#1;havoc main_~node4____CPAchecker_TMP_0~16#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2615: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~21#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~12#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5391: havoc main_~node4____CPAchecker_TMP_1~20#1; [2025-03-03 15:07:40,843 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4070: havoc main_~node2__m2~4#1; [2025-03-03 15:07:40,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node4__m4~2#1; [2025-03-03 15:07:40,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2223: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:40,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2752: havoc main_~node4____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:40,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2885: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~24#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:40,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L705: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5595: havoc main_~node4____CPAchecker_TMP_1~21#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3547: havoc main_~node4__m4~18#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3680: havoc main_~main____CPAchecker_TMP_0~21#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~33#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5728: havoc main_~main____CPAchecker_TMP_0~44#1;havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~56#1;havoc main_~node4____CPAchecker_TMP_0~22#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1434: havoc main_~node2__m2~3#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4275: havoc main_~node4__m4~22#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4804: havoc main_~node4__m4~25#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2360: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~18#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4408: havoc main_~main____CPAchecker_TMP_0~29#1;havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~41#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4937: havoc main_~main____CPAchecker_TMP_0~35#1;havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~47#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1502: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~9#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: havoc main_~node3__m3~1#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3088: havoc main_~node4____CPAchecker_TMP_1~7#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1173: havoc main_~node4__m4~4#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4080: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5931: havoc main_~node4____CPAchecker_TMP_1~23#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: 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-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1043: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1704: havoc main_~node3__m3~5#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2563: havoc main_~node4____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:40,845 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5140: havoc main_~node4__m4~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3225: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~28#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5273: havoc main_~main____CPAchecker_TMP_0~39#1;havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~51#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3887: havoc main_~node4__m4~20#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4020: havoc main_~main____CPAchecker_TMP_0~25#1;havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~37#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6068: havoc main_~main____CPAchecker_TMP_0~48#1;havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~60#1;havoc main_~node4____CPAchecker_TMP_0~24#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4615: havoc main_~node4__m4~24#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4748: havoc main_~main____CPAchecker_TMP_0~33#1;havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~45#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908: havoc main_~check__tmp~14#1;havoc main_~node4__m4~9#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3362: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1248: havoc main_~check__tmp~7#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3429: havoc main_~main____CPAchecker_TMP_0~18#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~30#1;havoc main_~node4____CPAchecker_TMP_0~9#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4090: havoc main_~node3__m3~8#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3628: havoc main_~node4____CPAchecker_TMP_1~10#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2109: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~15#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4157: havoc main_~main____CPAchecker_TMP_0~26#1;havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~38#1;havoc main_~node4____CPAchecker_TMP_0~13#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4356: havoc main_~node4____CPAchecker_TMP_1~14#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2837: havoc main_~node4__m4~14#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4885: havoc main_~node4____CPAchecker_TMP_1~17#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5018: havoc main_~main____CPAchecker_TMP_0~36#1;havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~48#1;havoc main_~node4____CPAchecker_TMP_0~18#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2970: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~25#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1451: havoc main_~node3__m3~4#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L791: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5680: havoc main_~node4__m4~30#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1320: havoc main_~check__tmp~8#1;havoc main_~node4__m4~5#1; [2025-03-03 15:07:40,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3765: havoc main_~main____CPAchecker_TMP_0~22#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~34#1;havoc main_~node4____CPAchecker_TMP_0~11#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5813: havoc main_~main____CPAchecker_TMP_0~45#1;havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~57#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L396: havoc main_~node4__m4~1#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2312: havoc main_~node4__m4~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2445: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~19#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4493: havoc main_~main____CPAchecker_TMP_0~30#1;havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~42#1;havoc main_~node4____CPAchecker_TMP_0~15#1; [2025-03-03 15:07:40,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5221: havoc main_~node4____CPAchecker_TMP_1~19#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3372: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1721: havoc main_~node4__m4~8#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4100: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3968: havoc main_~node4____CPAchecker_TMP_1~12#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L467: havoc main_~node2__m2~2#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L269: havoc main_~node3__m3~0#1; [2025-03-03 15:07:40,850 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4696: havoc main_~node4____CPAchecker_TMP_1~16#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3177: havoc main_~node4__m4~16#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1790: havoc main_~check__tmp~13#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5358: havoc main_~main____CPAchecker_TMP_0~40#1;havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~52#1;havoc main_~node4____CPAchecker_TMP_0~20#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3310: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~29#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6020: havoc main_~node4__m4~32#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2057: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6153: havoc main_~main____CPAchecker_TMP_0~49#1;havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~61#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2652: havoc main_~node3__m3~6#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2190: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~16#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~22#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2918: havoc main_~node4____CPAchecker_TMP_1~6#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5495: havoc main_~node3__m3~10#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3381: havoc main_~node4__m4~17#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5562: havoc main_~main____CPAchecker_TMP_0~42#1;havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~54#1;havoc main_~node4____CPAchecker_TMP_0~21#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3514: havoc main_~main____CPAchecker_TMP_0~19#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~31#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4109: havoc main_~node4__m4~21#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5761: havoc main_~node4____CPAchecker_TMP_1~22#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: 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;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4242: havoc main_~main____CPAchecker_TMP_0~27#1;havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~39#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1468: havoc main_~node4__m4~6#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2393: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L279: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:07:40,851 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4970: havoc main_~node4__m4~26#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5103: havoc main_~main____CPAchecker_TMP_0~37#1;havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~49#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3055: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~26#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3717: havoc main_~node4__m4~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1207: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~6#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1009: havoc main_~node4__m4~3#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5898: havoc main_~main____CPAchecker_TMP_0~46#1;havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~58#1;havoc main_~node4____CPAchecker_TMP_0~23#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3850: havoc main_~main____CPAchecker_TMP_0~23#1;havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~35#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4445: havoc main_~node4__m4~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2662: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4578: havoc main_~main____CPAchecker_TMP_0~31#1;havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~43#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2530: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~20#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3258: havoc main_~node4____CPAchecker_TMP_1~8#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5505: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L485: havoc main_~node3__m3~2#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6101: havoc main_~node4____CPAchecker_TMP_1~24#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc main_~check__tmp~10#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L288: havoc main_~node4__m4~0#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L619: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5310: havoc main_~node4__m4~28#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5443: havoc main_~main____CPAchecker_TMP_0~41#1;havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~53#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L951: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L819: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:07:40,852 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3462: havoc main_~node4____CPAchecker_TMP_1~9#1; [2025-03-03 15:07:40,854 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1084: havoc main_~check__tmp~5#1; [2025-03-03 15:07:40,855 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3595: havoc main_~main____CPAchecker_TMP_0~20#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~32#1;havoc main_~node4____CPAchecker_TMP_0~10#1; [2025-03-03 15:07:40,855 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2142: havoc main_~node4__m4~10#1; [2025-03-03 15:07:40,855 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4190: havoc main_~node4____CPAchecker_TMP_1~13#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4785: havoc main_~node3__m3~9#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2671: havoc main_~node4__m4~13#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4323: havoc main_~main____CPAchecker_TMP_0~28#1;havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~40#1;havoc main_~node4____CPAchecker_TMP_0~14#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2275: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~17#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2804: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~23#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4852: havoc main_~main____CPAchecker_TMP_0~34#1;havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~46#1;havoc main_~node4____CPAchecker_TMP_0~17#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1615: havoc main_~check__tmp~11#1;havoc main_~node4__m4~7#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5051: havoc main_~node4____CPAchecker_TMP_1~18#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5514: havoc main_~node4__m4~29#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L229: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5647: havoc main_~main____CPAchecker_TMP_0~43#1;havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~55#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L560: 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-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L362: havoc main_~node2__m2~1#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3798: havoc main_~node4____CPAchecker_TMP_1~11#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1156: havoc main_~node3__m3~3#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4526: havoc main_~node4____CPAchecker_TMP_1~15#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3007: havoc main_~node4__m4~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3140: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~27#1; [2025-03-03 15:07:40,856 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L5188: havoc main_~main____CPAchecker_TMP_0~38#1;havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~50#1;havoc main_~node4____CPAchecker_TMP_0~19#1; [2025-03-03 15:07:40,985 INFO L? ?]: Removed 589 outVars from TransFormulas that were not future-live. [2025-03-03 15:07:40,985 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:07:41,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:07:41,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:07:41,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:41 BoogieIcfgContainer [2025-03-03 15:07:41,018 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:07:41,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:07:41,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:07:41,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:07:41,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:07:38" (1/3) ... [2025-03-03 15:07:41,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a106619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:41, skipping insertion in model container [2025-03-03 15:07:41,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:07:38" (2/3) ... [2025-03-03 15:07:41,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a106619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:07:41, skipping insertion in model container [2025-03-03 15:07:41,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:07:41" (3/3) ... [2025-03-03 15:07:41,027 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:07:41,037 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:07:41,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 705 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 15:07:41,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:07:41,125 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;@16a6feb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:07:41,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:07:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 705 states, 702 states have (on average 1.7834757834757835) internal successors, (1252), 704 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:41,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:07:41,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:41,150 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] [2025-03-03 15:07:41,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:41,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash -594679370, now seen corresponding path program 1 times [2025-03-03 15:07:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:41,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004931638] [2025-03-03 15:07:41,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:41,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:41,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:07:41,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:07:41,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:41,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:41,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:41,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004931638] [2025-03-03 15:07:41,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004931638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:41,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:41,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:41,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170148965] [2025-03-03 15:07:41,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:41,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:41,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:41,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:41,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:41,549 INFO L87 Difference]: Start difference. First operand has 705 states, 702 states have (on average 1.7834757834757835) internal successors, (1252), 704 states have internal predecessors, (1252), 0 states have call successors, (0), 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.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:41,644 INFO L93 Difference]: Finished difference Result 1069 states and 1856 transitions. [2025-03-03 15:07:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:41,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:07:41,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:41,666 INFO L225 Difference]: With dead ends: 1069 [2025-03-03 15:07:41,669 INFO L226 Difference]: Without dead ends: 846 [2025-03-03 15:07:41,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:41,674 INFO L435 NwaCegarLoop]: 1250 mSDtfsCounter, 631 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:41,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 2079 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-03-03 15:07:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 844. [2025-03-03 15:07:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 842 states have (on average 1.368171021377672) internal successors, (1152), 843 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1152 transitions. [2025-03-03 15:07:41,741 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1152 transitions. Word has length 63 [2025-03-03 15:07:41,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:41,742 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1152 transitions. [2025-03-03 15:07:41,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1152 transitions. [2025-03-03 15:07:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:41,748 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-03-03 15:07:41,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:07:41,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1827494375, now seen corresponding path program 1 times [2025-03-03 15:07:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:41,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354481797] [2025-03-03 15:07:41,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:41,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:07:41,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:07:41,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:41,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:41,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:41,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:41,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354481797] [2025-03-03 15:07:41,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354481797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:41,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:41,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:41,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544892993] [2025-03-03 15:07:41,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:41,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:41,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:41,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:41,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:41,916 INFO L87 Difference]: Start difference. First operand 844 states and 1152 transitions. 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-03-03 15:07:41,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:41,997 INFO L93 Difference]: Finished difference Result 1415 states and 1997 transitions. [2025-03-03 15:07:41,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:41,997 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-03-03 15:07:41,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:42,001 INFO L225 Difference]: With dead ends: 1415 [2025-03-03 15:07:42,002 INFO L226 Difference]: Without dead ends: 1108 [2025-03-03 15:07:42,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:42,007 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 495 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 1576 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:42,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 1576 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states. [2025-03-03 15:07:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 1104. [2025-03-03 15:07:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 1102 states have (on average 1.3874773139745917) internal successors, (1529), 1103 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1529 transitions. [2025-03-03 15:07:42,083 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1529 transitions. Word has length 64 [2025-03-03 15:07:42,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:42,083 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1529 transitions. [2025-03-03 15:07:42,083 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-03-03 15:07:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1529 transitions. [2025-03-03 15:07:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:42,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:42,085 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-03-03 15:07:42,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:07:42,085 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:42,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1038161690, now seen corresponding path program 1 times [2025-03-03 15:07:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219796093] [2025-03-03 15:07:42,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:42,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:42,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:07:42,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:07:42,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:42,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:42,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219796093] [2025-03-03 15:07:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219796093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:42,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872749088] [2025-03-03 15:07:42,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:42,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:42,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:42,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:42,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:42,223 INFO L87 Difference]: Start difference. First operand 1104 states and 1529 transitions. 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-03-03 15:07:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:42,326 INFO L93 Difference]: Finished difference Result 2120 states and 2962 transitions. [2025-03-03 15:07:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:42,327 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-03-03 15:07:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:42,332 INFO L225 Difference]: With dead ends: 2120 [2025-03-03 15:07:42,333 INFO L226 Difference]: Without dead ends: 1695 [2025-03-03 15:07:42,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:42,335 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 549 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:42,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1683 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1695 states. [2025-03-03 15:07:42,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1695 to 1691. [2025-03-03 15:07:42,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1689 states have (on average 1.3718176435760805) internal successors, (2317), 1690 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:42,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2317 transitions. [2025-03-03 15:07:42,367 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2317 transitions. Word has length 64 [2025-03-03 15:07:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:42,368 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2317 transitions. [2025-03-03 15:07:42,368 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-03-03 15:07:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2317 transitions. [2025-03-03 15:07:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:07:42,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:42,370 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-03-03 15:07:42,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:07:42,370 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:42,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash -503120634, now seen corresponding path program 1 times [2025-03-03 15:07:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:42,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848826156] [2025-03-03 15:07:42,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:42,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:42,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:07:42,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:07:42,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:42,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:42,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848826156] [2025-03-03 15:07:42,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848826156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:42,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:42,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:42,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435132040] [2025-03-03 15:07:42,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:42,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:42,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:42,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:42,528 INFO L87 Difference]: Start difference. First operand 1691 states and 2317 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-03-03 15:07:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:42,938 INFO L93 Difference]: Finished difference Result 3738 states and 5238 transitions. [2025-03-03 15:07:42,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:42,938 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-03-03 15:07:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:42,946 INFO L225 Difference]: With dead ends: 3738 [2025-03-03 15:07:42,946 INFO L226 Difference]: Without dead ends: 2272 [2025-03-03 15:07:42,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:42,951 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2614 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2614 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:42,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2614 Valid, 573 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:42,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2025-03-03 15:07:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2270. [2025-03-03 15:07:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2270 states, 2268 states have (on average 1.3999118165784832) internal successors, (3175), 2269 states have internal predecessors, (3175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2270 states to 2270 states and 3175 transitions. [2025-03-03 15:07:42,997 INFO L78 Accepts]: Start accepts. Automaton has 2270 states and 3175 transitions. Word has length 64 [2025-03-03 15:07:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:42,999 INFO L471 AbstractCegarLoop]: Abstraction has 2270 states and 3175 transitions. [2025-03-03 15:07:42,999 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-03-03 15:07:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 2270 states and 3175 transitions. [2025-03-03 15:07:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 15:07:43,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:43,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] [2025-03-03 15:07:43,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:07:43,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:43,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1387472010, now seen corresponding path program 1 times [2025-03-03 15:07:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927537632] [2025-03-03 15:07:43,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:43,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-03 15:07:43,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 15:07:43,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:43,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-03-03 15:07:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927537632] [2025-03-03 15:07:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927537632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:43,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046304291] [2025-03-03 15:07:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:43,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:43,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:43,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:43,120 INFO L87 Difference]: Start difference. First operand 2270 states and 3175 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-03-03 15:07:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:43,163 INFO L93 Difference]: Finished difference Result 4693 states and 6632 transitions. [2025-03-03 15:07:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:43,164 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-03-03 15:07:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:43,174 INFO L225 Difference]: With dead ends: 4693 [2025-03-03 15:07:43,174 INFO L226 Difference]: Without dead ends: 3165 [2025-03-03 15:07:43,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:43,178 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 578 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 1484 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-03-03 15:07:43,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 1484 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2025-03-03 15:07:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3155. [2025-03-03 15:07:43,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3155 states, 3153 states have (on average 1.3799555978433238) internal successors, (4351), 3154 states have internal predecessors, (4351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 4351 transitions. [2025-03-03 15:07:43,243 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 4351 transitions. Word has length 65 [2025-03-03 15:07:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:43,243 INFO L471 AbstractCegarLoop]: Abstraction has 3155 states and 4351 transitions. [2025-03-03 15:07:43,243 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-03-03 15:07:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 4351 transitions. [2025-03-03 15:07:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-03 15:07:43,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:43,246 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-03-03 15:07:43,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:07:43,246 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:43,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1692017959, now seen corresponding path program 1 times [2025-03-03 15:07:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22939718] [2025-03-03 15:07:43,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:43,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:43,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-03 15:07:43,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-03 15:07:43,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:43,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:43,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22939718] [2025-03-03 15:07:43,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22939718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:43,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:43,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164939009] [2025-03-03 15:07:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:43,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:43,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:43,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:43,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:43,374 INFO L87 Difference]: Start difference. First operand 3155 states and 4351 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03-03 15:07:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:43,724 INFO L93 Difference]: Finished difference Result 6802 states and 9465 transitions. [2025-03-03 15:07:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:43,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03-03 15:07:43,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:43,737 INFO L225 Difference]: With dead ends: 6802 [2025-03-03 15:07:43,737 INFO L226 Difference]: Without dead ends: 3982 [2025-03-03 15:07:43,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:43,742 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 2284 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2284 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:43,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2284 Valid, 521 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3982 states. [2025-03-03 15:07:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3982 to 3966. [2025-03-03 15:07:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3966 states, 3964 states have (on average 1.3816851664984864) internal successors, (5477), 3965 states have internal predecessors, (5477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:43,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 5477 transitions. [2025-03-03 15:07:43,815 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 5477 transitions. Word has length 66 [2025-03-03 15:07:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:43,816 INFO L471 AbstractCegarLoop]: Abstraction has 3966 states and 5477 transitions. [2025-03-03 15:07:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 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-03-03 15:07:43,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 5477 transitions. [2025-03-03 15:07:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:43,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:43,820 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-03-03 15:07:43,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:07:43,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:43,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash -199161488, now seen corresponding path program 1 times [2025-03-03 15:07:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:43,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148559096] [2025-03-03 15:07:43,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:43,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:43,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:43,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:43,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:43,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:44,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:44,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:44,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148559096] [2025-03-03 15:07:44,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148559096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:44,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:44,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:44,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171627522] [2025-03-03 15:07:44,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:44,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:44,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:44,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:44,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:44,025 INFO L87 Difference]: Start difference. First operand 3966 states and 5477 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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-03-03 15:07:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:44,549 INFO L93 Difference]: Finished difference Result 8216 states and 11566 transitions. [2025-03-03 15:07:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:44,550 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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-03-03 15:07:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:44,568 INFO L225 Difference]: With dead ends: 8216 [2025-03-03 15:07:44,568 INFO L226 Difference]: Without dead ends: 7032 [2025-03-03 15:07:44,573 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-03-03 15:07:44,574 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 3121 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3121 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:44,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3121 Valid, 1019 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7032 states. [2025-03-03 15:07:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7032 to 3990. [2025-03-03 15:07:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3988 states have (on average 1.381394182547643) internal successors, (5509), 3989 states have internal predecessors, (5509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5509 transitions. [2025-03-03 15:07:44,663 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 5509 transitions. Word has length 67 [2025-03-03 15:07:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:44,663 INFO L471 AbstractCegarLoop]: Abstraction has 3990 states and 5509 transitions. [2025-03-03 15:07:44,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 6 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-03-03 15:07:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 5509 transitions. [2025-03-03 15:07:44,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 15:07:44,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:44,667 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-03-03 15:07:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:07:44,667 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1764637317, now seen corresponding path program 1 times [2025-03-03 15:07:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:44,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009214372] [2025-03-03 15:07:44,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 15:07:44,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 15:07:44,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:44,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:44,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:44,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009214372] [2025-03-03 15:07:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009214372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:44,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602032615] [2025-03-03 15:07:44,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:44,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:44,803 INFO L87 Difference]: Start difference. First operand 3990 states and 5509 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-03-03 15:07:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:45,167 INFO L93 Difference]: Finished difference Result 9015 states and 12509 transitions. [2025-03-03 15:07:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:45,167 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-03-03 15:07:45,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:45,191 INFO L225 Difference]: With dead ends: 9015 [2025-03-03 15:07:45,192 INFO L226 Difference]: Without dead ends: 5335 [2025-03-03 15:07:45,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:45,201 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 2348 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2348 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:45,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2348 Valid, 530 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2025-03-03 15:07:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 3990. [2025-03-03 15:07:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3990 states, 3988 states have (on average 1.376629889669007) internal successors, (5490), 3989 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 5490 transitions. [2025-03-03 15:07:45,293 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 5490 transitions. Word has length 67 [2025-03-03 15:07:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:45,293 INFO L471 AbstractCegarLoop]: Abstraction has 3990 states and 5490 transitions. [2025-03-03 15:07:45,293 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-03-03 15:07:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 5490 transitions. [2025-03-03 15:07:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:45,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:45,296 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-03-03 15:07:45,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:07:45,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:45,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 314853775, now seen corresponding path program 1 times [2025-03-03 15:07:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680492015] [2025-03-03 15:07:45,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:45,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:45,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:45,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:45,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:45,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:45,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:45,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680492015] [2025-03-03 15:07:45,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680492015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:45,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:45,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:07:45,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375031609] [2025-03-03 15:07:45,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:45,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:07:45,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:45,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:07:45,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:07:45,418 INFO L87 Difference]: Start difference. First operand 3990 states and 5490 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 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-03-03 15:07:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:45,753 INFO L93 Difference]: Finished difference Result 8904 states and 12251 transitions. [2025-03-03 15:07:45,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:07:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 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-03-03 15:07:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:45,762 INFO L225 Difference]: With dead ends: 8904 [2025-03-03 15:07:45,763 INFO L226 Difference]: Without dead ends: 5195 [2025-03-03 15:07:45,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:45,768 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 2080 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2080 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:45,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2080 Valid, 480 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5195 states. [2025-03-03 15:07:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5195 to 5173. [2025-03-03 15:07:45,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5173 states, 5171 states have (on average 1.3612454070779347) internal successors, (7039), 5172 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:45,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5173 states to 5173 states and 7039 transitions. [2025-03-03 15:07:45,861 INFO L78 Accepts]: Start accepts. Automaton has 5173 states and 7039 transitions. Word has length 68 [2025-03-03 15:07:45,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:45,861 INFO L471 AbstractCegarLoop]: Abstraction has 5173 states and 7039 transitions. [2025-03-03 15:07:45,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 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-03-03 15:07:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 5173 states and 7039 transitions. [2025-03-03 15:07:45,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 15:07:45,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:45,865 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-03-03 15:07:45,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:07:45,866 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:45,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:45,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1029711579, now seen corresponding path program 1 times [2025-03-03 15:07:45,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:45,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419485678] [2025-03-03 15:07:45,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:45,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-03 15:07:45,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-03 15:07:45,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:45,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:45,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:45,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:45,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419485678] [2025-03-03 15:07:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419485678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827549867] [2025-03-03 15:07:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:45,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:45,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:45,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:45,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:45,999 INFO L87 Difference]: Start difference. First operand 5173 states and 7039 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-03-03 15:07:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:46,447 INFO L93 Difference]: Finished difference Result 10854 states and 14878 transitions. [2025-03-03 15:07:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:46,447 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-03-03 15:07:46,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:46,462 INFO L225 Difference]: With dead ends: 10854 [2025-03-03 15:07:46,462 INFO L226 Difference]: Without dead ends: 8337 [2025-03-03 15:07:46,466 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-03-03 15:07:46,467 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 2676 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:46,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 934 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:46,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8337 states. [2025-03-03 15:07:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8337 to 5201. [2025-03-03 15:07:46,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5199 states have (on average 1.3608386228120792) internal successors, (7075), 5200 states have internal predecessors, (7075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 7075 transitions. [2025-03-03 15:07:46,555 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 7075 transitions. Word has length 68 [2025-03-03 15:07:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:46,556 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 7075 transitions. [2025-03-03 15:07:46,556 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-03-03 15:07:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 7075 transitions. [2025-03-03 15:07:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:07:46,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:46,560 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-03-03 15:07:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:07:46,560 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash 337646216, now seen corresponding path program 1 times [2025-03-03 15:07:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230847266] [2025-03-03 15:07:46,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:46,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:07:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:07:46,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:46,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:46,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:46,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230847266] [2025-03-03 15:07:46,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230847266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:46,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:46,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:46,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636179286] [2025-03-03 15:07:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:46,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:46,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:46,737 INFO L87 Difference]: Start difference. First operand 5201 states and 7075 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 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-03-03 15:07:47,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:47,229 INFO L93 Difference]: Finished difference Result 13207 states and 18306 transitions. [2025-03-03 15:07:47,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:47,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 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-03-03 15:07:47,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:47,247 INFO L225 Difference]: With dead ends: 13207 [2025-03-03 15:07:47,247 INFO L226 Difference]: Without dead ends: 10971 [2025-03-03 15:07:47,254 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-03-03 15:07:47,254 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 2912 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:47,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2912 Valid, 998 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10971 states. [2025-03-03 15:07:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10971 to 5298. [2025-03-03 15:07:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5296 states have (on average 1.3602719033232629) internal successors, (7204), 5297 states have internal predecessors, (7204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:47,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7204 transitions. [2025-03-03 15:07:47,353 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7204 transitions. Word has length 69 [2025-03-03 15:07:47,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:47,353 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7204 transitions. [2025-03-03 15:07:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 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-03-03 15:07:47,354 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7204 transitions. [2025-03-03 15:07:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:47,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:47,358 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-03-03 15:07:47,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:07:47,358 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:47,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1319015387, now seen corresponding path program 1 times [2025-03-03 15:07:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:47,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892442102] [2025-03-03 15:07:47,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:47,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892442102] [2025-03-03 15:07:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892442102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:47,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:47,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:47,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360026729] [2025-03-03 15:07:47,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:47,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:07:47,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:47,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:07:47,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:07:47,753 INFO L87 Difference]: Start difference. First operand 5298 states and 7204 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 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-03-03 15:07:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:48,619 INFO L93 Difference]: Finished difference Result 9349 states and 12788 transitions. [2025-03-03 15:07:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:48,620 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 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-03-03 15:07:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:48,631 INFO L225 Difference]: With dead ends: 9349 [2025-03-03 15:07:48,631 INFO L226 Difference]: Without dead ends: 7704 [2025-03-03 15:07:48,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:07:48,635 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 2628 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2628 SdHoareTripleChecker+Valid, 2085 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2628 Valid, 2085 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:07:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7704 states. [2025-03-03 15:07:48,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7704 to 5298. [2025-03-03 15:07:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5298 states, 5296 states have (on average 1.3598942598187311) internal successors, (7202), 5297 states have internal predecessors, (7202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5298 states to 5298 states and 7202 transitions. [2025-03-03 15:07:48,717 INFO L78 Accepts]: Start accepts. Automaton has 5298 states and 7202 transitions. Word has length 70 [2025-03-03 15:07:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:48,717 INFO L471 AbstractCegarLoop]: Abstraction has 5298 states and 7202 transitions. [2025-03-03 15:07:48,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 9 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-03-03 15:07:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5298 states and 7202 transitions. [2025-03-03 15:07:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 15:07:48,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:48,723 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:48,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:07:48,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:48,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:48,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2060489347, now seen corresponding path program 1 times [2025-03-03 15:07:48,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:48,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412205173] [2025-03-03 15:07:48,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:48,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:48,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-03 15:07:48,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 15:07:48,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:48,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:49,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412205173] [2025-03-03 15:07:49,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412205173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:49,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:49,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:49,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163298223] [2025-03-03 15:07:49,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:49,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:49,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:49,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:49,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:49,040 INFO L87 Difference]: Start difference. First operand 5298 states and 7202 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-03-03 15:07:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:49,767 INFO L93 Difference]: Finished difference Result 10936 states and 15114 transitions. [2025-03-03 15:07:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:07:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-03-03 15:07:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:49,779 INFO L225 Difference]: With dead ends: 10936 [2025-03-03 15:07:49,779 INFO L226 Difference]: Without dead ends: 7848 [2025-03-03 15:07:49,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:07:49,783 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 2821 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2821 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:49,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2821 Valid, 1883 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1384 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:07:49,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7848 states. [2025-03-03 15:07:49,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7848 to 5294. [2025-03-03 15:07:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5294 states, 5292 states have (on average 1.3594104308390023) internal successors, (7194), 5293 states have internal predecessors, (7194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:49,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5294 states to 5294 states and 7194 transitions. [2025-03-03 15:07:49,864 INFO L78 Accepts]: Start accepts. Automaton has 5294 states and 7194 transitions. Word has length 70 [2025-03-03 15:07:49,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:49,865 INFO L471 AbstractCegarLoop]: Abstraction has 5294 states and 7194 transitions. [2025-03-03 15:07:49,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 8 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-03-03 15:07:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 5294 states and 7194 transitions. [2025-03-03 15:07:49,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:07:49,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:49,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:49,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:07:49,870 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:49,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2085210585, now seen corresponding path program 1 times [2025-03-03 15:07:49,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:49,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883803216] [2025-03-03 15:07:49,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:49,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:49,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:07:49,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:07:49,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:49,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:50,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:50,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883803216] [2025-03-03 15:07:50,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883803216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:50,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:50,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 15:07:50,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350579385] [2025-03-03 15:07:50,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:50,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:07:50,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:50,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:07:50,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:50,383 INFO L87 Difference]: Start difference. First operand 5294 states and 7194 transitions. Second operand has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:50,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:50,985 INFO L93 Difference]: Finished difference Result 11904 states and 16537 transitions. [2025-03-03 15:07:50,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:07:50,985 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:07:50,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:50,998 INFO L225 Difference]: With dead ends: 11904 [2025-03-03 15:07:50,999 INFO L226 Difference]: Without dead ends: 8692 [2025-03-03 15:07:51,003 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-03-03 15:07:51,004 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 3616 mSDsluCounter, 2210 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3616 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3616 Valid, 2773 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:51,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2025-03-03 15:07:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 5154. [2025-03-03 15:07:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5154 states, 5152 states have (on average 1.361024844720497) internal successors, (7012), 5153 states have internal predecessors, (7012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 7012 transitions. [2025-03-03 15:07:51,069 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 7012 transitions. Word has length 71 [2025-03-03 15:07:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,069 INFO L471 AbstractCegarLoop]: Abstraction has 5154 states and 7012 transitions. [2025-03-03 15:07:51,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.916666666666667) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 7012 transitions. [2025-03-03 15:07:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:07:51,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,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, 1, 1, 1] [2025-03-03 15:07:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:07:51,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:51,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,074 INFO L85 PathProgramCache]: Analyzing trace with hash 663226179, now seen corresponding path program 1 times [2025-03-03 15:07:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736292166] [2025-03-03 15:07:51,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:07:51,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:07:51,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:51,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:51,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:51,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736292166] [2025-03-03 15:07:51,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736292166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:51,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:51,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579348957] [2025-03-03 15:07:51,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:51,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:51,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:51,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:51,185 INFO L87 Difference]: Start difference. First operand 5154 states and 7012 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:51,676 INFO L93 Difference]: Finished difference Result 11856 states and 16359 transitions. [2025-03-03 15:07:51,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:07:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:51,689 INFO L225 Difference]: With dead ends: 11856 [2025-03-03 15:07:51,690 INFO L226 Difference]: Without dead ends: 9784 [2025-03-03 15:07:51,694 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-03-03 15:07:51,694 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 2771 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2771 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:51,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2771 Valid, 963 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9784 states. [2025-03-03 15:07:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9784 to 5225. [2025-03-03 15:07:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5225 states, 5223 states have (on average 1.3614780777331035) internal successors, (7111), 5224 states have internal predecessors, (7111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 7111 transitions. [2025-03-03 15:07:51,797 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 7111 transitions. Word has length 71 [2025-03-03 15:07:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 5225 states and 7111 transitions. [2025-03-03 15:07:51,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:51,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 7111 transitions. [2025-03-03 15:07:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:07:51,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:51,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:51,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:07:51,801 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:51,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:51,802 INFO L85 PathProgramCache]: Analyzing trace with hash 253735554, now seen corresponding path program 1 times [2025-03-03 15:07:51,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:51,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091757466] [2025-03-03 15:07:51,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:51,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:07:51,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:07:51,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:51,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:52,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:52,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091757466] [2025-03-03 15:07:52,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091757466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:52,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:52,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:07:52,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204346259] [2025-03-03 15:07:52,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:52,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:07:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:52,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:07:52,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:07:52,015 INFO L87 Difference]: Start difference. First operand 5225 states and 7111 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:52,683 INFO L93 Difference]: Finished difference Result 13028 states and 18090 transitions. [2025-03-03 15:07:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:07:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:07:52,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:52,697 INFO L225 Difference]: With dead ends: 13028 [2025-03-03 15:07:52,697 INFO L226 Difference]: Without dead ends: 9898 [2025-03-03 15:07:52,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:07:52,703 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 2856 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2856 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:52,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2856 Valid, 1661 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9898 states. [2025-03-03 15:07:52,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9898 to 5201. [2025-03-03 15:07:52,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5201 states, 5199 states have (on average 1.3602615887670706) internal successors, (7072), 5200 states have internal predecessors, (7072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 7072 transitions. [2025-03-03 15:07:52,793 INFO L78 Accepts]: Start accepts. Automaton has 5201 states and 7072 transitions. Word has length 71 [2025-03-03 15:07:52,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:52,793 INFO L471 AbstractCegarLoop]: Abstraction has 5201 states and 7072 transitions. [2025-03-03 15:07:52,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 8 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:52,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5201 states and 7072 transitions. [2025-03-03 15:07:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-03 15:07:52,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:52,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:52,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:07:52,797 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:52,798 INFO L85 PathProgramCache]: Analyzing trace with hash 606016996, now seen corresponding path program 1 times [2025-03-03 15:07:52,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:52,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746644624] [2025-03-03 15:07:52,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:52,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-03 15:07:52,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-03 15:07:52,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:52,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:53,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746644624] [2025-03-03 15:07:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746644624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:53,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:07:53,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136698849] [2025-03-03 15:07:53,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:53,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:07:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:53,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:07:53,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:53,334 INFO L87 Difference]: Start difference. First operand 5201 states and 7072 transitions. Second operand has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:54,232 INFO L93 Difference]: Finished difference Result 17428 states and 24280 transitions. [2025-03-03 15:07:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:07:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-03-03 15:07:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:54,248 INFO L225 Difference]: With dead ends: 17428 [2025-03-03 15:07:54,248 INFO L226 Difference]: Without dead ends: 14322 [2025-03-03 15:07:54,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:07:54,254 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 4231 mSDsluCounter, 2867 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 3420 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:54,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 3420 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14322 states. [2025-03-03 15:07:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14322 to 5175. [2025-03-03 15:07:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5175 states, 5173 states have (on average 1.3601391842257877) internal successors, (7036), 5174 states have internal predecessors, (7036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5175 states to 5175 states and 7036 transitions. [2025-03-03 15:07:54,339 INFO L78 Accepts]: Start accepts. Automaton has 5175 states and 7036 transitions. Word has length 71 [2025-03-03 15:07:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:54,339 INFO L471 AbstractCegarLoop]: Abstraction has 5175 states and 7036 transitions. [2025-03-03 15:07:54,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 5175 states and 7036 transitions. [2025-03-03 15:07:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:07:54,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:54,344 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-03-03 15:07:54,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:07:54,344 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:54,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:54,345 INFO L85 PathProgramCache]: Analyzing trace with hash 380999325, now seen corresponding path program 1 times [2025-03-03 15:07:54,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:54,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970227212] [2025-03-03 15:07:54,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:54,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:54,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:07:54,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:07:54,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:54,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:54,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:54,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:54,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970227212] [2025-03-03 15:07:54,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970227212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:54,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:54,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:54,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076526534] [2025-03-03 15:07:54,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:54,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:07:54,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:54,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:07:54,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:07:54,598 INFO L87 Difference]: Start difference. First operand 5175 states and 7036 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 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-03-03 15:07:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:55,327 INFO L93 Difference]: Finished difference Result 12328 states and 17065 transitions. [2025-03-03 15:07:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:07:55,327 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 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-03-03 15:07:55,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:55,365 INFO L225 Difference]: With dead ends: 12328 [2025-03-03 15:07:55,366 INFO L226 Difference]: Without dead ends: 8998 [2025-03-03 15:07:55,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:07:55,369 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2729 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2729 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:55,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2729 Valid, 2099 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:07:55,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2025-03-03 15:07:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 5050. [2025-03-03 15:07:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5050 states, 5048 states have (on average 1.3601426307448494) internal successors, (6866), 5049 states have internal predecessors, (6866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5050 states to 5050 states and 6866 transitions. [2025-03-03 15:07:55,424 INFO L78 Accepts]: Start accepts. Automaton has 5050 states and 6866 transitions. Word has length 72 [2025-03-03 15:07:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:55,424 INFO L471 AbstractCegarLoop]: Abstraction has 5050 states and 6866 transitions. [2025-03-03 15:07:55,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 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-03-03 15:07:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 5050 states and 6866 transitions. [2025-03-03 15:07:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:07:55,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:55,427 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-03-03 15:07:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:07:55,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:55,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:55,428 INFO L85 PathProgramCache]: Analyzing trace with hash -507102822, now seen corresponding path program 1 times [2025-03-03 15:07:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727238932] [2025-03-03 15:07:55,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:55,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:07:55,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:07:55,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:55,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:55,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727238932] [2025-03-03 15:07:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727238932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:55,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:55,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:07:55,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255711511] [2025-03-03 15:07:55,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:55,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:07:55,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:55,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:07:55,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:07:55,532 INFO L87 Difference]: Start difference. First operand 5050 states and 6866 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 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-03-03 15:07:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:55,998 INFO L93 Difference]: Finished difference Result 11669 states and 16099 transitions. [2025-03-03 15:07:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:07:55,999 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 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-03-03 15:07:55,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:56,009 INFO L225 Difference]: With dead ends: 11669 [2025-03-03 15:07:56,009 INFO L226 Difference]: Without dead ends: 9609 [2025-03-03 15:07:56,013 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-03-03 15:07:56,013 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 2714 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2714 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:56,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2714 Valid, 955 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9609 states. [2025-03-03 15:07:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9609 to 5093. [2025-03-03 15:07:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5093 states, 5091 states have (on average 1.3606364172068357) internal successors, (6927), 5092 states have internal predecessors, (6927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:56,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5093 states to 5093 states and 6927 transitions. [2025-03-03 15:07:56,084 INFO L78 Accepts]: Start accepts. Automaton has 5093 states and 6927 transitions. Word has length 72 [2025-03-03 15:07:56,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:56,084 INFO L471 AbstractCegarLoop]: Abstraction has 5093 states and 6927 transitions. [2025-03-03 15:07:56,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 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-03-03 15:07:56,084 INFO L276 IsEmpty]: Start isEmpty. Operand 5093 states and 6927 transitions. [2025-03-03 15:07:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:07:56,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:56,088 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-03-03 15:07:56,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:07:56,089 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:56,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:56,090 INFO L85 PathProgramCache]: Analyzing trace with hash -540389094, now seen corresponding path program 1 times [2025-03-03 15:07:56,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:56,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472988981] [2025-03-03 15:07:56,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:56,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:56,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:07:56,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:07:56,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:56,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:56,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-03-03 15:07:56,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:56,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472988981] [2025-03-03 15:07:56,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472988981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:56,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:07:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438718727] [2025-03-03 15:07:56,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:07:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:07:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:07:56,526 INFO L87 Difference]: Start difference. First operand 5093 states and 6927 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-03-03 15:07:57,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:57,353 INFO L93 Difference]: Finished difference Result 17585 states and 24422 transitions. [2025-03-03 15:07:57,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:07:57,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-03-03 15:07:57,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:57,374 INFO L225 Difference]: With dead ends: 17585 [2025-03-03 15:07:57,374 INFO L226 Difference]: Without dead ends: 15450 [2025-03-03 15:07:57,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=474, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:07:57,383 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 3780 mSDsluCounter, 2795 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3780 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:57,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3780 Valid, 3282 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15450 states. [2025-03-03 15:07:57,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15450 to 5078. [2025-03-03 15:07:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 5076 states have (on average 1.3605200945626477) internal successors, (6906), 5077 states have internal predecessors, (6906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 6906 transitions. [2025-03-03 15:07:57,476 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 6906 transitions. Word has length 72 [2025-03-03 15:07:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:57,477 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 6906 transitions. [2025-03-03 15:07:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 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-03-03 15:07:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 6906 transitions. [2025-03-03 15:07:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:07:57,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:57,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:07:57,482 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 845423946, now seen corresponding path program 1 times [2025-03-03 15:07:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605924128] [2025-03-03 15:07:57,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:57,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:07:57,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:07:57,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:57,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605924128] [2025-03-03 15:07:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605924128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:58,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:07:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558913768] [2025-03-03 15:07:58,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:07:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:58,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:07:58,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:07:58,026 INFO L87 Difference]: Start difference. First operand 5078 states and 6906 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:58,898 INFO L93 Difference]: Finished difference Result 17538 states and 24368 transitions. [2025-03-03 15:07:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:07:58,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:07:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:58,914 INFO L225 Difference]: With dead ends: 17538 [2025-03-03 15:07:58,914 INFO L226 Difference]: Without dead ends: 15450 [2025-03-03 15:07:58,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:07:58,921 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 4484 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4484 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:58,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4484 Valid, 2766 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:07:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15450 states. [2025-03-03 15:07:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15450 to 5078. [2025-03-03 15:07:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 5076 states have (on average 1.3603230890464932) internal successors, (6905), 5077 states have internal predecessors, (6905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 6905 transitions. [2025-03-03 15:07:59,019 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 6905 transitions. Word has length 73 [2025-03-03 15:07:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:59,019 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 6905 transitions. [2025-03-03 15:07:59,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 6905 transitions. [2025-03-03 15:07:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:07:59,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:59,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:07:59,023 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:59,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1014551585, now seen corresponding path program 1 times [2025-03-03 15:07:59,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463752680] [2025-03-03 15:07:59,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:07:59,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:07:59,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:59,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:59,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463752680] [2025-03-03 15:07:59,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463752680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:59,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:59,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:59,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214837971] [2025-03-03 15:07:59,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:59,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:59,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:59,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:59,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:59,063 INFO L87 Difference]: Start difference. First operand 5078 states and 6905 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:59,153 INFO L93 Difference]: Finished difference Result 9805 states and 13449 transitions. [2025-03-03 15:07:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:59,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:07:59,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:59,160 INFO L225 Difference]: With dead ends: 9805 [2025-03-03 15:07:59,160 INFO L226 Difference]: Without dead ends: 6957 [2025-03-03 15:07:59,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:59,165 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 494 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:59,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 643 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6957 states. [2025-03-03 15:07:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6957 to 6935. [2025-03-03 15:07:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6933 states have (on average 1.3764604067503245) internal successors, (9543), 6934 states have internal predecessors, (9543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 9543 transitions. [2025-03-03 15:07:59,226 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 9543 transitions. Word has length 73 [2025-03-03 15:07:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:59,226 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 9543 transitions. [2025-03-03 15:07:59,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:07:59,226 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 9543 transitions. [2025-03-03 15:07:59,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:07:59,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:59,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:07:59,230 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1544708286, now seen corresponding path program 1 times [2025-03-03 15:07:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214662377] [2025-03-03 15:07:59,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:59,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:07:59,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:07:59,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:59,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214662377] [2025-03-03 15:07:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214662377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:07:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671448204] [2025-03-03 15:07:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:59,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:07:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:59,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:07:59,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:07:59,401 INFO L87 Difference]: Start difference. First operand 6935 states and 9543 transitions. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,013 INFO L93 Difference]: Finished difference Result 12325 states and 17154 transitions. [2025-03-03 15:08:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,020 INFO L225 Difference]: With dead ends: 12325 [2025-03-03 15:08:00,020 INFO L226 Difference]: Without dead ends: 7047 [2025-03-03 15:08:00,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:00,026 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 2052 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 1750 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:08:00,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7047 states. [2025-03-03 15:08:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7047 to 6935. [2025-03-03 15:08:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6933 states have (on average 1.376171931342853) internal successors, (9541), 6934 states have internal predecessors, (9541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 9541 transitions. [2025-03-03 15:08:00,086 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 9541 transitions. Word has length 73 [2025-03-03 15:08:00,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,087 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 9541 transitions. [2025-03-03 15:08:00,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 9 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,087 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 9541 transitions. [2025-03-03 15:08:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:08:00,090 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:08:00,091 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1511422014, now seen corresponding path program 1 times [2025-03-03 15:08:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626088063] [2025-03-03 15:08:00,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:08:00,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:08:00,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626088063] [2025-03-03 15:08:00,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626088063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231047375] [2025-03-03 15:08:00,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,151 INFO L87 Difference]: Start difference. First operand 6935 states and 9541 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,190 INFO L93 Difference]: Finished difference Result 10592 states and 14652 transitions. [2025-03-03 15:08:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-03 15:08:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,196 INFO L225 Difference]: With dead ends: 10592 [2025-03-03 15:08:00,196 INFO L226 Difference]: Without dead ends: 6939 [2025-03-03 15:08:00,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,200 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 319 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1156 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2025-03-03 15:08:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 6935. [2025-03-03 15:08:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6935 states, 6933 states have (on average 1.363623251117842) internal successors, (9454), 6934 states have internal predecessors, (9454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6935 states to 6935 states and 9454 transitions. [2025-03-03 15:08:00,257 INFO L78 Accepts]: Start accepts. Automaton has 6935 states and 9454 transitions. Word has length 73 [2025-03-03 15:08:00,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,257 INFO L471 AbstractCegarLoop]: Abstraction has 6935 states and 9454 transitions. [2025-03-03 15:08:00,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,258 INFO L276 IsEmpty]: Start isEmpty. Operand 6935 states and 9454 transitions. [2025-03-03 15:08:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:00,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:08:00,262 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 736667262, now seen corresponding path program 1 times [2025-03-03 15:08:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054349055] [2025-03-03 15:08:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054349055] [2025-03-03 15:08:00,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054349055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2882509] [2025-03-03 15:08:00,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,308 INFO L87 Difference]: Start difference. First operand 6935 states and 9454 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,336 INFO L93 Difference]: Finished difference Result 9726 states and 13261 transitions. [2025-03-03 15:08:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,343 INFO L225 Difference]: With dead ends: 9726 [2025-03-03 15:08:00,343 INFO L226 Difference]: Without dead ends: 6787 [2025-03-03 15:08:00,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,347 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 384 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 981 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-03-03 15:08:00,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 981 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2025-03-03 15:08:00,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 6785. [2025-03-03 15:08:00,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6785 states, 6783 states have (on average 1.3496977738463807) internal successors, (9155), 6784 states have internal predecessors, (9155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6785 states to 6785 states and 9155 transitions. [2025-03-03 15:08:00,411 INFO L78 Accepts]: Start accepts. Automaton has 6785 states and 9155 transitions. Word has length 74 [2025-03-03 15:08:00,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,411 INFO L471 AbstractCegarLoop]: Abstraction has 6785 states and 9155 transitions. [2025-03-03 15:08:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6785 states and 9155 transitions. [2025-03-03 15:08:00,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:08:00,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:08:00,417 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,417 INFO L85 PathProgramCache]: Analyzing trace with hash 734119046, now seen corresponding path program 1 times [2025-03-03 15:08:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996276571] [2025-03-03 15:08:00,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:08:00,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:08:00,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996276571] [2025-03-03 15:08:00,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996276571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739362412] [2025-03-03 15:08:00,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,459 INFO L87 Difference]: Start difference. First operand 6785 states and 9155 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,492 INFO L93 Difference]: Finished difference Result 10448 states and 14178 transitions. [2025-03-03 15:08:00,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2025-03-03 15:08:00,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,498 INFO L225 Difference]: With dead ends: 10448 [2025-03-03 15:08:00,498 INFO L226 Difference]: Without dead ends: 6787 [2025-03-03 15:08:00,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,503 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 367 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1181 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-03-03 15:08:00,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1181 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6787 states. [2025-03-03 15:08:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6787 to 6785. [2025-03-03 15:08:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6785 states, 6783 states have (on average 1.3392304290137107) internal successors, (9084), 6784 states have internal predecessors, (9084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6785 states to 6785 states and 9084 transitions. [2025-03-03 15:08:00,561 INFO L78 Accepts]: Start accepts. Automaton has 6785 states and 9084 transitions. Word has length 74 [2025-03-03 15:08:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,561 INFO L471 AbstractCegarLoop]: Abstraction has 6785 states and 9084 transitions. [2025-03-03 15:08:00,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 6785 states and 9084 transitions. [2025-03-03 15:08:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:00,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,564 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:08:00,564 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash 441866604, now seen corresponding path program 1 times [2025-03-03 15:08:00,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116742161] [2025-03-03 15:08:00,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:00,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:00,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116742161] [2025-03-03 15:08:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116742161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152942413] [2025-03-03 15:08:00,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,597 INFO L87 Difference]: Start difference. First operand 6785 states and 9084 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,649 INFO L93 Difference]: Finished difference Result 12476 states and 16836 transitions. [2025-03-03 15:08:00,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,657 INFO L225 Difference]: With dead ends: 12476 [2025-03-03 15:08:00,657 INFO L226 Difference]: Without dead ends: 8388 [2025-03-03 15:08:00,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,661 INFO L435 NwaCegarLoop]: 572 mSDtfsCounter, 504 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 756 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8388 states. [2025-03-03 15:08:00,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8388 to 6432. [2025-03-03 15:08:00,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6432 states, 6430 states have (on average 1.3409020217729393) internal successors, (8622), 6431 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6432 states to 6432 states and 8622 transitions. [2025-03-03 15:08:00,725 INFO L78 Accepts]: Start accepts. Automaton has 6432 states and 8622 transitions. Word has length 75 [2025-03-03 15:08:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,725 INFO L471 AbstractCegarLoop]: Abstraction has 6432 states and 8622 transitions. [2025-03-03 15:08:00,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 6432 states and 8622 transitions. [2025-03-03 15:08:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:00,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:08:00,728 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -796087671, now seen corresponding path program 1 times [2025-03-03 15:08:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302446980] [2025-03-03 15:08:00,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:00,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:00,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302446980] [2025-03-03 15:08:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302446980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:00,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:00,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771701852] [2025-03-03 15:08:00,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:00,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:00,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:00,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:00,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,780 INFO L87 Difference]: Start difference. First operand 6432 states and 8622 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:00,840 INFO L93 Difference]: Finished difference Result 11979 states and 16159 transitions. [2025-03-03 15:08:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:00,847 INFO L225 Difference]: With dead ends: 11979 [2025-03-03 15:08:00,847 INFO L226 Difference]: Without dead ends: 7944 [2025-03-03 15:08:00,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:00,850 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 424 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:00,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 665 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7944 states. [2025-03-03 15:08:00,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7944 to 6093. [2025-03-03 15:08:00,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 6091 states have (on average 1.3408307338696437) internal successors, (8167), 6092 states have internal predecessors, (8167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 8167 transitions. [2025-03-03 15:08:00,903 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 8167 transitions. Word has length 75 [2025-03-03 15:08:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:00,903 INFO L471 AbstractCegarLoop]: Abstraction has 6093 states and 8167 transitions. [2025-03-03 15:08:00,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:00,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 8167 transitions. [2025-03-03 15:08:00,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:00,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:00,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:00,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:08:00,906 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:00,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash 523938046, now seen corresponding path program 1 times [2025-03-03 15:08:00,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:00,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468172253] [2025-03-03 15:08:00,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:00,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:00,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:00,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468172253] [2025-03-03 15:08:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468172253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591978155] [2025-03-03 15:08:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:01,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:01,054 INFO L87 Difference]: Start difference. First operand 6093 states and 8167 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:01,515 INFO L93 Difference]: Finished difference Result 8377 states and 11242 transitions. [2025-03-03 15:08:01,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:01,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:01,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:01,522 INFO L225 Difference]: With dead ends: 8377 [2025-03-03 15:08:01,522 INFO L226 Difference]: Without dead ends: 8064 [2025-03-03 15:08:01,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:01,524 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 1829 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:01,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 1315 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8064 states. [2025-03-03 15:08:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8064 to 6093. [2025-03-03 15:08:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6093 states, 6091 states have (on average 1.340666557215564) internal successors, (8166), 6092 states have internal predecessors, (8166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6093 states to 6093 states and 8166 transitions. [2025-03-03 15:08:01,583 INFO L78 Accepts]: Start accepts. Automaton has 6093 states and 8166 transitions. Word has length 75 [2025-03-03 15:08:01,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:01,583 INFO L471 AbstractCegarLoop]: Abstraction has 6093 states and 8166 transitions. [2025-03-03 15:08:01,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:01,583 INFO L276 IsEmpty]: Start isEmpty. Operand 6093 states and 8166 transitions. [2025-03-03 15:08:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-03 15:08:01,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:01,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:01,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:08:01,586 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash 843102187, now seen corresponding path program 1 times [2025-03-03 15:08:01,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:01,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398535925] [2025-03-03 15:08:01,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:01,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:01,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-03 15:08:01,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-03 15:08:01,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:01,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:01,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398535925] [2025-03-03 15:08:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398535925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988144648] [2025-03-03 15:08:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:01,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:01,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:01,789 INFO L87 Difference]: Start difference. First operand 6093 states and 8166 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:02,305 INFO L93 Difference]: Finished difference Result 9868 states and 13286 transitions. [2025-03-03 15:08:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:02,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-03 15:08:02,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:02,312 INFO L225 Difference]: With dead ends: 9868 [2025-03-03 15:08:02,312 INFO L226 Difference]: Without dead ends: 9556 [2025-03-03 15:08:02,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:02,314 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 2081 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2081 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:02,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2081 Valid, 1563 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9556 states. [2025-03-03 15:08:02,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9556 to 6089. [2025-03-03 15:08:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6089 states, 6087 states have (on average 1.3402332840479712) internal successors, (8158), 6088 states have internal predecessors, (8158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6089 states to 6089 states and 8158 transitions. [2025-03-03 15:08:02,391 INFO L78 Accepts]: Start accepts. Automaton has 6089 states and 8158 transitions. Word has length 75 [2025-03-03 15:08:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 6089 states and 8158 transitions. [2025-03-03 15:08:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 6089 states and 8158 transitions. [2025-03-03 15:08:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:02,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:02,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:08:02,395 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1326350626, now seen corresponding path program 1 times [2025-03-03 15:08:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212291121] [2025-03-03 15:08:02,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:02,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:02,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:02,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:02,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212291121] [2025-03-03 15:08:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212291121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181174791] [2025-03-03 15:08:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:02,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:02,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:02,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:02,571 INFO L87 Difference]: Start difference. First operand 6089 states and 8158 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:03,106 INFO L93 Difference]: Finished difference Result 10488 states and 14137 transitions. [2025-03-03 15:08:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:03,107 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,116 INFO L225 Difference]: With dead ends: 10488 [2025-03-03 15:08:03,117 INFO L226 Difference]: Without dead ends: 9551 [2025-03-03 15:08:03,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:03,121 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 2043 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2043 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2043 Valid, 1560 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9551 states. [2025-03-03 15:08:03,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9551 to 6066. [2025-03-03 15:08:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6066 states, 6064 states have (on average 1.3403693931398417) internal successors, (8128), 6065 states have internal predecessors, (8128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6066 states to 6066 states and 8128 transitions. [2025-03-03 15:08:03,183 INFO L78 Accepts]: Start accepts. Automaton has 6066 states and 8128 transitions. Word has length 76 [2025-03-03 15:08:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,183 INFO L471 AbstractCegarLoop]: Abstraction has 6066 states and 8128 transitions. [2025-03-03 15:08:03,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6066 states and 8128 transitions. [2025-03-03 15:08:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,186 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:08:03,187 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -890629057, now seen corresponding path program 1 times [2025-03-03 15:08:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510658606] [2025-03-03 15:08:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:03,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:03,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510658606] [2025-03-03 15:08:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510658606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311570007] [2025-03-03 15:08:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:03,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:03,228 INFO L87 Difference]: Start difference. First operand 6066 states and 8128 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:03,269 INFO L93 Difference]: Finished difference Result 8018 states and 10761 transitions. [2025-03-03 15:08:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:03,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:03,273 INFO L225 Difference]: With dead ends: 8018 [2025-03-03 15:08:03,274 INFO L226 Difference]: Without dead ends: 5090 [2025-03-03 15:08:03,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:03,276 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 296 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:03,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 870 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2025-03-03 15:08:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 3983. [2025-03-03 15:08:03,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3981 states have (on average 1.3124843004270283) internal successors, (5225), 3982 states have internal predecessors, (5225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5225 transitions. [2025-03-03 15:08:03,310 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5225 transitions. Word has length 76 [2025-03-03 15:08:03,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:03,311 INFO L471 AbstractCegarLoop]: Abstraction has 3983 states and 5225 transitions. [2025-03-03 15:08:03,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:03,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5225 transitions. [2025-03-03 15:08:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:03,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:03,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:03,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 15:08:03,313 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:03,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash 701255654, now seen corresponding path program 1 times [2025-03-03 15:08:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:03,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518362952] [2025-03-03 15:08:03,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:03,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:03,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:03,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:03,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:03,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:03,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:03,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:03,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518362952] [2025-03-03 15:08:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518362952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:03,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:03,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970806746] [2025-03-03 15:08:03,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:03,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:08:03,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:03,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:08:03,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:08:03,634 INFO L87 Difference]: Start difference. First operand 3983 states and 5225 transitions. Second operand has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:04,569 INFO L93 Difference]: Finished difference Result 12457 states and 16590 transitions. [2025-03-03 15:08:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 15:08:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:04,580 INFO L225 Difference]: With dead ends: 12457 [2025-03-03 15:08:04,580 INFO L226 Difference]: Without dead ends: 12380 [2025-03-03 15:08:04,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=719, Unknown=0, NotChecked=0, Total=992 [2025-03-03 15:08:04,584 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 5342 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5342 SdHoareTripleChecker+Valid, 1573 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:04,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5342 Valid, 1573 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:08:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12380 states. [2025-03-03 15:08:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12380 to 3987. [2025-03-03 15:08:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3985 states have (on average 1.3121706398996236) internal successors, (5229), 3986 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 5229 transitions. [2025-03-03 15:08:04,646 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 5229 transitions. Word has length 76 [2025-03-03 15:08:04,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:04,646 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 5229 transitions. [2025-03-03 15:08:04,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.333333333333333) internal successors, (76), 11 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 5229 transitions. [2025-03-03 15:08:04,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 15:08:04,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:04,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:04,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 15:08:04,649 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:04,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1449166823, now seen corresponding path program 1 times [2025-03-03 15:08:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412342361] [2025-03-03 15:08:04,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:04,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 15:08:04,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 15:08:04,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:04,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:04,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-03-03 15:08:04,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:04,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412342361] [2025-03-03 15:08:04,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412342361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:04,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:04,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:04,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099610788] [2025-03-03 15:08:04,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:04,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:04,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:04,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:04,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:04,836 INFO L87 Difference]: Start difference. First operand 3987 states and 5229 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:05,274 INFO L93 Difference]: Finished difference Result 6142 states and 8110 transitions. [2025-03-03 15:08:05,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:08:05,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-03-03 15:08:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:05,280 INFO L225 Difference]: With dead ends: 6142 [2025-03-03 15:08:05,280 INFO L226 Difference]: Without dead ends: 6075 [2025-03-03 15:08:05,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-03-03 15:08:05,281 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 2037 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:05,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2037 Valid, 1585 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6075 states. [2025-03-03 15:08:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6075 to 3987. [2025-03-03 15:08:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3987 states, 3985 states have (on average 1.3119196988707653) internal successors, (5228), 3986 states have internal predecessors, (5228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3987 states to 3987 states and 5228 transitions. [2025-03-03 15:08:05,325 INFO L78 Accepts]: Start accepts. Automaton has 3987 states and 5228 transitions. Word has length 76 [2025-03-03 15:08:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,325 INFO L471 AbstractCegarLoop]: Abstraction has 3987 states and 5228 transitions. [2025-03-03 15:08:05,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3987 states and 5228 transitions. [2025-03-03 15:08:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:08:05,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:05,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 15:08:05,327 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:05,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash 198230752, now seen corresponding path program 1 times [2025-03-03 15:08:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372433140] [2025-03-03 15:08:05,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:05,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:08:05,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:08:05,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:05,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:05,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:05,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372433140] [2025-03-03 15:08:05,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372433140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:05,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:05,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 15:08:05,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309728637] [2025-03-03 15:08:05,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:05,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 15:08:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:05,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 15:08:05,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-03 15:08:05,467 INFO L87 Difference]: Start difference. First operand 3987 states and 5228 transitions. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:05,957 INFO L93 Difference]: Finished difference Result 5280 states and 6940 transitions. [2025-03-03 15:08:05,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 15:08:05,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-03 15:08:05,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:05,961 INFO L225 Difference]: With dead ends: 5280 [2025-03-03 15:08:05,961 INFO L226 Difference]: Without dead ends: 5203 [2025-03-03 15:08:05,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:08:05,963 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 1125 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:05,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1294 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:08:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2025-03-03 15:08:05,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 3983. [2025-03-03 15:08:05,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3981 states have (on average 1.3119819140919367) internal successors, (5223), 3982 states have internal predecessors, (5223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 5223 transitions. [2025-03-03 15:08:05,994 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 5223 transitions. Word has length 77 [2025-03-03 15:08:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:05,994 INFO L471 AbstractCegarLoop]: Abstraction has 3983 states and 5223 transitions. [2025-03-03 15:08:05,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 5223 transitions. [2025-03-03 15:08:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:08:05,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:05,996 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:05,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:08:05,997 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:05,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash -248390209, now seen corresponding path program 1 times [2025-03-03 15:08:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120935264] [2025-03-03 15:08:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:06,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:08:06,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:08:06,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:06,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:06,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:06,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120935264] [2025-03-03 15:08:06,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120935264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:06,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:06,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:08:06,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523879089] [2025-03-03 15:08:06,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:06,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:08:06,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:06,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:08:06,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:08:06,426 INFO L87 Difference]: Start difference. First operand 3983 states and 5223 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:07,068 INFO L93 Difference]: Finished difference Result 12254 states and 16342 transitions. [2025-03-03 15:08:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:08:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:08:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:07,080 INFO L225 Difference]: With dead ends: 12254 [2025-03-03 15:08:07,080 INFO L226 Difference]: Without dead ends: 12160 [2025-03-03 15:08:07,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:08:07,082 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 2932 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2932 SdHoareTripleChecker+Valid, 3660 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:07,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2932 Valid, 3660 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2025-03-03 15:08:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 3954. [2025-03-03 15:08:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3954 states, 3953 states have (on average 1.311409056412851) internal successors, (5184), 3953 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3954 states to 3954 states and 5184 transitions. [2025-03-03 15:08:07,135 INFO L78 Accepts]: Start accepts. Automaton has 3954 states and 5184 transitions. Word has length 78 [2025-03-03 15:08:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:07,135 INFO L471 AbstractCegarLoop]: Abstraction has 3954 states and 5184 transitions. [2025-03-03 15:08:07,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3954 states and 5184 transitions. [2025-03-03 15:08:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:07,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:07,137 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:07,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 15:08:07,137 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:07,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1602659903, now seen corresponding path program 1 times [2025-03-03 15:08:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:07,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057784215] [2025-03-03 15:08:07,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:07,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:07,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:07,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:07,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057784215] [2025-03-03 15:08:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057784215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2025-03-03 15:08:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948340928] [2025-03-03 15:08:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:08,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 15:08:08,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:08,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 15:08:08,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-03-03 15:08:08,367 INFO L87 Difference]: Start difference. First operand 3954 states and 5184 transitions. Second operand has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:11,094 INFO L93 Difference]: Finished difference Result 7891 states and 10386 transitions. [2025-03-03 15:08:11,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 15:08:11,094 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:11,101 INFO L225 Difference]: With dead ends: 7891 [2025-03-03 15:08:11,101 INFO L226 Difference]: Without dead ends: 7825 [2025-03-03 15:08:11,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=420, Invalid=2232, Unknown=0, NotChecked=0, Total=2652 [2025-03-03 15:08:11,103 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 3883 mSDsluCounter, 6523 mSDsCounter, 0 mSdLazyCounter, 3590 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3883 SdHoareTripleChecker+Valid, 6924 SdHoareTripleChecker+Invalid, 3604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:11,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3883 Valid, 6924 Invalid, 3604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3590 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 15:08:11,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2025-03-03 15:08:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 3972. [2025-03-03 15:08:11,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3972 states, 3971 states have (on average 1.3115084361621758) internal successors, (5208), 3971 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3972 states to 3972 states and 5208 transitions. [2025-03-03 15:08:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3972 states and 5208 transitions. Word has length 79 [2025-03-03 15:08:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:11,137 INFO L471 AbstractCegarLoop]: Abstraction has 3972 states and 5208 transitions. [2025-03-03 15:08:11,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.925925925925926) internal successors, (79), 27 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3972 states and 5208 transitions. [2025-03-03 15:08:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:11,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:11,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:11,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:08:11,140 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -652447485, now seen corresponding path program 1 times [2025-03-03 15:08:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61362433] [2025-03-03 15:08:11,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:11,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:11,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:11,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:11,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:11,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61362433] [2025-03-03 15:08:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61362433] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:11,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-03 15:08:11,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796461666] [2025-03-03 15:08:11,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:11,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 15:08:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:11,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 15:08:11,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=502, Unknown=0, NotChecked=0, Total=552 [2025-03-03 15:08:11,960 INFO L87 Difference]: Start difference. First operand 3972 states and 5208 transitions. Second operand has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:14,297 INFO L93 Difference]: Finished difference Result 11115 states and 14753 transitions. [2025-03-03 15:08:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 15:08:14,298 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:14,311 INFO L225 Difference]: With dead ends: 11115 [2025-03-03 15:08:14,311 INFO L226 Difference]: Without dead ends: 11047 [2025-03-03 15:08:14,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 15:08:14,315 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 3743 mSDsluCounter, 5758 mSDsCounter, 0 mSdLazyCounter, 3200 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3743 SdHoareTripleChecker+Valid, 6135 SdHoareTripleChecker+Invalid, 3220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:14,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3743 Valid, 6135 Invalid, 3220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3200 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 15:08:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2025-03-03 15:08:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 3984. [2025-03-03 15:08:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3983 states have (on average 1.311072056239016) internal successors, (5222), 3983 states have internal predecessors, (5222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 5222 transitions. [2025-03-03 15:08:14,364 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 5222 transitions. Word has length 79 [2025-03-03 15:08:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:14,364 INFO L471 AbstractCegarLoop]: Abstraction has 3984 states and 5222 transitions. [2025-03-03 15:08:14,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 5222 transitions. [2025-03-03 15:08:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 15:08:14,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:14,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:14,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 15:08:14,368 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:14,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1147145692, now seen corresponding path program 1 times [2025-03-03 15:08:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:14,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239894238] [2025-03-03 15:08:14,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:14,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 15:08:14,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 15:08:14,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:14,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239894238] [2025-03-03 15:08:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239894238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:14,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:14,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:08:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834624881] [2025-03-03 15:08:14,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:14,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:08:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:14,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:08:14,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:08:14,713 INFO L87 Difference]: Start difference. First operand 3984 states and 5222 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:15,231 INFO L93 Difference]: Finished difference Result 11354 states and 15084 transitions. [2025-03-03 15:08:15,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:08:15,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2025-03-03 15:08:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:15,239 INFO L225 Difference]: With dead ends: 11354 [2025-03-03 15:08:15,239 INFO L226 Difference]: Without dead ends: 11244 [2025-03-03 15:08:15,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:08:15,241 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 3311 mSDsluCounter, 2208 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3311 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:15,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3311 Valid, 2554 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:08:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11244 states. [2025-03-03 15:08:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11244 to 3939. [2025-03-03 15:08:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3938 states have (on average 1.3118334179786695) internal successors, (5166), 3938 states have internal predecessors, (5166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 5166 transitions. [2025-03-03 15:08:15,288 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 5166 transitions. Word has length 79 [2025-03-03 15:08:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:15,288 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 5166 transitions. [2025-03-03 15:08:15,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 5166 transitions. [2025-03-03 15:08:15,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:08:15,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:15,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:15,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 15:08:15,291 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:15,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1048600896, now seen corresponding path program 1 times [2025-03-03 15:08:15,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:15,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534883923] [2025-03-03 15:08:15,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:15,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:08:15,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:08:15,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:15,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:15,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-03-03 15:08:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534883923] [2025-03-03 15:08:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534883923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:15,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:15,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:08:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041583197] [2025-03-03 15:08:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:08:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:15,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:08:15,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:08:15,589 INFO L87 Difference]: Start difference. First operand 3939 states and 5166 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:15,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:15,986 INFO L93 Difference]: Finished difference Result 6730 states and 8914 transitions. [2025-03-03 15:08:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:08:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-03 15:08:15,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:15,991 INFO L225 Difference]: With dead ends: 6730 [2025-03-03 15:08:15,991 INFO L226 Difference]: Without dead ends: 6664 [2025-03-03 15:08:15,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:08:15,993 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 1328 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:15,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1328 Valid, 2300 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:08:15,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2025-03-03 15:08:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 3920. [2025-03-03 15:08:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.3115590711916305) internal successors, (5140), 3919 states have internal predecessors, (5140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 5140 transitions. [2025-03-03 15:08:16,027 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 5140 transitions. Word has length 80 [2025-03-03 15:08:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,027 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 5140 transitions. [2025-03-03 15:08:16,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 5140 transitions. [2025-03-03 15:08:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:08:16,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,030 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] [2025-03-03 15:08:16,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 15:08:16,030 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash 951186393, now seen corresponding path program 1 times [2025-03-03 15:08:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456911853] [2025-03-03 15:08:16,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:08:16,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:08:16,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:16,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456911853] [2025-03-03 15:08:16,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456911853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:16,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414427552] [2025-03-03 15:08:16,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:16,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:16,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:16,119 INFO L87 Difference]: Start difference. First operand 3920 states and 5140 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,213 INFO L93 Difference]: Finished difference Result 11292 states and 15234 transitions. [2025-03-03 15:08:16,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:16,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:08:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,219 INFO L225 Difference]: With dead ends: 11292 [2025-03-03 15:08:16,220 INFO L226 Difference]: Without dead ends: 8428 [2025-03-03 15:08:16,222 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-03-03 15:08:16,222 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 1813 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 1151 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8428 states. [2025-03-03 15:08:16,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8428 to 6410. [2025-03-03 15:08:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6410 states, 6409 states have (on average 1.3173662037759402) internal successors, (8443), 6409 states have internal predecessors, (8443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6410 states to 6410 states and 8443 transitions. [2025-03-03 15:08:16,294 INFO L78 Accepts]: Start accepts. Automaton has 6410 states and 8443 transitions. Word has length 85 [2025-03-03 15:08:16,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,294 INFO L471 AbstractCegarLoop]: Abstraction has 6410 states and 8443 transitions. [2025-03-03 15:08:16,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6410 states and 8443 transitions. [2025-03-03 15:08:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:08:16,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,300 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-03-03 15:08:16,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 15:08:16,300 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash -548408309, now seen corresponding path program 1 times [2025-03-03 15:08:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630440973] [2025-03-03 15:08:16,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:08:16,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:08:16,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:16,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630440973] [2025-03-03 15:08:16,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630440973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:16,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063620733] [2025-03-03 15:08:16,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:16,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:16,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:16,407 INFO L87 Difference]: Start difference. First operand 6410 states and 8443 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-03-03 15:08:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,502 INFO L93 Difference]: Finished difference Result 6418 states and 8447 transitions. [2025-03-03 15:08:16,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:16,502 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-03-03 15:08:16,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,507 INFO L225 Difference]: With dead ends: 6418 [2025-03-03 15:08:16,507 INFO L226 Difference]: Without dead ends: 5975 [2025-03-03 15:08:16,509 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-03-03 15:08:16,509 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 1008 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 1050 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:08:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2025-03-03 15:08:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 5969. [2025-03-03 15:08:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5969 states, 5968 states have (on average 1.319872654155496) internal successors, (7877), 5968 states have internal predecessors, (7877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5969 states to 5969 states and 7877 transitions. [2025-03-03 15:08:16,557 INFO L78 Accepts]: Start accepts. Automaton has 5969 states and 7877 transitions. Word has length 86 [2025-03-03 15:08:16,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,557 INFO L471 AbstractCegarLoop]: Abstraction has 5969 states and 7877 transitions. [2025-03-03 15:08:16,557 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-03-03 15:08:16,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5969 states and 7877 transitions. [2025-03-03 15:08:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 15:08:16,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,561 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-03-03 15:08:16,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:08:16,561 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,562 INFO L85 PathProgramCache]: Analyzing trace with hash -128250873, now seen corresponding path program 1 times [2025-03-03 15:08:16,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653859343] [2025-03-03 15:08:16,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 15:08:16,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 15:08:16,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:16,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653859343] [2025-03-03 15:08:16,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653859343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:16,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848646901] [2025-03-03 15:08:16,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:16,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:16,636 INFO L87 Difference]: Start difference. First operand 5969 states and 7877 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-03-03 15:08:16,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,682 INFO L93 Difference]: Finished difference Result 15613 states and 20855 transitions. [2025-03-03 15:08:16,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:16,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-03-03 15:08:16,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,690 INFO L225 Difference]: With dead ends: 15613 [2025-03-03 15:08:16,690 INFO L226 Difference]: Without dead ends: 10631 [2025-03-03 15:08:16,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:16,694 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 160 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 770 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10631 states. [2025-03-03 15:08:16,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10631 to 10133. [2025-03-03 15:08:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10133 states, 10132 states have (on average 1.324022897749704) internal successors, (13415), 10132 states have internal predecessors, (13415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10133 states to 10133 states and 13415 transitions. [2025-03-03 15:08:16,767 INFO L78 Accepts]: Start accepts. Automaton has 10133 states and 13415 transitions. Word has length 87 [2025-03-03 15:08:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 10133 states and 13415 transitions. [2025-03-03 15:08:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 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-03-03 15:08:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 10133 states and 13415 transitions. [2025-03-03 15:08:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:08:16,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:16,771 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-03-03 15:08:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:08:16,771 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:16,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:16,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1221525511, now seen corresponding path program 1 times [2025-03-03 15:08:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:16,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567760765] [2025-03-03 15:08:16,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:16,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:16,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:08:16,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:08:16,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:16,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567760765] [2025-03-03 15:08:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567760765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176235082] [2025-03-03 15:08:16,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:16,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:16,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:16,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:16,830 INFO L87 Difference]: Start difference. First operand 10133 states and 13415 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-03-03 15:08:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:16,891 INFO L93 Difference]: Finished difference Result 27785 states and 36985 transitions. [2025-03-03 15:08:16,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:16,891 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-03-03 15:08:16,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:16,906 INFO L225 Difference]: With dead ends: 27785 [2025-03-03 15:08:16,906 INFO L226 Difference]: Without dead ends: 18639 [2025-03-03 15:08:16,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:16,914 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 135 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:16,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 766 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18639 states. [2025-03-03 15:08:17,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18639 to 17645. [2025-03-03 15:08:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17645 states, 17644 states have (on average 1.320505554296078) internal successors, (23299), 17644 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17645 states to 17645 states and 23299 transitions. [2025-03-03 15:08:17,071 INFO L78 Accepts]: Start accepts. Automaton has 17645 states and 23299 transitions. Word has length 88 [2025-03-03 15:08:17,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:17,071 INFO L471 AbstractCegarLoop]: Abstraction has 17645 states and 23299 transitions. [2025-03-03 15:08:17,071 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-03-03 15:08:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17645 states and 23299 transitions. [2025-03-03 15:08:17,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 15:08:17,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:17,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 15:08:17,074 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:17,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:17,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1391192735, now seen corresponding path program 1 times [2025-03-03 15:08:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881958046] [2025-03-03 15:08:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:17,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-03 15:08:17,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-03 15:08:17,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:17,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:17,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881958046] [2025-03-03 15:08:17,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881958046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100303424] [2025-03-03 15:08:17,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:17,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:17,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:17,131 INFO L87 Difference]: Start difference. First operand 17645 states and 23299 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-03-03 15:08:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,245 INFO L93 Difference]: Finished difference Result 49681 states and 65669 transitions. [2025-03-03 15:08:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:17,245 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-03-03 15:08:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:17,281 INFO L225 Difference]: With dead ends: 49681 [2025-03-03 15:08:17,281 INFO L226 Difference]: Without dead ends: 33023 [2025-03-03 15:08:17,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:17,299 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 102 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:17,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 764 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33023 states. [2025-03-03 15:08:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33023 to 31037. [2025-03-03 15:08:17,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31037 states, 31036 states have (on average 1.310832581518237) internal successors, (40683), 31036 states have internal predecessors, (40683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31037 states to 31037 states and 40683 transitions. [2025-03-03 15:08:17,634 INFO L78 Accepts]: Start accepts. Automaton has 31037 states and 40683 transitions. Word has length 91 [2025-03-03 15:08:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:17,634 INFO L471 AbstractCegarLoop]: Abstraction has 31037 states and 40683 transitions. [2025-03-03 15:08:17,634 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-03-03 15:08:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 31037 states and 40683 transitions. [2025-03-03 15:08:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 15:08:17,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:17,638 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-03-03 15:08:17,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 15:08:17,638 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:17,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -929431275, now seen corresponding path program 1 times [2025-03-03 15:08:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282072470] [2025-03-03 15:08:17,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:17,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 15:08:17,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 15:08:17,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:17,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:17,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:17,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282072470] [2025-03-03 15:08:17,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282072470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:17,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:17,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958189183] [2025-03-03 15:08:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:17,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:17,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:17,889 INFO L87 Difference]: Start difference. First operand 31037 states and 40683 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-03-03 15:08:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:17,995 INFO L93 Difference]: Finished difference Result 33247 states and 43628 transitions. [2025-03-03 15:08:17,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:17,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-03-03 15:08:17,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:18,027 INFO L225 Difference]: With dead ends: 33247 [2025-03-03 15:08:18,027 INFO L226 Difference]: Without dead ends: 33245 [2025-03-03 15:08:18,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:18,037 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 0 mSDsluCounter, 1530 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1920 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:18,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33245 states. [2025-03-03 15:08:18,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33245 to 33245. [2025-03-03 15:08:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33245 states, 33244 states have (on average 1.2901877030441584) internal successors, (42891), 33244 states have internal predecessors, (42891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33245 states to 33245 states and 42891 transitions. [2025-03-03 15:08:18,422 INFO L78 Accepts]: Start accepts. Automaton has 33245 states and 42891 transitions. Word has length 92 [2025-03-03 15:08:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:18,422 INFO L471 AbstractCegarLoop]: Abstraction has 33245 states and 42891 transitions. [2025-03-03 15:08:18,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 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-03-03 15:08:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 33245 states and 42891 transitions. [2025-03-03 15:08:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:08:18,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:18,426 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] [2025-03-03 15:08:18,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 15:08:18,426 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1400196815, now seen corresponding path program 1 times [2025-03-03 15:08:18,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:18,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648112383] [2025-03-03 15:08:18,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:18,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:18,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:08:18,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:08:18,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:18,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:18,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:18,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:18,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648112383] [2025-03-03 15:08:18,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648112383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:18,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:18,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:18,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354283523] [2025-03-03 15:08:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:18,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:18,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:18,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:18,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:18,466 INFO L87 Difference]: Start difference. First operand 33245 states and 42891 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:18,688 INFO L93 Difference]: Finished difference Result 91745 states and 118029 transitions. [2025-03-03 15:08:18,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:18,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 15:08:18,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:18,751 INFO L225 Difference]: With dead ends: 91745 [2025-03-03 15:08:18,751 INFO L226 Difference]: Without dead ends: 59487 [2025-03-03 15:08:18,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:18,771 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 264 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:18,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 578 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59487 states. [2025-03-03 15:08:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59487 to 59485. [2025-03-03 15:08:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59485 states, 59484 states have (on average 1.2700390020845942) internal successors, (75547), 59484 states have internal predecessors, (75547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59485 states to 59485 states and 75547 transitions. [2025-03-03 15:08:19,471 INFO L78 Accepts]: Start accepts. Automaton has 59485 states and 75547 transitions. Word has length 93 [2025-03-03 15:08:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:19,472 INFO L471 AbstractCegarLoop]: Abstraction has 59485 states and 75547 transitions. [2025-03-03 15:08:19,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 59485 states and 75547 transitions. [2025-03-03 15:08:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 15:08:19,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:19,475 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] [2025-03-03 15:08:19,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 15:08:19,476 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:19,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:19,476 INFO L85 PathProgramCache]: Analyzing trace with hash -795318529, now seen corresponding path program 1 times [2025-03-03 15:08:19,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191868085] [2025-03-03 15:08:19,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:19,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 15:08:19,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 15:08:19,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:19,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191868085] [2025-03-03 15:08:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191868085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:08:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585822753] [2025-03-03 15:08:19,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:19,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:08:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:19,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:08:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,537 INFO L87 Difference]: Start difference. First operand 59485 states and 75547 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:19,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:19,788 INFO L93 Difference]: Finished difference Result 154417 states and 195437 transitions. [2025-03-03 15:08:19,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:08:19,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 15:08:19,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:19,889 INFO L225 Difference]: With dead ends: 154417 [2025-03-03 15:08:19,889 INFO L226 Difference]: Without dead ends: 95919 [2025-03-03 15:08:19,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:08:19,938 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 175 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:19,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 786 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:20,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95919 states. [2025-03-03 15:08:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95919 to 89517. [2025-03-03 15:08:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89517 states, 89516 states have (on average 1.2545131596586085) internal successors, (112299), 89516 states have internal predecessors, (112299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89517 states to 89517 states and 112299 transitions. [2025-03-03 15:08:21,119 INFO L78 Accepts]: Start accepts. Automaton has 89517 states and 112299 transitions. Word has length 93 [2025-03-03 15:08:21,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:21,119 INFO L471 AbstractCegarLoop]: Abstraction has 89517 states and 112299 transitions. [2025-03-03 15:08:21,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,119 INFO L276 IsEmpty]: Start isEmpty. Operand 89517 states and 112299 transitions. [2025-03-03 15:08:21,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 15:08:21,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:21,122 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] [2025-03-03 15:08:21,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 15:08:21,122 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1347256403, now seen corresponding path program 1 times [2025-03-03 15:08:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34083886] [2025-03-03 15:08:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:21,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 15:08:21,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 15:08:21,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:21,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34083886] [2025-03-03 15:08:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34083886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190858851] [2025-03-03 15:08:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:21,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:21,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:21,192 INFO L87 Difference]: Start difference. First operand 89517 states and 112299 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:21,463 INFO L93 Difference]: Finished difference Result 143687 states and 181336 transitions. [2025-03-03 15:08:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-03 15:08:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:21,605 INFO L225 Difference]: With dead ends: 143687 [2025-03-03 15:08:21,606 INFO L226 Difference]: Without dead ends: 125469 [2025-03-03 15:08:21,650 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-03-03 15:08:21,650 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1296 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:21,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1376 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:21,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125469 states. [2025-03-03 15:08:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125469 to 103525. [2025-03-03 15:08:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103525 states, 103524 states have (on average 1.252917197944438) internal successors, (129707), 103524 states have internal predecessors, (129707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103525 states to 103525 states and 129707 transitions. [2025-03-03 15:08:23,155 INFO L78 Accepts]: Start accepts. Automaton has 103525 states and 129707 transitions. Word has length 96 [2025-03-03 15:08:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:23,155 INFO L471 AbstractCegarLoop]: Abstraction has 103525 states and 129707 transitions. [2025-03-03 15:08:23,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 103525 states and 129707 transitions. [2025-03-03 15:08:23,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 15:08:23,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:23,158 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, 1, 1] [2025-03-03 15:08:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 15:08:23,159 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:23,159 INFO L85 PathProgramCache]: Analyzing trace with hash -644993632, now seen corresponding path program 1 times [2025-03-03 15:08:23,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:23,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383485901] [2025-03-03 15:08:23,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:23,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:23,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 15:08:23,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 15:08:23,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:23,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:23,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383485901] [2025-03-03 15:08:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383485901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:23,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:23,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:23,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229103466] [2025-03-03 15:08:23,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:23,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:23,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:23,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:23,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:23,243 INFO L87 Difference]: Start difference. First operand 103525 states and 129707 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:23,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:23,844 INFO L93 Difference]: Finished difference Result 149495 states and 188296 transitions. [2025-03-03 15:08:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:23,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-03 15:08:23,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:24,006 INFO L225 Difference]: With dead ends: 149495 [2025-03-03 15:08:24,006 INFO L226 Difference]: Without dead ends: 131277 [2025-03-03 15:08:24,031 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-03-03 15:08:24,035 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1409 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:24,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1301 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131277 states. [2025-03-03 15:08:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131277 to 117533. [2025-03-03 15:08:25,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117533 states, 117532 states have (on average 1.2517016642276146) internal successors, (147115), 117532 states have internal predecessors, (147115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117533 states to 117533 states and 147115 transitions. [2025-03-03 15:08:25,522 INFO L78 Accepts]: Start accepts. Automaton has 117533 states and 147115 transitions. Word has length 101 [2025-03-03 15:08:25,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:25,522 INFO L471 AbstractCegarLoop]: Abstraction has 117533 states and 147115 transitions. [2025-03-03 15:08:25,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 117533 states and 147115 transitions. [2025-03-03 15:08:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 15:08:25,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:25,527 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, 1, 1, 1, 1] [2025-03-03 15:08:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 15:08:25,527 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:25,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash -829136166, now seen corresponding path program 1 times [2025-03-03 15:08:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:25,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613045641] [2025-03-03 15:08:25,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:25,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 15:08:25,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 15:08:25,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:25,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:25,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613045641] [2025-03-03 15:08:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613045641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:08:25,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:08:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:08:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114839506] [2025-03-03 15:08:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:08:25,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:08:25,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:25,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:08:25,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:08:25,634 INFO L87 Difference]: Start difference. First operand 117533 states and 147115 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:26,466 INFO L93 Difference]: Finished difference Result 175947 states and 221568 transitions. [2025-03-03 15:08:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:08:26,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-03-03 15:08:26,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:26,647 INFO L225 Difference]: With dead ends: 175947 [2025-03-03 15:08:26,647 INFO L226 Difference]: Without dead ends: 148297 [2025-03-03 15:08:26,678 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-03-03 15:08:26,679 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1403 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:26,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 1332 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:08:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148297 states. [2025-03-03 15:08:27,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148297 to 136677. [2025-03-03 15:08:28,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136677 states, 136676 states have (on average 1.2501024320290322) internal successors, (170859), 136676 states have internal predecessors, (170859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136677 states to 136677 states and 170859 transitions. [2025-03-03 15:08:28,320 INFO L78 Accepts]: Start accepts. Automaton has 136677 states and 170859 transitions. Word has length 103 [2025-03-03 15:08:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:08:28,320 INFO L471 AbstractCegarLoop]: Abstraction has 136677 states and 170859 transitions. [2025-03-03 15:08:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 136677 states and 170859 transitions. [2025-03-03 15:08:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 15:08:28,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:08:28,338 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:08:28,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 15:08:28,338 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:08:28,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:08:28,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1873577990, now seen corresponding path program 1 times [2025-03-03 15:08:28,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:08:28,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46164183] [2025-03-03 15:08:28,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:28,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:08:28,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:08:28,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:08:28,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:28,811 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:28,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:08:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46164183] [2025-03-03 15:08:28,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46164183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:08:28,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448039897] [2025-03-03 15:08:28,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:08:28,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:08:28,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:08:28,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:08:28,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:08:28,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 15:08:29,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 15:08:29,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:08:29,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:08:29,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 15:08:29,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:08:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:29,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:08:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:08:30,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448039897] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:08:30,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:08:30,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 8] total 26 [2025-03-03 15:08:30,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347301152] [2025-03-03 15:08:30,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:08:30,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 15:08:30,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:08:30,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 15:08:30,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:08:30,023 INFO L87 Difference]: Start difference. First operand 136677 states and 170859 transitions. Second operand has 26 states, 26 states have (on average 13.307692307692308) internal successors, (346), 26 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:08:39,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:08:39,143 INFO L93 Difference]: Finished difference Result 911572 states and 1144039 transitions. [2025-03-03 15:08:39,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2025-03-03 15:08:39,144 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 13.307692307692308) internal successors, (346), 26 states have internal predecessors, (346), 0 states have call successors, (0), 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 119 [2025-03-03 15:08:39,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:08:40,567 INFO L225 Difference]: With dead ends: 911572 [2025-03-03 15:08:40,567 INFO L226 Difference]: Without dead ends: 775882 [2025-03-03 15:08:40,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15803 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5052, Invalid=33168, Unknown=0, NotChecked=0, Total=38220 [2025-03-03 15:08:40,690 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 18403 mSDsluCounter, 4851 mSDsCounter, 0 mSdLazyCounter, 5023 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18403 SdHoareTripleChecker+Valid, 5289 SdHoareTripleChecker+Invalid, 5167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 5023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:08:40,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18403 Valid, 5289 Invalid, 5167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 5023 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 15:08:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775882 states. [2025-03-03 15:08:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775882 to 521418. [2025-03-03 15:08:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521418 states, 521417 states have (on average 1.2542533135666847) internal successors, (653989), 521417 states have internal predecessors, (653989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)