./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.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_opt-floodmax.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 4eae6e6c8bbb105c3dcf0e7edf73f931915af6d6745ce5116ee35a4a9fee030a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:20:43,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:20:43,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:20:43,705 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:20:43,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:20:43,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:20:43,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:20:43,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:20:43,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:20:43,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:20:43,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:20:43,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:20:43,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:20:43,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:20:43,721 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:20:43,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:20:43,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:20:43,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:20:43,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:20:43,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:20:43,722 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 -> 4eae6e6c8bbb105c3dcf0e7edf73f931915af6d6745ce5116ee35a4a9fee030a [2025-03-03 15:20:43,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:20:43,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:20:43,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:20:43,983 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:20:43,983 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:20:43,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:20:45,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda71c3e9/2af4625f47544e459840e9fefa1ac314/FLAGdb792dd1c [2025-03-03 15:20:45,427 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:20:45,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:20:45,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda71c3e9/2af4625f47544e459840e9fefa1ac314/FLAGdb792dd1c [2025-03-03 15:20:45,460 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda71c3e9/2af4625f47544e459840e9fefa1ac314 [2025-03-03 15:20:45,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:20:45,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:20:45,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:20:45,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:20:45,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:20:45,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:20:45" (1/1) ... [2025-03-03 15:20:45,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ea07ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:45, skipping insertion in model container [2025-03-03 15:20:45,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:20:45" (1/1) ... [2025-03-03 15:20:45,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:20:45,803 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26539,26552] [2025-03-03 15:20:45,826 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30716,30729] [2025-03-03 15:20:45,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:20:45,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:20:46,023 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[26539,26552] [2025-03-03 15:20:46,042 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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[30716,30729] [2025-03-03 15:20:46,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:20:46,107 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:20:46,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46 WrapperNode [2025-03-03 15:20:46,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:20:46,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:20:46,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:20:46,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:20:46,112 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:20:46" (1/1) ... [2025-03-03 15:20:46,133 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:20:46" (1/1) ... [2025-03-03 15:20:46,187 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2704 [2025-03-03 15:20:46,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:20:46,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:20:46,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:20:46,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:20:46,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,241 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:20:46,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,283 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:20:46,315 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:20:46,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:20:46,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:20:46,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (1/1) ... [2025-03-03 15:20:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:20:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:20:46,345 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:20:46,349 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:20:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:20:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:20:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:20:46,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:20:46,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:20:46,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~node4__newmax~3#1;havoc main_~node3__newmax~3#1;havoc main_~node2__newmax~3#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1902: havoc main_~node2__newmax~5#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2248: havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2052: havoc main_~check__tmp~5#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc main_~node4__newmax~5#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~node1__newmax~4#1;havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;havoc main_~node4__newmax~4#1;havoc main_~node3__newmax~4#1;havoc main_~node2__newmax~4#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2728: havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:48,110 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1944: havoc main_~node3__newmax~5#1; [2025-03-03 15:20:48,111 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1284: havoc main_~node1__newmax~3#1;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;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1;havoc main_~node4__newmax~2#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1;havoc main_~node3__newmax~2#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1;havoc main_~node2__newmax~2#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1;havoc main_~node1__newmax~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;havoc main_~node4__newmax~1#1;havoc main_~node3__newmax~1#1;havoc main_~node2__newmax~1#1;havoc main_~node1__newmax~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_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__newmax~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__newmax~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__newmax~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-03-03 15:20:48,111 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-03 15:20:48,262 INFO L? ?]: Removed 196 outVars from TransFormulas that were not future-live. [2025-03-03 15:20:48,262 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:20:48,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:20:48,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:20:48,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:20:48 BoogieIcfgContainer [2025-03-03 15:20:48,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:20:48,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:20:48,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:20:48,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:20:48,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:20:45" (1/3) ... [2025-03-03 15:20:48,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594037ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:20:48, skipping insertion in model container [2025-03-03 15:20:48,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:20:46" (2/3) ... [2025-03-03 15:20:48,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@594037ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:20:48, skipping insertion in model container [2025-03-03 15:20:48,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:20:48" (3/3) ... [2025-03-03 15:20:48,298 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-03-03 15:20:48,308 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:20:48,310 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 671 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-03 15:20:48,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:20:48,372 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;@35078ac1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:20:48,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-03 15:20:48,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 671 states, 668 states have (on average 1.7949101796407185) internal successors, (1199), 670 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 15:20:48,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:48,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:48,399 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:48,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:48,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1562932669, now seen corresponding path program 1 times [2025-03-03 15:20:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55840866] [2025-03-03 15:20:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 15:20:48,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 15:20:48,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:48,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:49,803 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:20:49,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55840866] [2025-03-03 15:20:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55840866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487443756] [2025-03-03 15:20:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:49,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:49,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:49,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:49,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:49,823 INFO L87 Difference]: Start difference. First operand has 671 states, 668 states have (on average 1.7949101796407185) internal successors, (1199), 670 states have internal predecessors, (1199), 0 states have call successors, (0), 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 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:50,079 INFO L93 Difference]: Finished difference Result 3255 states and 5826 transitions. [2025-03-03 15:20:50,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:20:50,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-03-03 15:20:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:50,105 INFO L225 Difference]: With dead ends: 3255 [2025-03-03 15:20:50,106 INFO L226 Difference]: Without dead ends: 2587 [2025-03-03 15:20:50,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:20:50,115 INFO L435 NwaCegarLoop]: 1781 mSDtfsCounter, 3820 mSDsluCounter, 2889 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3820 SdHoareTripleChecker+Valid, 4670 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:50,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3820 Valid, 4670 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2587 states. [2025-03-03 15:20:50,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2587 to 1272. [2025-03-03 15:20:50,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1270 states have (on average 1.5677165354330709) internal successors, (1991), 1271 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1991 transitions. [2025-03-03 15:20:50,230 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1991 transitions. Word has length 243 [2025-03-03 15:20:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 1272 states and 1991 transitions. [2025-03-03 15:20:50,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1991 transitions. [2025-03-03 15:20:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 15:20:50,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:50,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:50,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:20:50,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:50,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:50,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1428795553, now seen corresponding path program 1 times [2025-03-03 15:20:50,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:50,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181399197] [2025-03-03 15:20:50,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:50,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 15:20:50,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 15:20:50,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:50,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:50,462 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:20:50,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:50,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181399197] [2025-03-03 15:20:50,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181399197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:50,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:50,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:50,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189376220] [2025-03-03 15:20:50,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:50,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:50,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:50,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:50,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:50,467 INFO L87 Difference]: Start difference. First operand 1272 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:50,556 INFO L93 Difference]: Finished difference Result 3644 states and 5671 transitions. [2025-03-03 15:20:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:50,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2025-03-03 15:20:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:50,569 INFO L225 Difference]: With dead ends: 3644 [2025-03-03 15:20:50,569 INFO L226 Difference]: Without dead ends: 2497 [2025-03-03 15:20:50,573 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:20:50,574 INFO L435 NwaCegarLoop]: 2031 mSDtfsCounter, 909 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:50,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 3026 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2497 states. [2025-03-03 15:20:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2497 to 2463. [2025-03-03 15:20:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2463 states, 2461 states have (on average 1.559934985778139) internal successors, (3839), 2462 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 3839 transitions. [2025-03-03 15:20:50,638 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 3839 transitions. Word has length 245 [2025-03-03 15:20:50,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:50,639 INFO L471 AbstractCegarLoop]: Abstraction has 2463 states and 3839 transitions. [2025-03-03 15:20:50,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 3839 transitions. [2025-03-03 15:20:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 15:20:50,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:50,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:50,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:20:50,647 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 480377542, now seen corresponding path program 1 times [2025-03-03 15:20:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:50,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489632774] [2025-03-03 15:20:50,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:50,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 15:20:50,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 15:20:50,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:50,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:50,809 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:20:50,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:50,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489632774] [2025-03-03 15:20:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489632774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414082423] [2025-03-03 15:20:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:50,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:50,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:50,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:50,811 INFO L87 Difference]: Start difference. First operand 2463 states and 3839 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:50,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:50,894 INFO L93 Difference]: Finished difference Result 7322 states and 11401 transitions. [2025-03-03 15:20:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 245 [2025-03-03 15:20:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:50,912 INFO L225 Difference]: With dead ends: 7322 [2025-03-03 15:20:50,912 INFO L226 Difference]: Without dead ends: 4897 [2025-03-03 15:20:50,920 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:20:50,922 INFO L435 NwaCegarLoop]: 2076 mSDtfsCounter, 1035 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:50,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 3112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:50,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4897 states. [2025-03-03 15:20:50,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4897 to 2482. [2025-03-03 15:20:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2482 states, 2480 states have (on average 1.5592741935483871) internal successors, (3867), 2481 states have internal predecessors, (3867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3867 transitions. [2025-03-03 15:20:51,003 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3867 transitions. Word has length 245 [2025-03-03 15:20:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 2482 states and 3867 transitions. [2025-03-03 15:20:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3867 transitions. [2025-03-03 15:20:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 15:20:51,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:51,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:20:51,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:51,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1443512384, now seen corresponding path program 1 times [2025-03-03 15:20:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:51,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936017051] [2025-03-03 15:20:51,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:51,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:51,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 15:20:51,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 15:20:51,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:51,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:51,164 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:20:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936017051] [2025-03-03 15:20:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936017051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354436025] [2025-03-03 15:20:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:51,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:51,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:51,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:51,167 INFO L87 Difference]: Start difference. First operand 2482 states and 3867 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:51,255 INFO L93 Difference]: Finished difference Result 4926 states and 7667 transitions. [2025-03-03 15:20:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:51,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-03 15:20:51,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:51,265 INFO L225 Difference]: With dead ends: 4926 [2025-03-03 15:20:51,265 INFO L226 Difference]: Without dead ends: 2500 [2025-03-03 15:20:51,268 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:20:51,270 INFO L435 NwaCegarLoop]: 1059 mSDtfsCounter, 5 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:51,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2103 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-03-03 15:20:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2500. [2025-03-03 15:20:51,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 2498 states have (on average 1.5564451561249) internal successors, (3888), 2499 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3888 transitions. [2025-03-03 15:20:51,338 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3888 transitions. Word has length 246 [2025-03-03 15:20:51,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:51,339 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3888 transitions. [2025-03-03 15:20:51,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3888 transitions. [2025-03-03 15:20:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 15:20:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:51,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:20:51,344 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash 948038052, now seen corresponding path program 1 times [2025-03-03 15:20:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174273605] [2025-03-03 15:20:51,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:51,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 15:20:51,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 15:20:51,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:51,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:51,549 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:20:51,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174273605] [2025-03-03 15:20:51,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174273605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:51,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576393896] [2025-03-03 15:20:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:51,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:51,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:51,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:51,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:51,552 INFO L87 Difference]: Start difference. First operand 2500 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:51,654 INFO L93 Difference]: Finished difference Result 7072 states and 10935 transitions. [2025-03-03 15:20:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-03 15:20:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:51,672 INFO L225 Difference]: With dead ends: 7072 [2025-03-03 15:20:51,672 INFO L226 Difference]: Without dead ends: 4813 [2025-03-03 15:20:51,677 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:20:51,677 INFO L435 NwaCegarLoop]: 2038 mSDtfsCounter, 903 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:51,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 3033 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2025-03-03 15:20:51,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4781. [2025-03-03 15:20:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4781 states, 4779 states have (on average 1.5450931157145846) internal successors, (7384), 4780 states have internal predecessors, (7384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4781 states to 4781 states and 7384 transitions. [2025-03-03 15:20:51,768 INFO L78 Accepts]: Start accepts. Automaton has 4781 states and 7384 transitions. Word has length 247 [2025-03-03 15:20:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:51,769 INFO L471 AbstractCegarLoop]: Abstraction has 4781 states and 7384 transitions. [2025-03-03 15:20:51,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4781 states and 7384 transitions. [2025-03-03 15:20:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 15:20:51,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:51,780 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:20:51,780 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:51,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:51,781 INFO L85 PathProgramCache]: Analyzing trace with hash 548531622, now seen corresponding path program 1 times [2025-03-03 15:20:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:51,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820142932] [2025-03-03 15:20:51,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:51,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 15:20:51,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 15:20:51,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:51,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:52,366 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:20:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:52,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820142932] [2025-03-03 15:20:52,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820142932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:52,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:52,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492148363] [2025-03-03 15:20:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:52,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:52,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:52,368 INFO L87 Difference]: Start difference. First operand 4781 states and 7384 transitions. Second operand has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:52,561 INFO L93 Difference]: Finished difference Result 18204 states and 27992 transitions. [2025-03-03 15:20:52,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-03 15:20:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:52,614 INFO L225 Difference]: With dead ends: 18204 [2025-03-03 15:20:52,614 INFO L226 Difference]: Without dead ends: 13599 [2025-03-03 15:20:52,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:52,627 INFO L435 NwaCegarLoop]: 1898 mSDtfsCounter, 2327 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 3846 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:52,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 3846 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13599 states. [2025-03-03 15:20:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13599 to 9184. [2025-03-03 15:20:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9184 states, 9182 states have (on average 1.5311478980614246) internal successors, (14059), 9183 states have internal predecessors, (14059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9184 states to 9184 states and 14059 transitions. [2025-03-03 15:20:52,866 INFO L78 Accepts]: Start accepts. Automaton has 9184 states and 14059 transitions. Word has length 247 [2025-03-03 15:20:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:52,866 INFO L471 AbstractCegarLoop]: Abstraction has 9184 states and 14059 transitions. [2025-03-03 15:20:52,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:52,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9184 states and 14059 transitions. [2025-03-03 15:20:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 15:20:52,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:52,879 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:52,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:20:52,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:52,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1208473112, now seen corresponding path program 1 times [2025-03-03 15:20:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871105014] [2025-03-03 15:20:52,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:52,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 15:20:52,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 15:20:52,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:52,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:53,507 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:20:53,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:53,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871105014] [2025-03-03 15:20:53,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871105014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:53,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:53,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:53,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508743981] [2025-03-03 15:20:53,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:53,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:53,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:53,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:53,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:53,509 INFO L87 Difference]: Start difference. First operand 9184 states and 14059 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:53,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:53,642 INFO L93 Difference]: Finished difference Result 26577 states and 40501 transitions. [2025-03-03 15:20:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:20:53,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-03-03 15:20:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:53,678 INFO L225 Difference]: With dead ends: 26577 [2025-03-03 15:20:53,678 INFO L226 Difference]: Without dead ends: 18227 [2025-03-03 15:20:53,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:53,697 INFO L435 NwaCegarLoop]: 2065 mSDtfsCounter, 992 mSDsluCounter, 3101 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 5166 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:53,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 5166 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18227 states. [2025-03-03 15:20:53,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18227 to 10101. [2025-03-03 15:20:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10101 states, 10099 states have (on average 1.5471828893949897) internal successors, (15625), 10100 states have internal predecessors, (15625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10101 states to 10101 states and 15625 transitions. [2025-03-03 15:20:53,953 INFO L78 Accepts]: Start accepts. Automaton has 10101 states and 15625 transitions. Word has length 249 [2025-03-03 15:20:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:53,953 INFO L471 AbstractCegarLoop]: Abstraction has 10101 states and 15625 transitions. [2025-03-03 15:20:53,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10101 states and 15625 transitions. [2025-03-03 15:20:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 15:20:53,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:53,966 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:53,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:20:53,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:53,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 103263625, now seen corresponding path program 1 times [2025-03-03 15:20:53,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:53,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611543369] [2025-03-03 15:20:53,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:53,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 15:20:54,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 15:20:54,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:54,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:54,097 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:20:54,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:54,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611543369] [2025-03-03 15:20:54,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611543369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:54,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:54,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:54,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147274087] [2025-03-03 15:20:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:54,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:54,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:54,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:54,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:54,099 INFO L87 Difference]: Start difference. First operand 10101 states and 15625 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:54,293 INFO L93 Difference]: Finished difference Result 28405 states and 43654 transitions. [2025-03-03 15:20:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:54,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-03-03 15:20:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:54,328 INFO L225 Difference]: With dead ends: 28405 [2025-03-03 15:20:54,329 INFO L226 Difference]: Without dead ends: 19419 [2025-03-03 15:20:54,343 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:20:54,344 INFO L435 NwaCegarLoop]: 2024 mSDtfsCounter, 890 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 3019 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:54,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 3019 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:54,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2025-03-03 15:20:54,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19396. [2025-03-03 15:20:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19396 states, 19394 states have (on average 1.53372176961947) internal successors, (29745), 19395 states have internal predecessors, (29745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 29745 transitions. [2025-03-03 15:20:54,626 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 29745 transitions. Word has length 249 [2025-03-03 15:20:54,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:54,626 INFO L471 AbstractCegarLoop]: Abstraction has 19396 states and 29745 transitions. [2025-03-03 15:20:54,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 29745 transitions. [2025-03-03 15:20:54,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 15:20:54,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:20:54,650 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:54,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -695128308, now seen corresponding path program 1 times [2025-03-03 15:20:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:54,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684995905] [2025-03-03 15:20:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:54,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 15:20:54,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 15:20:54,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:54,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:20:54,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:54,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684995905] [2025-03-03 15:20:54,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684995905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:54,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:54,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425443582] [2025-03-03 15:20:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:54,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:54,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:54,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:54,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:54,797 INFO L87 Difference]: Start difference. First operand 19396 states and 29745 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:54,939 INFO L93 Difference]: Finished difference Result 38122 states and 58684 transitions. [2025-03-03 15:20:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-03-03 15:20:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:54,986 INFO L225 Difference]: With dead ends: 38122 [2025-03-03 15:20:54,986 INFO L226 Difference]: Without dead ends: 25758 [2025-03-03 15:20:55,009 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:20:55,009 INFO L435 NwaCegarLoop]: 1395 mSDtfsCounter, 536 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:55,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 2229 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:55,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25758 states. [2025-03-03 15:20:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25758 to 23052. [2025-03-03 15:20:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23052 states, 23050 states have (on average 1.5490238611713667) internal successors, (35705), 23051 states have internal predecessors, (35705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23052 states to 23052 states and 35705 transitions. [2025-03-03 15:20:55,442 INFO L78 Accepts]: Start accepts. Automaton has 23052 states and 35705 transitions. Word has length 249 [2025-03-03 15:20:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:55,442 INFO L471 AbstractCegarLoop]: Abstraction has 23052 states and 35705 transitions. [2025-03-03 15:20:55,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 23052 states and 35705 transitions. [2025-03-03 15:20:55,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 15:20:55,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:55,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:20:55,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:55,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:55,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1467079172, now seen corresponding path program 1 times [2025-03-03 15:20:55,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:55,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430257464] [2025-03-03 15:20:55,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:55,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:55,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-03 15:20:55,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 15:20:55,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:55,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:55,622 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:20:55,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:55,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430257464] [2025-03-03 15:20:55,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430257464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:55,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:55,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104628016] [2025-03-03 15:20:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:55,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:55,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:55,625 INFO L87 Difference]: Start difference. First operand 23052 states and 35705 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:55,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:55,833 INFO L93 Difference]: Finished difference Result 63458 states and 97297 transitions. [2025-03-03 15:20:55,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:55,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-03-03 15:20:55,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:55,917 INFO L225 Difference]: With dead ends: 63458 [2025-03-03 15:20:55,918 INFO L226 Difference]: Without dead ends: 43254 [2025-03-03 15:20:55,954 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:20:55,955 INFO L435 NwaCegarLoop]: 2011 mSDtfsCounter, 921 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 921 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:55,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [921 Valid, 3003 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:20:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43254 states. [2025-03-03 15:20:56,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43254 to 43228. [2025-03-03 15:20:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43228 states, 43226 states have (on average 1.5290103178642485) internal successors, (66093), 43227 states have internal predecessors, (66093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43228 states to 43228 states and 66093 transitions. [2025-03-03 15:20:56,577 INFO L78 Accepts]: Start accepts. Automaton has 43228 states and 66093 transitions. Word has length 251 [2025-03-03 15:20:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 43228 states and 66093 transitions. [2025-03-03 15:20:56,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 43228 states and 66093 transitions. [2025-03-03 15:20:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 15:20:56,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:56,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:20:56,617 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:56,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 646468705, now seen corresponding path program 1 times [2025-03-03 15:20:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352173074] [2025-03-03 15:20:56,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:56,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-03 15:20:56,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 15:20:56,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:56,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:56,714 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:20:56,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:56,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352173074] [2025-03-03 15:20:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352173074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:56,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837223835] [2025-03-03 15:20:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:56,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:56,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:56,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:56,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:56,716 INFO L87 Difference]: Start difference. First operand 43228 states and 66093 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:57,130 INFO L93 Difference]: Finished difference Result 121692 states and 184701 transitions. [2025-03-03 15:20:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-03-03 15:20:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:57,288 INFO L225 Difference]: With dead ends: 121692 [2025-03-03 15:20:57,289 INFO L226 Difference]: Without dead ends: 82432 [2025-03-03 15:20:57,329 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:20:57,330 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 893 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:57,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 2084 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82432 states. [2025-03-03 15:20:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82432 to 44036. [2025-03-03 15:20:58,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44036 states, 44034 states have (on average 1.5249352772857339) internal successors, (67149), 44035 states have internal predecessors, (67149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44036 states to 44036 states and 67149 transitions. [2025-03-03 15:20:58,141 INFO L78 Accepts]: Start accepts. Automaton has 44036 states and 67149 transitions. Word has length 251 [2025-03-03 15:20:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:58,141 INFO L471 AbstractCegarLoop]: Abstraction has 44036 states and 67149 transitions. [2025-03-03 15:20:58,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 44036 states and 67149 transitions. [2025-03-03 15:20:58,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 15:20:58,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:58,180 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:58,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:20:58,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:58,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash -51341221, now seen corresponding path program 1 times [2025-03-03 15:20:58,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:58,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555797109] [2025-03-03 15:20:58,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:58,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:58,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 15:20:58,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 15:20:58,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:58,335 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:20:58,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:58,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555797109] [2025-03-03 15:20:58,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555797109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:58,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:58,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:20:58,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11114974] [2025-03-03 15:20:58,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:58,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:20:58,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:58,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:20:58,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:20:58,338 INFO L87 Difference]: Start difference. First operand 44036 states and 67149 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:58,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:20:58,579 INFO L93 Difference]: Finished difference Result 84504 states and 128351 transitions. [2025-03-03 15:20:58,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:20:58,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-03 15:20:58,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:20:58,641 INFO L225 Difference]: With dead ends: 84504 [2025-03-03 15:20:58,641 INFO L226 Difference]: Without dead ends: 45136 [2025-03-03 15:20:58,675 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:20:58,676 INFO L435 NwaCegarLoop]: 1056 mSDtfsCounter, 7 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:20:58,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2096 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:20:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45136 states. [2025-03-03 15:20:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45136 to 45136. [2025-03-03 15:20:59,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45136 states, 45134 states have (on average 1.5171046217928834) internal successors, (68473), 45135 states have internal predecessors, (68473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45136 states to 45136 states and 68473 transitions. [2025-03-03 15:20:59,371 INFO L78 Accepts]: Start accepts. Automaton has 45136 states and 68473 transitions. Word has length 252 [2025-03-03 15:20:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:20:59,371 INFO L471 AbstractCegarLoop]: Abstraction has 45136 states and 68473 transitions. [2025-03-03 15:20:59,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:20:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45136 states and 68473 transitions. [2025-03-03 15:20:59,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-03 15:20:59,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:20:59,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:20:59,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:20:59,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:20:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1059758271, now seen corresponding path program 1 times [2025-03-03 15:20:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:20:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569454146] [2025-03-03 15:20:59,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:20:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:20:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-03 15:20:59,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-03 15:20:59,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:20:59,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:20:59,981 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:20:59,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:20:59,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569454146] [2025-03-03 15:20:59,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569454146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:20:59,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:20:59,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:20:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824005244] [2025-03-03 15:20:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:20:59,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:20:59,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:20:59,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:20:59,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:20:59,983 INFO L87 Difference]: Start difference. First operand 45136 states and 68473 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:00,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:00,230 INFO L93 Difference]: Finished difference Result 126216 states and 190807 transitions. [2025-03-03 15:21:00,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:00,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-03-03 15:21:00,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:00,342 INFO L225 Difference]: With dead ends: 126216 [2025-03-03 15:21:00,342 INFO L226 Difference]: Without dead ends: 86208 [2025-03-03 15:21:00,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:00,394 INFO L435 NwaCegarLoop]: 2069 mSDtfsCounter, 997 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 5171 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:00,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 5171 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86208 states. [2025-03-03 15:21:01,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86208 to 47812. [2025-03-03 15:21:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47812 states, 47810 states have (on average 1.5125496758000418) internal successors, (72315), 47811 states have internal predecessors, (72315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47812 states to 47812 states and 72315 transitions. [2025-03-03 15:21:01,308 INFO L78 Accepts]: Start accepts. Automaton has 47812 states and 72315 transitions. Word has length 253 [2025-03-03 15:21:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:01,309 INFO L471 AbstractCegarLoop]: Abstraction has 47812 states and 72315 transitions. [2025-03-03 15:21:01,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 47812 states and 72315 transitions. [2025-03-03 15:21:01,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 15:21:01,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:01,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:01,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:21:01,351 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:01,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1569745357, now seen corresponding path program 1 times [2025-03-03 15:21:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:01,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189130626] [2025-03-03 15:21:01,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:01,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:21:01,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:21:01,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:01,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:02,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:21:02,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:02,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189130626] [2025-03-03 15:21:02,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189130626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:02,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:02,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42640229] [2025-03-03 15:21:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:02,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:02,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:02,027 INFO L87 Difference]: Start difference. First operand 47812 states and 72315 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:02,182 INFO L93 Difference]: Finished difference Result 86208 states and 130233 transitions. [2025-03-03 15:21:02,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:02,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-03-03 15:21:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:02,237 INFO L225 Difference]: With dead ends: 86208 [2025-03-03 15:21:02,237 INFO L226 Difference]: Without dead ends: 47300 [2025-03-03 15:21:02,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:02,275 INFO L435 NwaCegarLoop]: 1163 mSDtfsCounter, 81 mSDsluCounter, 2201 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 3364 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:02,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 3364 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:02,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47300 states. [2025-03-03 15:21:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47300 to 46964. [2025-03-03 15:21:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46964 states, 46962 states have (on average 1.5113496018057153) internal successors, (70976), 46963 states have internal predecessors, (70976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46964 states to 46964 states and 70976 transitions. [2025-03-03 15:21:02,975 INFO L78 Accepts]: Start accepts. Automaton has 46964 states and 70976 transitions. Word has length 255 [2025-03-03 15:21:02,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:02,975 INFO L471 AbstractCegarLoop]: Abstraction has 46964 states and 70976 transitions. [2025-03-03 15:21:02,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:02,976 INFO L276 IsEmpty]: Start isEmpty. Operand 46964 states and 70976 transitions. [2025-03-03 15:21:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 15:21:03,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:03,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:21:03,016 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:03,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 646935334, now seen corresponding path program 1 times [2025-03-03 15:21:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:03,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753404635] [2025-03-03 15:21:03,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:03,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:03,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 15:21:03,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 15:21:03,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:03,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:03,543 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:21:03,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:03,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753404635] [2025-03-03 15:21:03,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753404635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:03,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:03,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:03,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036968898] [2025-03-03 15:21:03,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:03,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:03,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:03,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:03,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:03,545 INFO L87 Difference]: Start difference. First operand 46964 states and 70976 transitions. Second operand has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:03,799 INFO L93 Difference]: Finished difference Result 80691 states and 121522 transitions. [2025-03-03 15:21:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:03,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-03-03 15:21:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:03,849 INFO L225 Difference]: With dead ends: 80691 [2025-03-03 15:21:03,849 INFO L226 Difference]: Without dead ends: 40060 [2025-03-03 15:21:03,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:03,870 INFO L435 NwaCegarLoop]: 1179 mSDtfsCounter, 94 mSDsluCounter, 2215 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 3394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:03,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 3394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2025-03-03 15:21:04,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 39515. [2025-03-03 15:21:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39515 states, 39513 states have (on average 1.5126667172829196) internal successors, (59770), 39514 states have internal predecessors, (59770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39515 states to 39515 states and 59770 transitions. [2025-03-03 15:21:04,259 INFO L78 Accepts]: Start accepts. Automaton has 39515 states and 59770 transitions. Word has length 255 [2025-03-03 15:21:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:04,260 INFO L471 AbstractCegarLoop]: Abstraction has 39515 states and 59770 transitions. [2025-03-03 15:21:04,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:04,260 INFO L276 IsEmpty]: Start isEmpty. Operand 39515 states and 59770 transitions. [2025-03-03 15:21:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 15:21:04,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:04,286 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:04,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:21:04,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:04,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:04,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1082253733, now seen corresponding path program 1 times [2025-03-03 15:21:04,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:04,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57171553] [2025-03-03 15:21:04,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:04,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:04,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 15:21:04,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 15:21:04,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:04,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:04,382 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:21:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57171553] [2025-03-03 15:21:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57171553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:04,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900702404] [2025-03-03 15:21:04,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:04,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:04,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:04,384 INFO L87 Difference]: Start difference. First operand 39515 states and 59770 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:04,692 INFO L93 Difference]: Finished difference Result 79287 states and 121839 transitions. [2025-03-03 15:21:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-03 15:21:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:04,754 INFO L225 Difference]: With dead ends: 79287 [2025-03-03 15:21:04,754 INFO L226 Difference]: Without dead ends: 54400 [2025-03-03 15:21:04,784 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:21:04,785 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 540 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:04,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 2184 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:04,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54400 states. [2025-03-03 15:21:05,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54400 to 50581. [2025-03-03 15:21:05,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50581 states, 50579 states have (on average 1.537515569702841) internal successors, (77766), 50580 states have internal predecessors, (77766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50581 states to 50581 states and 77766 transitions. [2025-03-03 15:21:05,463 INFO L78 Accepts]: Start accepts. Automaton has 50581 states and 77766 transitions. Word has length 256 [2025-03-03 15:21:05,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:05,463 INFO L471 AbstractCegarLoop]: Abstraction has 50581 states and 77766 transitions. [2025-03-03 15:21:05,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50581 states and 77766 transitions. [2025-03-03 15:21:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 15:21:05,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:05,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:05,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:21:05,495 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:05,496 INFO L85 PathProgramCache]: Analyzing trace with hash -327475334, now seen corresponding path program 1 times [2025-03-03 15:21:05,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:05,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002991711] [2025-03-03 15:21:05,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:05,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 15:21:05,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 15:21:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:05,610 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:21:05,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:05,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002991711] [2025-03-03 15:21:05,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002991711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508672218] [2025-03-03 15:21:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:05,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:05,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:05,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:05,612 INFO L87 Difference]: Start difference. First operand 50581 states and 77766 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:05,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:05,975 INFO L93 Difference]: Finished difference Result 112670 states and 176316 transitions. [2025-03-03 15:21:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:05,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-03 15:21:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:06,081 INFO L225 Difference]: With dead ends: 112670 [2025-03-03 15:21:06,081 INFO L226 Difference]: Without dead ends: 75718 [2025-03-03 15:21:06,131 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:21:06,131 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 531 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:06,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 2198 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75718 states. [2025-03-03 15:21:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75718 to 70496. [2025-03-03 15:21:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70496 states, 70494 states have (on average 1.5643175305699777) internal successors, (110275), 70495 states have internal predecessors, (110275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:07,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70496 states to 70496 states and 110275 transitions. [2025-03-03 15:21:07,069 INFO L78 Accepts]: Start accepts. Automaton has 70496 states and 110275 transitions. Word has length 256 [2025-03-03 15:21:07,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:07,069 INFO L471 AbstractCegarLoop]: Abstraction has 70496 states and 110275 transitions. [2025-03-03 15:21:07,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 70496 states and 110275 transitions. [2025-03-03 15:21:07,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 15:21:07,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:07,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:07,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:21:07,098 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:07,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1942757377, now seen corresponding path program 1 times [2025-03-03 15:21:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680267866] [2025-03-03 15:21:07,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:07,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 15:21:07,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 15:21:07,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:07,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:07,197 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:21:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:07,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680267866] [2025-03-03 15:21:07,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680267866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:07,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:07,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:07,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272247032] [2025-03-03 15:21:07,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:07,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:07,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:07,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:07,199 INFO L87 Difference]: Start difference. First operand 70496 states and 110275 transitions. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:07,658 INFO L93 Difference]: Finished difference Result 166896 states and 265773 transitions. [2025-03-03 15:21:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-03-03 15:21:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:08,101 INFO L225 Difference]: With dead ends: 166896 [2025-03-03 15:21:08,102 INFO L226 Difference]: Without dead ends: 112042 [2025-03-03 15:21:08,145 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:21:08,145 INFO L435 NwaCegarLoop]: 1374 mSDtfsCounter, 544 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:08,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 2161 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:21:08,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112042 states. [2025-03-03 15:21:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112042 to 106196. [2025-03-03 15:21:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106196 states, 106194 states have (on average 1.5793076821666008) internal successors, (167713), 106195 states have internal predecessors, (167713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106196 states to 106196 states and 167713 transitions. [2025-03-03 15:21:09,640 INFO L78 Accepts]: Start accepts. Automaton has 106196 states and 167713 transitions. Word has length 257 [2025-03-03 15:21:09,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:09,641 INFO L471 AbstractCegarLoop]: Abstraction has 106196 states and 167713 transitions. [2025-03-03 15:21:09,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 106196 states and 167713 transitions. [2025-03-03 15:21:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 15:21:09,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:09,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:21:09,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:09,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:09,668 INFO L85 PathProgramCache]: Analyzing trace with hash -271934794, now seen corresponding path program 1 times [2025-03-03 15:21:09,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:09,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329795237] [2025-03-03 15:21:09,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:09,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:09,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 15:21:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 15:21:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:10,179 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:21:10,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329795237] [2025-03-03 15:21:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329795237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:21:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193866827] [2025-03-03 15:21:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:10,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 15:21:10,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:10,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 15:21:10,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 15:21:10,182 INFO L87 Difference]: Start difference. First operand 106196 states and 167713 transitions. Second operand has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:12,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:12,079 INFO L93 Difference]: Finished difference Result 365453 states and 579204 transitions. [2025-03-03 15:21:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:21:12,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-03-03 15:21:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:12,527 INFO L225 Difference]: With dead ends: 365453 [2025-03-03 15:21:12,527 INFO L226 Difference]: Without dead ends: 273777 [2025-03-03 15:21:12,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2025-03-03 15:21:12,642 INFO L435 NwaCegarLoop]: 1057 mSDtfsCounter, 11046 mSDsluCounter, 2664 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11046 SdHoareTripleChecker+Valid, 3721 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:12,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11046 Valid, 3721 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 15:21:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273777 states. [2025-03-03 15:21:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273777 to 148358. [2025-03-03 15:21:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148358 states, 148356 states have (on average 1.5632060718811507) internal successors, (231911), 148357 states have internal predecessors, (231911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:15,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148358 states to 148358 states and 231911 transitions. [2025-03-03 15:21:15,419 INFO L78 Accepts]: Start accepts. Automaton has 148358 states and 231911 transitions. Word has length 257 [2025-03-03 15:21:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:15,419 INFO L471 AbstractCegarLoop]: Abstraction has 148358 states and 231911 transitions. [2025-03-03 15:21:15,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.125) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 148358 states and 231911 transitions. [2025-03-03 15:21:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 15:21:15,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:15,446 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:15,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:21:15,447 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:15,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:15,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1089583244, now seen corresponding path program 1 times [2025-03-03 15:21:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705843535] [2025-03-03 15:21:15,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:15,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 15:21:15,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 15:21:15,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:15,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:16,150 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:21:16,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:16,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705843535] [2025-03-03 15:21:16,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705843535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:16,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:16,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:21:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216835112] [2025-03-03 15:21:16,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:16,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:21:16,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:16,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:21:16,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:16,155 INFO L87 Difference]: Start difference. First operand 148358 states and 231911 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:17,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:17,693 INFO L93 Difference]: Finished difference Result 427648 states and 668162 transitions. [2025-03-03 15:21:17,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:21:17,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 257 [2025-03-03 15:21:17,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:18,143 INFO L225 Difference]: With dead ends: 427648 [2025-03-03 15:21:18,143 INFO L226 Difference]: Without dead ends: 280203 [2025-03-03 15:21:18,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:21:18,263 INFO L435 NwaCegarLoop]: 1657 mSDtfsCounter, 906 mSDsluCounter, 1908 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:18,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 3565 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:18,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280203 states. [2025-03-03 15:21:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280203 to 280185. [2025-03-03 15:21:21,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280185 states, 280183 states have (on average 1.5548409432406678) internal successors, (435640), 280184 states have internal predecessors, (435640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280185 states to 280185 states and 435640 transitions. [2025-03-03 15:21:22,138 INFO L78 Accepts]: Start accepts. Automaton has 280185 states and 435640 transitions. Word has length 257 [2025-03-03 15:21:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:21:22,139 INFO L471 AbstractCegarLoop]: Abstraction has 280185 states and 435640 transitions. [2025-03-03 15:21:22,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 280185 states and 435640 transitions. [2025-03-03 15:21:22,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 15:21:22,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:21:22,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:22,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:21:22,222 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:21:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:21:22,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1771398037, now seen corresponding path program 1 times [2025-03-03 15:21:22,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:21:22,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76426908] [2025-03-03 15:21:22,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:21:22,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:21:22,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 15:21:22,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 15:21:22,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:21:22,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:21:22,361 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:21:22,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:21:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76426908] [2025-03-03 15:21:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76426908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:21:22,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:21:22,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:21:22,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109889206] [2025-03-03 15:21:22,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:21:22,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:21:22,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:21:22,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:21:22,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:21:22,363 INFO L87 Difference]: Start difference. First operand 280185 states and 435640 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:21:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:21:25,165 INFO L93 Difference]: Finished difference Result 819360 states and 1273556 transitions. [2025-03-03 15:21:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:21:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-03 15:21:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:21:26,124 INFO L225 Difference]: With dead ends: 819360 [2025-03-03 15:21:26,125 INFO L226 Difference]: Without dead ends: 545986 [2025-03-03 15:21:26,354 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:21:26,356 INFO L435 NwaCegarLoop]: 1962 mSDtfsCounter, 862 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:21:26,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 2933 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:21:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545986 states.