./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 30f0768bbff34913c5dfb0ad37a2819c04e85c489714efe7283dacc3cb1675b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:43:51,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:43:51,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:43:51,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:43:51,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:43:51,799 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:43:51,800 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:43:51,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:43:51,801 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:43:51,801 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:43:51,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:43:51,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:43:51,803 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:43:51,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:43:51,803 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:43:51,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:43:51,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:43:51,805 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:43:51,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:51,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:43:51,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:43:51,806 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:43:51,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:43:51,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:43:51,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:43:51,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:43:51,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:43:51,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:43:51,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:43:51,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 30f0768bbff34913c5dfb0ad37a2819c04e85c489714efe7283dacc3cb1675b9 [2025-02-05 16:43:52,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:43:52,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:43:52,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:43:52,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:43:52,110 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:43:52,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:43:53,413 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb978352/e92722bae8444dcdb127583b59e237f4/FLAG495a9bcf3 [2025-02-05 16:43:53,729 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:43:53,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:43:53,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb978352/e92722bae8444dcdb127583b59e237f4/FLAG495a9bcf3 [2025-02-05 16:43:53,983 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcb978352/e92722bae8444dcdb127583b59e237f4 [2025-02-05 16:43:53,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:43:53,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:43:53,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:53,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:43:53,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:43:53,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:53" (1/1) ... [2025-02-05 16:43:53,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ec94e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:53, skipping insertion in model container [2025-02-05 16:43:53,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:43:53" (1/1) ... [2025-02-05 16:43:54,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:43:54,230 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9094,9107] [2025-02-05 16:43:54,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:54,292 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:43:54,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9094,9107] [2025-02-05 16:43:54,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:43:54,424 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:43:54,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54 WrapperNode [2025-02-05 16:43:54,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:43:54,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:54,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:43:54,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:43:54,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,476 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 796 [2025-02-05 16:43:54,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:43:54,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:43:54,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:43:54,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:43:54,484 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,505 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:43:54,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,517 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:43:54,531 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:43:54,531 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:43:54,531 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:43:54,534 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (1/1) ... [2025-02-05 16:43:54,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:43:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:43:54,567 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 16:43:54,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 16:43:54,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:43:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:43:54,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:43:54,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:43:54,716 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:43:54,718 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:43:55,475 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L653: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node5__m5~2#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L492: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node6__m6~1#1;havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node6____CPAchecker_TMP_0~0#1;havoc main_~node6__m6~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1;havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L839: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L608: havoc main_~node6____CPAchecker_TMP_0~1#1;havoc main_~node6__m6~2#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L542: havoc main_~node4__m4~2#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc main_~node3__m3~2#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L743: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:43:55,476 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L512: havoc main_~node2__m2~2#1; [2025-02-05 16:43:55,533 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-05 16:43:55,533 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:43:55,554 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:43:55,554 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:43:55,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:55 BoogieIcfgContainer [2025-02-05 16:43:55,556 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:43:55,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:43:55,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:43:55,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:43:55,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:43:53" (1/3) ... [2025-02-05 16:43:55,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a18ed1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:55, skipping insertion in model container [2025-02-05 16:43:55,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:43:54" (2/3) ... [2025-02-05 16:43:55,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a18ed1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:43:55, skipping insertion in model container [2025-02-05 16:43:55,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:43:55" (3/3) ... [2025-02-05 16:43:55,568 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-02-05 16:43:55,584 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:43:55,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 177 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:43:55,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:43:55,675 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;@1da0bbee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:43:55,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:43:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 175 states have (on average 1.76) internal successors, (308), 176 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:55,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 16:43:55,691 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:55,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:55,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:55,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1300910800, now seen corresponding path program 1 times [2025-02-05 16:43:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:55,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380782293] [2025-02-05 16:43:55,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:55,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:55,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 16:43:55,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 16:43:55,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:56,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:56,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380782293] [2025-02-05 16:43:56,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380782293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:56,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:56,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:56,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525552936] [2025-02-05 16:43:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:56,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:56,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:56,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:56,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:56,528 INFO L87 Difference]: Start difference. First operand has 177 states, 175 states have (on average 1.76) internal successors, (308), 176 states have internal predecessors, (308), 0 states have call successors, (0), 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 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:57,175 INFO L93 Difference]: Finished difference Result 1131 states and 1831 transitions. [2025-02-05 16:43:57,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:43:57,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-02-05 16:43:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:57,199 INFO L225 Difference]: With dead ends: 1131 [2025-02-05 16:43:57,201 INFO L226 Difference]: Without dead ends: 1036 [2025-02-05 16:43:57,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-02-05 16:43:57,209 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 1888 mSDsluCounter, 4478 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 5299 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:57,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 5299 Invalid, 396 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:43:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2025-02-05 16:43:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 269. [2025-02-05 16:43:57,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 1.458955223880597) internal successors, (391), 268 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 391 transitions. [2025-02-05 16:43:57,286 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 391 transitions. Word has length 90 [2025-02-05 16:43:57,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:57,287 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 391 transitions. [2025-02-05 16:43:57,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,287 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 391 transitions. [2025-02-05 16:43:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:43:57,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:57,293 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:57,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:43:57,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:57,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:57,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1508718444, now seen corresponding path program 1 times [2025-02-05 16:43:57,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:57,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039643815] [2025-02-05 16:43:57,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:57,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:43:57,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:43:57,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:57,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039643815] [2025-02-05 16:43:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039643815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813570943] [2025-02-05 16:43:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:57,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:57,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:57,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:57,652 INFO L87 Difference]: Start difference. First operand 269 states and 391 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:57,988 INFO L93 Difference]: Finished difference Result 1235 states and 1925 transitions. [2025-02-05 16:43:57,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:57,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:43:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:57,996 INFO L225 Difference]: With dead ends: 1235 [2025-02-05 16:43:57,996 INFO L226 Difference]: Without dead ends: 1095 [2025-02-05 16:43:57,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:57,998 INFO L435 NwaCegarLoop]: 789 mSDtfsCounter, 1339 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 3310 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:57,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 3310 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:58,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-02-05 16:43:58,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 428. [2025-02-05 16:43:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.5105386416861826) internal successors, (645), 427 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 645 transitions. [2025-02-05 16:43:58,024 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 645 transitions. Word has length 92 [2025-02-05 16:43:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 645 transitions. [2025-02-05 16:43:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 645 transitions. [2025-02-05 16:43:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:43:58,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:58,026 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:58,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:43:58,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:58,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2066169996, now seen corresponding path program 1 times [2025-02-05 16:43:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225283204] [2025-02-05 16:43:58,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:58,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:58,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:43:58,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:43:58,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:58,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225283204] [2025-02-05 16:43:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225283204] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:58,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:58,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:58,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736451269] [2025-02-05 16:43:58,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:58,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:58,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:58,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:58,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:58,345 INFO L87 Difference]: Start difference. First operand 428 states and 645 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:58,629 INFO L93 Difference]: Finished difference Result 1394 states and 2179 transitions. [2025-02-05 16:43:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:43:58,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:58,636 INFO L225 Difference]: With dead ends: 1394 [2025-02-05 16:43:58,636 INFO L226 Difference]: Without dead ends: 1254 [2025-02-05 16:43:58,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:58,638 INFO L435 NwaCegarLoop]: 679 mSDtfsCounter, 1334 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:58,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 2441 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:43:58,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2025-02-05 16:43:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 656. [2025-02-05 16:43:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 656 states, 655 states have (on average 1.5404580152671756) internal successors, (1009), 655 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 1009 transitions. [2025-02-05 16:43:58,678 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 1009 transitions. Word has length 92 [2025-02-05 16:43:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:58,678 INFO L471 AbstractCegarLoop]: Abstraction has 656 states and 1009 transitions. [2025-02-05 16:43:58,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 1009 transitions. [2025-02-05 16:43:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:43:58,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:58,685 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:58,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:43:58,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:58,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1389267860, now seen corresponding path program 1 times [2025-02-05 16:43:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707967619] [2025-02-05 16:43:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:58,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:43:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:43:58,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:58,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:58,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:58,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707967619] [2025-02-05 16:43:58,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707967619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:58,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:58,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534655189] [2025-02-05 16:43:58,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:58,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:58,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:58,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:58,966 INFO L87 Difference]: Start difference. First operand 656 states and 1009 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:59,230 INFO L93 Difference]: Finished difference Result 1548 states and 2425 transitions. [2025-02-05 16:43:59,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:59,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:43:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:59,237 INFO L225 Difference]: With dead ends: 1548 [2025-02-05 16:43:59,238 INFO L226 Difference]: Without dead ends: 1408 [2025-02-05 16:43:59,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:59,241 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 1440 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:59,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 2165 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-02-05 16:43:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 810. [2025-02-05 16:43:59,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 809 states have (on average 1.5512978986402968) internal successors, (1255), 809 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1255 transitions. [2025-02-05 16:43:59,276 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1255 transitions. Word has length 92 [2025-02-05 16:43:59,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:59,276 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1255 transitions. [2025-02-05 16:43:59,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,277 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1255 transitions. [2025-02-05 16:43:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:43:59,281 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:59,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:59,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:43:59,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:59,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:59,282 INFO L85 PathProgramCache]: Analyzing trace with hash -826647156, now seen corresponding path program 1 times [2025-02-05 16:43:59,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:59,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599159408] [2025-02-05 16:43:59,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:59,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:59,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:43:59,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:43:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:59,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:43:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:43:59,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:43:59,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599159408] [2025-02-05 16:43:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599159408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:43:59,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:43:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:43:59,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493884283] [2025-02-05 16:43:59,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:43:59,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:43:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:43:59,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:43:59,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:43:59,525 INFO L87 Difference]: Start difference. First operand 810 states and 1255 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:43:59,738 INFO L93 Difference]: Finished difference Result 1697 states and 2663 transitions. [2025-02-05 16:43:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:43:59,739 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:43:59,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:43:59,746 INFO L225 Difference]: With dead ends: 1697 [2025-02-05 16:43:59,747 INFO L226 Difference]: Without dead ends: 1557 [2025-02-05 16:43:59,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:43:59,749 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 1545 mSDsluCounter, 1619 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:43:59,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 2078 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:43:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-02-05 16:43:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 959. [2025-02-05 16:43:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.558455114822547) internal successors, (1493), 958 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1493 transitions. [2025-02-05 16:43:59,782 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1493 transitions. Word has length 92 [2025-02-05 16:43:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:43:59,783 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1493 transitions. [2025-02-05 16:43:59,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:43:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1493 transitions. [2025-02-05 16:43:59,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:43:59,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:43:59,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:43:59,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:43:59,785 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:43:59,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:43:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash 475565716, now seen corresponding path program 1 times [2025-02-05 16:43:59,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:43:59,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221821128] [2025-02-05 16:43:59,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:43:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:43:59,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:43:59,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:43:59,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:43:59,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221821128] [2025-02-05 16:44:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221821128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:00,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220128066] [2025-02-05 16:44:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:44:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:44:00,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:44:00,037 INFO L87 Difference]: Start difference. First operand 959 states and 1493 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:00,256 INFO L93 Difference]: Finished difference Result 1841 states and 2893 transitions. [2025-02-05 16:44:00,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:44:00,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:44:00,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:00,264 INFO L225 Difference]: With dead ends: 1841 [2025-02-05 16:44:00,264 INFO L226 Difference]: Without dead ends: 1701 [2025-02-05 16:44:00,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:00,267 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 1949 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 2177 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:00,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 2177 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-02-05 16:44:00,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1103. [2025-02-05 16:44:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 1.5635208711433757) internal successors, (1723), 1102 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1723 transitions. [2025-02-05 16:44:00,300 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1723 transitions. Word has length 92 [2025-02-05 16:44:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:00,300 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1723 transitions. [2025-02-05 16:44:00,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1723 transitions. [2025-02-05 16:44:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:00,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:00,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:00,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:44:00,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash -300765287, now seen corresponding path program 1 times [2025-02-05 16:44:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879564107] [2025-02-05 16:44:00,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:00,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:00,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:00,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:00,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879564107] [2025-02-05 16:44:00,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879564107] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:00,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867759978] [2025-02-05 16:44:00,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:00,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:00,419 INFO L87 Difference]: Start difference. First operand 1103 states and 1723 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:00,460 INFO L93 Difference]: Finished difference Result 2817 states and 4451 transitions. [2025-02-05 16:44:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:44:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:00,467 INFO L225 Difference]: With dead ends: 2817 [2025-02-05 16:44:00,468 INFO L226 Difference]: Without dead ends: 1918 [2025-02-05 16:44:00,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:00,470 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 99 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:00,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 559 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1918 states. [2025-02-05 16:44:00,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1918 to 1890. [2025-02-05 16:44:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 1.560084700899947) internal successors, (2947), 1889 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2947 transitions. [2025-02-05 16:44:00,518 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2947 transitions. Word has length 92 [2025-02-05 16:44:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:00,518 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2947 transitions. [2025-02-05 16:44:00,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2947 transitions. [2025-02-05 16:44:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:00,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:00,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:00,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:44:00,521 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:00,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:00,521 INFO L85 PathProgramCache]: Analyzing trace with hash -299603438, now seen corresponding path program 1 times [2025-02-05 16:44:00,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:00,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266379606] [2025-02-05 16:44:00,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:00,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:00,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:00,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:00,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:00,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266379606] [2025-02-05 16:44:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266379606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997988448] [2025-02-05 16:44:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:00,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:00,604 INFO L87 Difference]: Start difference. First operand 1890 states and 2947 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:00,669 INFO L93 Difference]: Finished difference Result 3578 states and 5610 transitions. [2025-02-05 16:44:00,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:00,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:44:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:00,676 INFO L225 Difference]: With dead ends: 3578 [2025-02-05 16:44:00,677 INFO L226 Difference]: Without dead ends: 1892 [2025-02-05 16:44:00,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:00,679 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 125 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:00,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 541 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:00,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2025-02-05 16:44:00,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1890. [2025-02-05 16:44:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 1.5563790365272632) internal successors, (2940), 1889 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2940 transitions. [2025-02-05 16:44:00,730 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2940 transitions. Word has length 92 [2025-02-05 16:44:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:00,731 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2940 transitions. [2025-02-05 16:44:00,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:00,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2940 transitions. [2025-02-05 16:44:00,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:44:00,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:00,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:00,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:44:00,736 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:00,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:00,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1574487412, now seen corresponding path program 1 times [2025-02-05 16:44:00,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:00,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612112871] [2025-02-05 16:44:00,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:00,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:00,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:44:00,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:44:00,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:00,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:00,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:00,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612112871] [2025-02-05 16:44:00,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612112871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854345416] [2025-02-05 16:44:00,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:00,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:44:00,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:00,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:44:00,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:44:00,962 INFO L87 Difference]: Start difference. First operand 1890 states and 2940 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:01,202 INFO L93 Difference]: Finished difference Result 3493 states and 5460 transitions. [2025-02-05 16:44:01,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:44:01,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-02-05 16:44:01,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:01,216 INFO L225 Difference]: With dead ends: 3493 [2025-02-05 16:44:01,216 INFO L226 Difference]: Without dead ends: 3232 [2025-02-05 16:44:01,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:01,219 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 1643 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:01,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 2580 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3232 states. [2025-02-05 16:44:01,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 2150. [2025-02-05 16:44:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2150 states, 2149 states have (on average 1.5583992554676593) internal successors, (3349), 2149 states have internal predecessors, (3349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2150 states to 2150 states and 3349 transitions. [2025-02-05 16:44:01,297 INFO L78 Accepts]: Start accepts. Automaton has 2150 states and 3349 transitions. Word has length 92 [2025-02-05 16:44:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:01,297 INFO L471 AbstractCegarLoop]: Abstraction has 2150 states and 3349 transitions. [2025-02-05 16:44:01,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2150 states and 3349 transitions. [2025-02-05 16:44:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:44:01,300 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:01,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:01,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:44:01,300 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:01,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -729016098, now seen corresponding path program 1 times [2025-02-05 16:44:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102889565] [2025-02-05 16:44:01,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:01,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:44:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:44:01,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:01,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:01,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:01,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102889565] [2025-02-05 16:44:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102889565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:01,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420053252] [2025-02-05 16:44:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:01,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:01,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:01,445 INFO L87 Difference]: Start difference. First operand 2150 states and 3349 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:01,705 INFO L93 Difference]: Finished difference Result 6296 states and 9865 transitions. [2025-02-05 16:44:01,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:01,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:44:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:01,742 INFO L225 Difference]: With dead ends: 6296 [2025-02-05 16:44:01,742 INFO L226 Difference]: Without dead ends: 4192 [2025-02-05 16:44:01,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:01,746 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 966 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:01,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [966 Valid, 213 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2025-02-05 16:44:01,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4190. [2025-02-05 16:44:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.5590833134399618) internal successors, (6531), 4189 states have internal predecessors, (6531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6531 transitions. [2025-02-05 16:44:01,850 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6531 transitions. Word has length 93 [2025-02-05 16:44:01,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:01,850 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6531 transitions. [2025-02-05 16:44:01,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6531 transitions. [2025-02-05 16:44:01,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:44:01,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:01,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:01,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:44:01,856 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash -291231159, now seen corresponding path program 1 times [2025-02-05 16:44:01,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222895219] [2025-02-05 16:44:01,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:01,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:44:01,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:44:01,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:01,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:02,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:02,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222895219] [2025-02-05 16:44:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222895219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552389619] [2025-02-05 16:44:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:02,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:02,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:02,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:02,011 INFO L87 Difference]: Start difference. First operand 4190 states and 6531 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:02,191 INFO L93 Difference]: Finished difference Result 8322 states and 13001 transitions. [2025-02-05 16:44:02,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:02,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:44:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:02,205 INFO L225 Difference]: With dead ends: 8322 [2025-02-05 16:44:02,206 INFO L226 Difference]: Without dead ends: 4190 [2025-02-05 16:44:02,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:02,212 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 623 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:02,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 156 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:02,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2025-02-05 16:44:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2025-02-05 16:44:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.5445213654810217) internal successors, (6470), 4189 states have internal predecessors, (6470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6470 transitions. [2025-02-05 16:44:02,301 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6470 transitions. Word has length 94 [2025-02-05 16:44:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:02,302 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6470 transitions. [2025-02-05 16:44:02,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6470 transitions. [2025-02-05 16:44:02,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:44:02,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:02,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:02,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:44:02,304 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:02,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:02,304 INFO L85 PathProgramCache]: Analyzing trace with hash 909188322, now seen corresponding path program 1 times [2025-02-05 16:44:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:02,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808801198] [2025-02-05 16:44:02,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:02,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:02,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:44:02,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:44:02,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:02,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:02,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808801198] [2025-02-05 16:44:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808801198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:02,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:02,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454124683] [2025-02-05 16:44:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:02,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:02,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:02,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:02,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:02,431 INFO L87 Difference]: Start difference. First operand 4190 states and 6470 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:02,598 INFO L93 Difference]: Finished difference Result 8318 states and 12875 transitions. [2025-02-05 16:44:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:02,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:44:02,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:02,624 INFO L225 Difference]: With dead ends: 8318 [2025-02-05 16:44:02,624 INFO L226 Difference]: Without dead ends: 4190 [2025-02-05 16:44:02,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:02,633 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 605 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:02,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 164 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2025-02-05 16:44:02,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2025-02-05 16:44:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.5299594175220816) internal successors, (6409), 4189 states have internal predecessors, (6409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6409 transitions. [2025-02-05 16:44:02,735 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6409 transitions. Word has length 95 [2025-02-05 16:44:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:02,735 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6409 transitions. [2025-02-05 16:44:02,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:02,736 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6409 transitions. [2025-02-05 16:44:02,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 16:44:02,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:02,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:02,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:44:02,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:02,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1497230277, now seen corresponding path program 1 times [2025-02-05 16:44:02,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:02,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99562488] [2025-02-05 16:44:02,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:02,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:02,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 16:44:02,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 16:44:02,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:02,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:02,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:02,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99562488] [2025-02-05 16:44:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99562488] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:02,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664113096] [2025-02-05 16:44:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:02,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:02,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:02,860 INFO L87 Difference]: Start difference. First operand 4190 states and 6409 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:03,012 INFO L93 Difference]: Finished difference Result 8330 states and 12767 transitions. [2025-02-05 16:44:03,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:03,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2025-02-05 16:44:03,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:03,023 INFO L225 Difference]: With dead ends: 8330 [2025-02-05 16:44:03,023 INFO L226 Difference]: Without dead ends: 4190 [2025-02-05 16:44:03,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:03,030 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 633 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:03,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 140 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:03,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2025-02-05 16:44:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2025-02-05 16:44:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.5153974695631416) internal successors, (6348), 4189 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6348 transitions. [2025-02-05 16:44:03,103 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6348 transitions. Word has length 96 [2025-02-05 16:44:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6348 transitions. [2025-02-05 16:44:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6348 transitions. [2025-02-05 16:44:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 16:44:03,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:03,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:03,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:44:03,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:03,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1256448354, now seen corresponding path program 1 times [2025-02-05 16:44:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888200327] [2025-02-05 16:44:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:03,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 16:44:03,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 16:44:03,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:03,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888200327] [2025-02-05 16:44:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888200327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:03,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131768568] [2025-02-05 16:44:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:03,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:03,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:03,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:03,220 INFO L87 Difference]: Start difference. First operand 4190 states and 6348 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:03,374 INFO L93 Difference]: Finished difference Result 8326 states and 12641 transitions. [2025-02-05 16:44:03,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:03,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-02-05 16:44:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:03,383 INFO L225 Difference]: With dead ends: 8326 [2025-02-05 16:44:03,384 INFO L226 Difference]: Without dead ends: 4190 [2025-02-05 16:44:03,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:03,390 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 615 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:03,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 148 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2025-02-05 16:44:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2025-02-05 16:44:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.5008355216042015) internal successors, (6287), 4189 states have internal predecessors, (6287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6287 transitions. [2025-02-05 16:44:03,506 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6287 transitions. Word has length 97 [2025-02-05 16:44:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:03,506 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6287 transitions. [2025-02-05 16:44:03,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6287 transitions. [2025-02-05 16:44:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:44:03,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:03,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:03,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:44:03,509 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:03,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:03,509 INFO L85 PathProgramCache]: Analyzing trace with hash -750151359, now seen corresponding path program 1 times [2025-02-05 16:44:03,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:03,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642205364] [2025-02-05 16:44:03,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:03,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:03,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:44:03,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:44:03,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:03,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:03,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:03,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642205364] [2025-02-05 16:44:03,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642205364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:03,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049533156] [2025-02-05 16:44:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:03,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:03,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:03,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:03,620 INFO L87 Difference]: Start difference. First operand 4190 states and 6287 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:03,775 INFO L93 Difference]: Finished difference Result 8314 states and 12507 transitions. [2025-02-05 16:44:03,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:03,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:44:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:03,784 INFO L225 Difference]: With dead ends: 8314 [2025-02-05 16:44:03,784 INFO L226 Difference]: Without dead ends: 4190 [2025-02-05 16:44:03,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:03,791 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 573 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:03,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 172 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:44:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2025-02-05 16:44:03,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4190. [2025-02-05 16:44:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.4862735736452615) internal successors, (6226), 4189 states have internal predecessors, (6226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6226 transitions. [2025-02-05 16:44:03,856 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6226 transitions. Word has length 98 [2025-02-05 16:44:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:03,857 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6226 transitions. [2025-02-05 16:44:03,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6226 transitions. [2025-02-05 16:44:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:44:03,858 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:03,858 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:44:03,859 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:03,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1066109546, now seen corresponding path program 1 times [2025-02-05 16:44:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:03,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738021799] [2025-02-05 16:44:03,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:03,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:44:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:44:03,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:03,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:04,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:04,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:04,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738021799] [2025-02-05 16:44:04,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738021799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:04,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:44:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134538276] [2025-02-05 16:44:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:04,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:44:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:04,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:44:04,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:44:04,256 INFO L87 Difference]: Start difference. First operand 4190 states and 6226 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:04,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:04,681 INFO L93 Difference]: Finished difference Result 12076 states and 17980 transitions. [2025-02-05 16:44:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:04,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 16:44:04,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:04,699 INFO L225 Difference]: With dead ends: 12076 [2025-02-05 16:44:04,699 INFO L226 Difference]: Without dead ends: 8091 [2025-02-05 16:44:04,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:44:04,708 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 516 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:04,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 551 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8091 states. [2025-02-05 16:44:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8091 to 4190. [2025-02-05 16:44:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.486034853186918) internal successors, (6225), 4189 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6225 transitions. [2025-02-05 16:44:04,810 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6225 transitions. Word has length 99 [2025-02-05 16:44:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:04,810 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6225 transitions. [2025-02-05 16:44:04,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6225 transitions. [2025-02-05 16:44:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:44:04,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:04,812 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] [2025-02-05 16:44:04,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:44:04,812 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:04,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -254160156, now seen corresponding path program 1 times [2025-02-05 16:44:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:04,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087718130] [2025-02-05 16:44:04,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:44:04,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:44:04,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:04,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087718130] [2025-02-05 16:44:05,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087718130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:05,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:05,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879780783] [2025-02-05 16:44:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:05,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:05,206 INFO L87 Difference]: Start difference. First operand 4190 states and 6225 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:05,756 INFO L93 Difference]: Finished difference Result 12387 states and 18401 transitions. [2025-02-05 16:44:05,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:05,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 16:44:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:05,775 INFO L225 Difference]: With dead ends: 12387 [2025-02-05 16:44:05,775 INFO L226 Difference]: Without dead ends: 8356 [2025-02-05 16:44:05,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:05,783 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 627 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:05,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 609 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8356 states. [2025-02-05 16:44:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8356 to 4190. [2025-02-05 16:44:05,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.4846025304368584) internal successors, (6219), 4189 states have internal predecessors, (6219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6219 transitions. [2025-02-05 16:44:05,894 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6219 transitions. Word has length 100 [2025-02-05 16:44:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:05,894 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6219 transitions. [2025-02-05 16:44:05,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6219 transitions. [2025-02-05 16:44:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 16:44:05,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:05,897 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] [2025-02-05 16:44:05,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:44:05,897 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:05,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:05,898 INFO L85 PathProgramCache]: Analyzing trace with hash -931062292, now seen corresponding path program 1 times [2025-02-05 16:44:05,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:05,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446951369] [2025-02-05 16:44:05,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:05,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:05,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 16:44:05,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 16:44:05,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:05,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:06,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:06,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446951369] [2025-02-05 16:44:06,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446951369] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:06,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:06,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140139354] [2025-02-05 16:44:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:06,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:06,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:06,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:06,244 INFO L87 Difference]: Start difference. First operand 4190 states and 6219 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:06,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:06,799 INFO L93 Difference]: Finished difference Result 8870 states and 13150 transitions. [2025-02-05 16:44:06,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:06,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2025-02-05 16:44:06,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:06,810 INFO L225 Difference]: With dead ends: 8870 [2025-02-05 16:44:06,811 INFO L226 Difference]: Without dead ends: 4824 [2025-02-05 16:44:06,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:06,817 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1055 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:06,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 729 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2025-02-05 16:44:06,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4190. [2025-02-05 16:44:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.4838863690618287) internal successors, (6216), 4189 states have internal predecessors, (6216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6216 transitions. [2025-02-05 16:44:06,921 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6216 transitions. Word has length 100 [2025-02-05 16:44:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:06,921 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6216 transitions. [2025-02-05 16:44:06,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 9 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6216 transitions. [2025-02-05 16:44:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-05 16:44:06,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:06,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:06,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:44:06,923 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:06,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:06,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1266650295, now seen corresponding path program 1 times [2025-02-05 16:44:06,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:06,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626619871] [2025-02-05 16:44:06,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:06,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:06,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-05 16:44:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-05 16:44:06,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:06,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626619871] [2025-02-05 16:44:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626619871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:07,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:07,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008357372] [2025-02-05 16:44:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:07,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:07,241 INFO L87 Difference]: Start difference. First operand 4190 states and 6216 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:07,773 INFO L93 Difference]: Finished difference Result 12167 states and 18040 transitions. [2025-02-05 16:44:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-02-05 16:44:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:07,790 INFO L225 Difference]: With dead ends: 12167 [2025-02-05 16:44:07,791 INFO L226 Difference]: Without dead ends: 8266 [2025-02-05 16:44:07,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:07,798 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 907 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:07,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 612 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:07,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8266 states. [2025-02-05 16:44:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8266 to 4190. [2025-02-05 16:44:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.480783003103366) internal successors, (6203), 4189 states have internal predecessors, (6203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6203 transitions. [2025-02-05 16:44:07,876 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6203 transitions. Word has length 101 [2025-02-05 16:44:07,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:07,877 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6203 transitions. [2025-02-05 16:44:07,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 9 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:07,877 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6203 transitions. [2025-02-05 16:44:07,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-02-05 16:44:07,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:07,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] [2025-02-05 16:44:07,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:44:07,879 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1287254100, now seen corresponding path program 1 times [2025-02-05 16:44:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611296047] [2025-02-05 16:44:07,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-05 16:44:07,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-05 16:44:07,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:07,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:08,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:08,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:08,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611296047] [2025-02-05 16:44:08,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611296047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:08,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:08,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848178841] [2025-02-05 16:44:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:08,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:08,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:08,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:08,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:08,220 INFO L87 Difference]: Start difference. First operand 4190 states and 6203 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:08,704 INFO L93 Difference]: Finished difference Result 12267 states and 18165 transitions. [2025-02-05 16:44:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:08,705 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2025-02-05 16:44:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:08,721 INFO L225 Difference]: With dead ends: 12267 [2025-02-05 16:44:08,721 INFO L226 Difference]: Without dead ends: 8311 [2025-02-05 16:44:08,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:08,728 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 596 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:08,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 611 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8311 states. [2025-02-05 16:44:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8311 to 4190. [2025-02-05 16:44:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 4189 states have (on average 1.4781570780615898) internal successors, (6192), 4189 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 6192 transitions. [2025-02-05 16:44:08,803 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 6192 transitions. Word has length 102 [2025-02-05 16:44:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:08,803 INFO L471 AbstractCegarLoop]: Abstraction has 4190 states and 6192 transitions. [2025-02-05 16:44:08,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 9 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 6192 transitions. [2025-02-05 16:44:08,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:44:08,805 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:08,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:08,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:44:08,805 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:08,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 194305697, now seen corresponding path program 1 times [2025-02-05 16:44:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691752011] [2025-02-05 16:44:08,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:08,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:44:08,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:44:08,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:08,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:09,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:09,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691752011] [2025-02-05 16:44:09,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691752011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:09,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:09,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:44:09,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093557670] [2025-02-05 16:44:09,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:09,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:44:09,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:09,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:44:09,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:09,533 INFO L87 Difference]: Start difference. First operand 4190 states and 6192 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:10,852 INFO L93 Difference]: Finished difference Result 26961 states and 39810 transitions. [2025-02-05 16:44:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:44:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 16:44:10,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:10,904 INFO L225 Difference]: With dead ends: 26961 [2025-02-05 16:44:10,905 INFO L226 Difference]: Without dead ends: 22960 [2025-02-05 16:44:10,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=645, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:44:10,921 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 2125 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:10,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 1430 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:44:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22960 states. [2025-02-05 16:44:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22960 to 4208. [2025-02-05 16:44:11,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4208 states, 4207 states have (on average 1.4753981459472307) internal successors, (6207), 4207 states have internal predecessors, (6207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 6207 transitions. [2025-02-05 16:44:11,122 INFO L78 Accepts]: Start accepts. Automaton has 4208 states and 6207 transitions. Word has length 103 [2025-02-05 16:44:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 4208 states and 6207 transitions. [2025-02-05 16:44:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4208 states and 6207 transitions. [2025-02-05 16:44:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:11,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:11,125 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] [2025-02-05 16:44:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:44:11,125 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:11,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:11,126 INFO L85 PathProgramCache]: Analyzing trace with hash -313958796, now seen corresponding path program 1 times [2025-02-05 16:44:11,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808823836] [2025-02-05 16:44:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:11,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:11,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:11,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:11,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:11,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:11,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808823836] [2025-02-05 16:44:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808823836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:11,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:11,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 16:44:11,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594611635] [2025-02-05 16:44:11,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:11,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 16:44:11,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:11,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 16:44:11,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:44:11,840 INFO L87 Difference]: Start difference. First operand 4208 states and 6207 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:12,361 INFO L93 Difference]: Finished difference Result 9162 states and 13585 transitions. [2025-02-05 16:44:12,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:12,362 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:12,382 INFO L225 Difference]: With dead ends: 9162 [2025-02-05 16:44:12,382 INFO L226 Difference]: Without dead ends: 8071 [2025-02-05 16:44:12,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:44:12,388 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 794 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:12,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1373 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2025-02-05 16:44:12,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 4171. [2025-02-05 16:44:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4171 states, 4170 states have (on average 1.476019184652278) internal successors, (6155), 4170 states have internal predecessors, (6155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:12,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 6155 transitions. [2025-02-05 16:44:12,476 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 6155 transitions. Word has length 104 [2025-02-05 16:44:12,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:12,476 INFO L471 AbstractCegarLoop]: Abstraction has 4171 states and 6155 transitions. [2025-02-05 16:44:12,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:12,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 6155 transitions. [2025-02-05 16:44:12,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:12,478 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:12,478 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] [2025-02-05 16:44:12,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:44:12,478 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:12,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2054578732, now seen corresponding path program 1 times [2025-02-05 16:44:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465033452] [2025-02-05 16:44:12,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:12,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:12,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:12,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:12,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465033452] [2025-02-05 16:44:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465033452] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:44:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793134747] [2025-02-05 16:44:13,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:44:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:13,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:44:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:13,144 INFO L87 Difference]: Start difference. First operand 4171 states and 6155 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:13,791 INFO L93 Difference]: Finished difference Result 9159 states and 13581 transitions. [2025-02-05 16:44:13,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:44:13,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:13,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:13,810 INFO L225 Difference]: With dead ends: 9159 [2025-02-05 16:44:13,810 INFO L226 Difference]: Without dead ends: 8117 [2025-02-05 16:44:13,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:44:13,815 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1135 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:13,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 1334 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8117 states. [2025-02-05 16:44:13,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 4169. [2025-02-05 16:44:13,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4168 states have (on average 1.4733685220729367) internal successors, (6141), 4168 states have internal predecessors, (6141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 6141 transitions. [2025-02-05 16:44:13,902 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 6141 transitions. Word has length 104 [2025-02-05 16:44:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:13,903 INFO L471 AbstractCegarLoop]: Abstraction has 4169 states and 6141 transitions. [2025-02-05 16:44:13,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 6141 transitions. [2025-02-05 16:44:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:13,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:13,904 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] [2025-02-05 16:44:13,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:44:13,904 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash -81304364, now seen corresponding path program 1 times [2025-02-05 16:44:13,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:13,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945369053] [2025-02-05 16:44:13,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:13,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:13,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:13,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:13,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:14,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:14,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945369053] [2025-02-05 16:44:14,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945369053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:14,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:14,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:44:14,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005571289] [2025-02-05 16:44:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:14,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:44:14,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:14,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:44:14,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:14,521 INFO L87 Difference]: Start difference. First operand 4169 states and 6141 transitions. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:15,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:15,192 INFO L93 Difference]: Finished difference Result 9193 states and 13613 transitions. [2025-02-05 16:44:15,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:44:15,193 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:15,206 INFO L225 Difference]: With dead ends: 9193 [2025-02-05 16:44:15,207 INFO L226 Difference]: Without dead ends: 8111 [2025-02-05 16:44:15,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-02-05 16:44:15,212 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 994 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:15,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1567 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8111 states. [2025-02-05 16:44:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8111 to 4147. [2025-02-05 16:44:15,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4147 states, 4146 states have (on average 1.4725036179450073) internal successors, (6105), 4146 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:15,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4147 states to 4147 states and 6105 transitions. [2025-02-05 16:44:15,309 INFO L78 Accepts]: Start accepts. Automaton has 4147 states and 6105 transitions. Word has length 104 [2025-02-05 16:44:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 4147 states and 6105 transitions. [2025-02-05 16:44:15,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:15,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4147 states and 6105 transitions. [2025-02-05 16:44:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:15,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:15,311 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] [2025-02-05 16:44:15,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:44:15,311 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:15,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1895366916, now seen corresponding path program 1 times [2025-02-05 16:44:15,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:15,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573864046] [2025-02-05 16:44:15,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:15,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:15,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:15,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:15,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:16,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:16,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:16,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573864046] [2025-02-05 16:44:16,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573864046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:16,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:16,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:44:16,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528018552] [2025-02-05 16:44:16,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:16,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:44:16,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:16,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:44:16,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:44:16,047 INFO L87 Difference]: Start difference. First operand 4147 states and 6105 transitions. Second operand has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:17,108 INFO L93 Difference]: Finished difference Result 17035 states and 25273 transitions. [2025-02-05 16:44:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:44:17,109 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:17,134 INFO L225 Difference]: With dead ends: 17035 [2025-02-05 16:44:17,134 INFO L226 Difference]: Without dead ends: 15933 [2025-02-05 16:44:17,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:44:17,142 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1162 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 3535 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:17,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 3535 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15933 states. [2025-02-05 16:44:17,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15933 to 4095. [2025-02-05 16:44:17,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 4094 states have (on average 1.4741084513922813) internal successors, (6035), 4094 states have internal predecessors, (6035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 6035 transitions. [2025-02-05 16:44:17,300 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 6035 transitions. Word has length 104 [2025-02-05 16:44:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:17,300 INFO L471 AbstractCegarLoop]: Abstraction has 4095 states and 6035 transitions. [2025-02-05 16:44:17,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.428571428571429) internal successors, (104), 14 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:17,301 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 6035 transitions. [2025-02-05 16:44:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:17,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:17,303 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] [2025-02-05 16:44:17,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:44:17,304 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:17,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:17,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1749203676, now seen corresponding path program 1 times [2025-02-05 16:44:17,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:17,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8234990] [2025-02-05 16:44:17,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:17,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:17,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:17,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:17,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:17,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:18,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:18,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:18,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8234990] [2025-02-05 16:44:18,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8234990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:18,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:18,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:44:18,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230412798] [2025-02-05 16:44:18,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:18,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:44:18,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:18,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:44:18,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:44:18,340 INFO L87 Difference]: Start difference. First operand 4095 states and 6035 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:19,480 INFO L93 Difference]: Finished difference Result 9119 states and 13501 transitions. [2025-02-05 16:44:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 16:44:19,481 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:19,488 INFO L225 Difference]: With dead ends: 9119 [2025-02-05 16:44:19,488 INFO L226 Difference]: Without dead ends: 8037 [2025-02-05 16:44:19,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:44:19,492 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 724 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:19,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 2467 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:44:19,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2025-02-05 16:44:19,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 4089. [2025-02-05 16:44:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 4088 states have (on average 1.4743150684931507) internal successors, (6027), 4088 states have internal predecessors, (6027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 6027 transitions. [2025-02-05 16:44:19,560 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 6027 transitions. Word has length 104 [2025-02-05 16:44:19,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:19,561 INFO L471 AbstractCegarLoop]: Abstraction has 4089 states and 6027 transitions. [2025-02-05 16:44:19,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 6027 transitions. [2025-02-05 16:44:19,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 16:44:19,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:19,563 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] [2025-02-05 16:44:19,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:44:19,565 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:19,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:19,567 INFO L85 PathProgramCache]: Analyzing trace with hash -496725702, now seen corresponding path program 1 times [2025-02-05 16:44:19,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:19,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957136531] [2025-02-05 16:44:19,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:19,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:19,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 16:44:19,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 16:44:19,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:19,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957136531] [2025-02-05 16:44:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957136531] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:19,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:44:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566709208] [2025-02-05 16:44:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:19,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:44:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:19,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:44:19,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:44:19,836 INFO L87 Difference]: Start difference. First operand 4089 states and 6027 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:20,482 INFO L93 Difference]: Finished difference Result 12091 states and 17869 transitions. [2025-02-05 16:44:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:44:20,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2025-02-05 16:44:20,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:20,493 INFO L225 Difference]: With dead ends: 12091 [2025-02-05 16:44:20,493 INFO L226 Difference]: Without dead ends: 8135 [2025-02-05 16:44:20,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:44:20,499 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 668 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:20,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 933 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:44:20,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8135 states. [2025-02-05 16:44:20,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8135 to 4083. [2025-02-05 16:44:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4083 states, 4082 states have (on average 1.474032337089662) internal successors, (6017), 4082 states have internal predecessors, (6017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4083 states to 4083 states and 6017 transitions. [2025-02-05 16:44:20,591 INFO L78 Accepts]: Start accepts. Automaton has 4083 states and 6017 transitions. Word has length 104 [2025-02-05 16:44:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:20,591 INFO L471 AbstractCegarLoop]: Abstraction has 4083 states and 6017 transitions. [2025-02-05 16:44:20,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4083 states and 6017 transitions. [2025-02-05 16:44:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:44:20,592 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:20,592 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:20,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:44:20,593 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:20,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:20,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1035769602, now seen corresponding path program 1 times [2025-02-05 16:44:20,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:20,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494014642] [2025-02-05 16:44:20,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:20,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:20,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:44:20,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:44:20,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:20,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:20,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494014642] [2025-02-05 16:44:20,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494014642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:20,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:20,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:44:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516842140] [2025-02-05 16:44:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:20,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:44:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:20,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:44:20,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:44:20,737 INFO L87 Difference]: Start difference. First operand 4083 states and 6017 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:20,791 INFO L93 Difference]: Finished difference Result 9625 states and 14286 transitions. [2025-02-05 16:44:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:20,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:44:20,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:20,799 INFO L225 Difference]: With dead ends: 9625 [2025-02-05 16:44:20,799 INFO L226 Difference]: Without dead ends: 5737 [2025-02-05 16:44:20,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-05 16:44:20,806 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 107 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:20,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 519 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:20,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2025-02-05 16:44:20,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 5709. [2025-02-05 16:44:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5709 states, 5708 states have (on average 1.4712683952347583) internal successors, (8398), 5708 states have internal predecessors, (8398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 8398 transitions. [2025-02-05 16:44:20,877 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 8398 transitions. Word has length 105 [2025-02-05 16:44:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:20,878 INFO L471 AbstractCegarLoop]: Abstraction has 5709 states and 8398 transitions. [2025-02-05 16:44:20,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 8398 transitions. [2025-02-05 16:44:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:44:20,879 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:20,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] [2025-02-05 16:44:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:44:20,879 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:20,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:20,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1067973673, now seen corresponding path program 1 times [2025-02-05 16:44:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673897012] [2025-02-05 16:44:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:20,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:44:20,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:44:20,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:20,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:21,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:21,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673897012] [2025-02-05 16:44:21,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673897012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:21,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:21,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:44:21,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917707668] [2025-02-05 16:44:21,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:21,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:44:21,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:21,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:44:21,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:21,075 INFO L87 Difference]: Start difference. First operand 5709 states and 8398 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:21,107 INFO L93 Difference]: Finished difference Result 5739 states and 8441 transitions. [2025-02-05 16:44:21,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:44:21,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:44:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:21,115 INFO L225 Difference]: With dead ends: 5739 [2025-02-05 16:44:21,115 INFO L226 Difference]: Without dead ends: 5737 [2025-02-05 16:44:21,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:44:21,119 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 0 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:21,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:21,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5737 states. [2025-02-05 16:44:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5737 to 5737. [2025-02-05 16:44:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5737 states, 5736 states have (on average 1.4637377963737797) internal successors, (8396), 5736 states have internal predecessors, (8396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:21,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5737 states to 5737 states and 8396 transitions. [2025-02-05 16:44:21,187 INFO L78 Accepts]: Start accepts. Automaton has 5737 states and 8396 transitions. Word has length 105 [2025-02-05 16:44:21,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:21,188 INFO L471 AbstractCegarLoop]: Abstraction has 5737 states and 8396 transitions. [2025-02-05 16:44:21,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:21,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5737 states and 8396 transitions. [2025-02-05 16:44:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:44:21,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:21,189 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:21,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:44:21,189 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:21,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash -699891497, now seen corresponding path program 1 times [2025-02-05 16:44:21,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:21,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266229610] [2025-02-05 16:44:21,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:21,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:21,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:44:21,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:44:21,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:21,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:23,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:23,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:23,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266229610] [2025-02-05 16:44:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266229610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2025-02-05 16:44:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746892949] [2025-02-05 16:44:23,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:23,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-05 16:44:23,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:23,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-05 16:44:23,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2025-02-05 16:44:23,351 INFO L87 Difference]: Start difference. First operand 5737 states and 8396 transitions. Second operand has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:26,960 INFO L93 Difference]: Finished difference Result 10493 states and 15413 transitions. [2025-02-05 16:44:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 16:44:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:44:26,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:26,965 INFO L225 Difference]: With dead ends: 10493 [2025-02-05 16:44:26,965 INFO L226 Difference]: Without dead ends: 5762 [2025-02-05 16:44:26,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=651, Invalid=4179, Unknown=0, NotChecked=0, Total=4830 [2025-02-05 16:44:26,971 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 656 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:26,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 3548 Invalid, 3035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 16:44:26,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5762 states. [2025-02-05 16:44:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5762 to 5758. [2025-02-05 16:44:27,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5758 states, 5757 states have (on average 1.4627410109431995) internal successors, (8421), 5757 states have internal predecessors, (8421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5758 states to 5758 states and 8421 transitions. [2025-02-05 16:44:27,036 INFO L78 Accepts]: Start accepts. Automaton has 5758 states and 8421 transitions. Word has length 105 [2025-02-05 16:44:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:27,036 INFO L471 AbstractCegarLoop]: Abstraction has 5758 states and 8421 transitions. [2025-02-05 16:44:27,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.8378378378378377) internal successors, (105), 37 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 5758 states and 8421 transitions. [2025-02-05 16:44:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 16:44:27,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:27,037 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] [2025-02-05 16:44:27,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:44:27,038 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:27,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:27,038 INFO L85 PathProgramCache]: Analyzing trace with hash -525691477, now seen corresponding path program 1 times [2025-02-05 16:44:27,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:27,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56692735] [2025-02-05 16:44:27,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:27,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:27,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 16:44:27,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 16:44:27,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:27,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:27,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56692735] [2025-02-05 16:44:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56692735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 16:44:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363952626] [2025-02-05 16:44:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:27,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:44:27,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:27,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:44:27,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:27,604 INFO L87 Difference]: Start difference. First operand 5758 states and 8421 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:28,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:28,047 INFO L93 Difference]: Finished difference Result 7304 states and 10704 transitions. [2025-02-05 16:44:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:44:28,048 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2025-02-05 16:44:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:28,054 INFO L225 Difference]: With dead ends: 7304 [2025-02-05 16:44:28,055 INFO L226 Difference]: Without dead ends: 5704 [2025-02-05 16:44:28,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:44:28,058 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 532 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:28,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1277 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-02-05 16:44:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5704. [2025-02-05 16:44:28,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5704 states, 5703 states have (on average 1.465018411362441) internal successors, (8355), 5703 states have internal predecessors, (8355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8355 transitions. [2025-02-05 16:44:28,120 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8355 transitions. Word has length 105 [2025-02-05 16:44:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:28,120 INFO L471 AbstractCegarLoop]: Abstraction has 5704 states and 8355 transitions. [2025-02-05 16:44:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:28,121 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8355 transitions. [2025-02-05 16:44:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-05 16:44:28,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:28,121 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] [2025-02-05 16:44:28,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:44:28,122 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:28,123 INFO L85 PathProgramCache]: Analyzing trace with hash 27407468, now seen corresponding path program 1 times [2025-02-05 16:44:28,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535296480] [2025-02-05 16:44:28,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:28,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-05 16:44:28,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-05 16:44:28,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:28,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535296480] [2025-02-05 16:44:28,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535296480] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:28,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:28,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:44:28,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529001306] [2025-02-05 16:44:28,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:28,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:44:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:28,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:44:28,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:44:28,660 INFO L87 Difference]: Start difference. First operand 5704 states and 8355 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:29,397 INFO L93 Difference]: Finished difference Result 23922 states and 35216 transitions. [2025-02-05 16:44:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 16:44:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-02-05 16:44:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:29,419 INFO L225 Difference]: With dead ends: 23922 [2025-02-05 16:44:29,420 INFO L226 Difference]: Without dead ends: 22360 [2025-02-05 16:44:29,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2025-02-05 16:44:29,428 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 757 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:29,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 4432 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:29,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22360 states. [2025-02-05 16:44:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22360 to 5687. [2025-02-05 16:44:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5687 states, 5686 states have (on average 1.4655293703833978) internal successors, (8333), 5686 states have internal predecessors, (8333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 8333 transitions. [2025-02-05 16:44:29,568 INFO L78 Accepts]: Start accepts. Automaton has 5687 states and 8333 transitions. Word has length 106 [2025-02-05 16:44:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:29,568 INFO L471 AbstractCegarLoop]: Abstraction has 5687 states and 8333 transitions. [2025-02-05 16:44:29,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 5687 states and 8333 transitions. [2025-02-05 16:44:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:29,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:29,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:29,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:44:29,571 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:29,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:29,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1051811543, now seen corresponding path program 1 times [2025-02-05 16:44:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936355670] [2025-02-05 16:44:29,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:29,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:29,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:29,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:29,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:29,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936355670] [2025-02-05 16:44:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936355670] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:44:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95567102] [2025-02-05 16:44:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:29,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:44:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:29,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:44:29,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:29,701 INFO L87 Difference]: Start difference. First operand 5687 states and 8333 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:30,094 INFO L93 Difference]: Finished difference Result 19165 states and 28367 transitions. [2025-02-05 16:44:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:30,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:30,111 INFO L225 Difference]: With dead ends: 19165 [2025-02-05 16:44:30,112 INFO L226 Difference]: Without dead ends: 13623 [2025-02-05 16:44:30,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:30,121 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 935 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:30,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 534 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13623 states. [2025-02-05 16:44:30,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13623 to 8497. [2025-02-05 16:44:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8497 states, 8496 states have (on average 1.4679849340866291) internal successors, (12472), 8496 states have internal predecessors, (12472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8497 states to 8497 states and 12472 transitions. [2025-02-05 16:44:30,237 INFO L78 Accepts]: Start accepts. Automaton has 8497 states and 12472 transitions. Word has length 138 [2025-02-05 16:44:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:30,237 INFO L471 AbstractCegarLoop]: Abstraction has 8497 states and 12472 transitions. [2025-02-05 16:44:30,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,237 INFO L276 IsEmpty]: Start isEmpty. Operand 8497 states and 12472 transitions. [2025-02-05 16:44:30,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:30,239 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:30,240 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:30,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-05 16:44:30,240 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:30,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:30,241 INFO L85 PathProgramCache]: Analyzing trace with hash 5574761, now seen corresponding path program 1 times [2025-02-05 16:44:30,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:30,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99624784] [2025-02-05 16:44:30,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:30,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:30,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:30,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:30,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:30,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99624784] [2025-02-05 16:44:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99624784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:30,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:44:30,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523665359] [2025-02-05 16:44:30,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:30,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:44:30,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:30,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:44:30,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:30,365 INFO L87 Difference]: Start difference. First operand 8497 states and 12472 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:30,780 INFO L93 Difference]: Finished difference Result 34409 states and 50928 transitions. [2025-02-05 16:44:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:30,816 INFO L225 Difference]: With dead ends: 34409 [2025-02-05 16:44:30,816 INFO L226 Difference]: Without dead ends: 26093 [2025-02-05 16:44:30,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:30,826 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1235 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:30,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 417 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26093 states. [2025-02-05 16:44:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26093 to 17971. [2025-02-05 16:44:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17971 states, 17970 states have (on average 1.467056204785754) internal successors, (26363), 17970 states have internal predecessors, (26363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17971 states to 17971 states and 26363 transitions. [2025-02-05 16:44:31,013 INFO L78 Accepts]: Start accepts. Automaton has 17971 states and 26363 transitions. Word has length 138 [2025-02-05 16:44:31,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:31,014 INFO L471 AbstractCegarLoop]: Abstraction has 17971 states and 26363 transitions. [2025-02-05 16:44:31,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 17971 states and 26363 transitions. [2025-02-05 16:44:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:31,016 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:31,016 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:31,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-05 16:44:31,017 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2020941737, now seen corresponding path program 1 times [2025-02-05 16:44:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:31,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940652010] [2025-02-05 16:44:31,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:31,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:31,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:31,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:31,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:31,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:31,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940652010] [2025-02-05 16:44:31,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940652010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:31,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:31,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:44:31,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321172875] [2025-02-05 16:44:31,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:31,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:44:31,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:31,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:44:31,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:31,144 INFO L87 Difference]: Start difference. First operand 17971 states and 26363 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:31,560 INFO L93 Difference]: Finished difference Result 67471 states and 99561 transitions. [2025-02-05 16:44:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:31,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:31,634 INFO L225 Difference]: With dead ends: 67471 [2025-02-05 16:44:31,634 INFO L226 Difference]: Without dead ends: 49681 [2025-02-05 16:44:31,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:31,667 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1150 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:31,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 415 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49681 states. [2025-02-05 16:44:32,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49681 to 38079. [2025-02-05 16:44:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38079 states, 38078 states have (on average 1.4645989810389202) internal successors, (55769), 38078 states have internal predecessors, (55769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38079 states to 38079 states and 55769 transitions. [2025-02-05 16:44:32,144 INFO L78 Accepts]: Start accepts. Automaton has 38079 states and 55769 transitions. Word has length 138 [2025-02-05 16:44:32,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:32,144 INFO L471 AbstractCegarLoop]: Abstraction has 38079 states and 55769 transitions. [2025-02-05 16:44:32,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 38079 states and 55769 transitions. [2025-02-05 16:44:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:32,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:32,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:32,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:44:32,148 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:32,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:32,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1861283529, now seen corresponding path program 1 times [2025-02-05 16:44:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:32,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132951710] [2025-02-05 16:44:32,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:32,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:32,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:32,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:32,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:32,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:32,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132951710] [2025-02-05 16:44:32,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132951710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:44:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709356831] [2025-02-05 16:44:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:32,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:44:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:32,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:44:32,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:32,272 INFO L87 Difference]: Start difference. First operand 38079 states and 55769 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:32,723 INFO L93 Difference]: Finished difference Result 132435 states and 194739 transitions. [2025-02-05 16:44:32,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:32,724 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:32,831 INFO L225 Difference]: With dead ends: 132435 [2025-02-05 16:44:32,831 INFO L226 Difference]: Without dead ends: 94537 [2025-02-05 16:44:32,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:32,885 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1065 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:32,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 413 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:44:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94537 states. [2025-02-05 16:44:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94537 to 80615. [2025-02-05 16:44:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80615 states, 80614 states have (on average 1.4616443793881957) internal successors, (117829), 80614 states have internal predecessors, (117829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80615 states to 80615 states and 117829 transitions. [2025-02-05 16:44:34,092 INFO L78 Accepts]: Start accepts. Automaton has 80615 states and 117829 transitions. Word has length 138 [2025-02-05 16:44:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:34,092 INFO L471 AbstractCegarLoop]: Abstraction has 80615 states and 117829 transitions. [2025-02-05 16:44:34,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 80615 states and 117829 transitions. [2025-02-05 16:44:34,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:34,096 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:34,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:34,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:44:34,096 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:34,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:34,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1684699503, now seen corresponding path program 1 times [2025-02-05 16:44:34,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:34,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139781999] [2025-02-05 16:44:34,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:34,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:34,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:34,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:34,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:34,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:34,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139781999] [2025-02-05 16:44:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139781999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:34,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:34,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:44:34,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749822533] [2025-02-05 16:44:34,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:34,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:44:34,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:34,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:44:34,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:44:34,263 INFO L87 Difference]: Start difference. First operand 80615 states and 117829 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:35,304 INFO L93 Difference]: Finished difference Result 260043 states and 380919 transitions. [2025-02-05 16:44:35,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:44:35,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:35,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:35,518 INFO L225 Difference]: With dead ends: 260043 [2025-02-05 16:44:35,518 INFO L226 Difference]: Without dead ends: 179609 [2025-02-05 16:44:35,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:44:35,559 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 980 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:44:35,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 411 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:44:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179609 states. [2025-02-05 16:44:37,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179609 to 170327. [2025-02-05 16:44:37,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170327 states, 170326 states have (on average 1.4586440120709698) internal successors, (248445), 170326 states have internal predecessors, (248445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170327 states to 170327 states and 248445 transitions. [2025-02-05 16:44:38,042 INFO L78 Accepts]: Start accepts. Automaton has 170327 states and 248445 transitions. Word has length 138 [2025-02-05 16:44:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:38,042 INFO L471 AbstractCegarLoop]: Abstraction has 170327 states and 248445 transitions. [2025-02-05 16:44:38,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 170327 states and 248445 transitions. [2025-02-05 16:44:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:44:38,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:38,047 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:38,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-05 16:44:38,047 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:38,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:38,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1287540603, now seen corresponding path program 1 times [2025-02-05 16:44:38,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:38,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368949512] [2025-02-05 16:44:38,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:38,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:38,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:44:38,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:44:38,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:38,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:38,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:44:38,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:38,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368949512] [2025-02-05 16:44:38,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368949512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:38,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:38,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:38,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164778226] [2025-02-05 16:44:38,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:38,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:38,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:38,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:38,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:38,142 INFO L87 Difference]: Start difference. First operand 170327 states and 248445 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:38,988 INFO L93 Difference]: Finished difference Result 300859 states and 439007 transitions. [2025-02-05 16:44:38,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:38,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 16:44:38,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:39,260 INFO L225 Difference]: With dead ends: 300859 [2025-02-05 16:44:39,260 INFO L226 Difference]: Without dead ends: 165047 [2025-02-05 16:44:39,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:39,363 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 99 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 471 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-02-05 16:44:39,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 471 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:39,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165047 states. [2025-02-05 16:44:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165047 to 165045. [2025-02-05 16:44:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165045 states, 165044 states have (on average 1.450043624730375) internal successors, (239321), 165044 states have internal predecessors, (239321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165045 states to 165045 states and 239321 transitions. [2025-02-05 16:44:41,618 INFO L78 Accepts]: Start accepts. Automaton has 165045 states and 239321 transitions. Word has length 138 [2025-02-05 16:44:41,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:41,618 INFO L471 AbstractCegarLoop]: Abstraction has 165045 states and 239321 transitions. [2025-02-05 16:44:41,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 165045 states and 239321 transitions. [2025-02-05 16:44:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 16:44:41,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:41,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:44:41,639 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 281475221, now seen corresponding path program 1 times [2025-02-05 16:44:41,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:41,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792585470] [2025-02-05 16:44:41,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:41,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:41,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 16:44:41,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 16:44:41,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:41,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:44:42,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:42,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792585470] [2025-02-05 16:44:42,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792585470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:42,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:42,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:42,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017876713] [2025-02-05 16:44:42,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:42,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:42,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:42,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:42,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:42,101 INFO L87 Difference]: Start difference. First operand 165045 states and 239321 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:42,921 INFO L93 Difference]: Finished difference Result 320121 states and 463531 transitions. [2025-02-05 16:44:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 169 [2025-02-05 16:44:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:43,154 INFO L225 Difference]: With dead ends: 320121 [2025-02-05 16:44:43,154 INFO L226 Difference]: Without dead ends: 155249 [2025-02-05 16:44:43,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:43,266 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 95 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 460 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-02-05 16:44:43,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 460 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155249 states. [2025-02-05 16:44:44,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155249 to 152355. [2025-02-05 16:44:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152355 states, 152354 states have (on average 1.439909684025362) internal successors, (219376), 152354 states have internal predecessors, (219376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152355 states to 152355 states and 219376 transitions. [2025-02-05 16:44:45,236 INFO L78 Accepts]: Start accepts. Automaton has 152355 states and 219376 transitions. Word has length 169 [2025-02-05 16:44:45,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:45,237 INFO L471 AbstractCegarLoop]: Abstraction has 152355 states and 219376 transitions. [2025-02-05 16:44:45,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand 152355 states and 219376 transitions. [2025-02-05 16:44:45,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 16:44:45,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:45,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:45,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-02-05 16:44:45,256 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:45,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:45,256 INFO L85 PathProgramCache]: Analyzing trace with hash -781837420, now seen corresponding path program 1 times [2025-02-05 16:44:45,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:45,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337974481] [2025-02-05 16:44:45,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:45,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:45,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 16:44:45,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 16:44:45,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:45,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:45,752 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 16:44:45,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:45,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337974481] [2025-02-05 16:44:45,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337974481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:45,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:45,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:45,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649851858] [2025-02-05 16:44:45,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:45,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:45,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:45,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:45,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:45,753 INFO L87 Difference]: Start difference. First operand 152355 states and 219376 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:46,366 INFO L93 Difference]: Finished difference Result 294807 states and 423730 transitions. [2025-02-05 16:44:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 170 [2025-02-05 16:44:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:46,556 INFO L225 Difference]: With dead ends: 294807 [2025-02-05 16:44:46,557 INFO L226 Difference]: Without dead ends: 142613 [2025-02-05 16:44:46,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:46,661 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 88 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 462 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-02-05 16:44:46,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:47,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142613 states. [2025-02-05 16:44:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142613 to 139827. [2025-02-05 16:44:48,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139827 states, 139826 states have (on average 1.429548152704075) internal successors, (199888), 139826 states have internal predecessors, (199888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139827 states to 139827 states and 199888 transitions. [2025-02-05 16:44:48,889 INFO L78 Accepts]: Start accepts. Automaton has 139827 states and 199888 transitions. Word has length 170 [2025-02-05 16:44:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:48,890 INFO L471 AbstractCegarLoop]: Abstraction has 139827 states and 199888 transitions. [2025-02-05 16:44:48,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 139827 states and 199888 transitions. [2025-02-05 16:44:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 16:44:48,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:48,907 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:44:48,907 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:48,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash -39690750, now seen corresponding path program 1 times [2025-02-05 16:44:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:48,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820657417] [2025-02-05 16:44:48,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:48,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:48,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 16:44:48,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 16:44:48,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:48,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:49,030 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 16:44:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:49,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820657417] [2025-02-05 16:44:49,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820657417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:49,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:49,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:49,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761144950] [2025-02-05 16:44:49,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:49,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:49,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:49,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:49,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:49,036 INFO L87 Difference]: Start difference. First operand 139827 states and 199888 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:50,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:50,090 INFO L93 Difference]: Finished difference Result 269751 states and 384754 transitions. [2025-02-05 16:44:50,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:50,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 171 [2025-02-05 16:44:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:50,252 INFO L225 Difference]: With dead ends: 269751 [2025-02-05 16:44:50,252 INFO L226 Difference]: Without dead ends: 130085 [2025-02-05 16:44:50,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:50,325 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 81 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 462 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-02-05 16:44:50,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 462 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130085 states. [2025-02-05 16:44:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130085 to 127299. [2025-02-05 16:44:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127299 states, 127298 states have (on average 1.4171471664912254) internal successors, (180400), 127298 states have internal predecessors, (180400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127299 states to 127299 states and 180400 transitions. [2025-02-05 16:44:51,840 INFO L78 Accepts]: Start accepts. Automaton has 127299 states and 180400 transitions. Word has length 171 [2025-02-05 16:44:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:51,841 INFO L471 AbstractCegarLoop]: Abstraction has 127299 states and 180400 transitions. [2025-02-05 16:44:51,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 127299 states and 180400 transitions. [2025-02-05 16:44:51,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 16:44:51,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:51,851 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:51,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-02-05 16:44:51,851 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:51,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1810851207, now seen corresponding path program 1 times [2025-02-05 16:44:51,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:51,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308080303] [2025-02-05 16:44:51,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:51,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:51,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 16:44:51,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 16:44:51,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:51,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:44:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308080303] [2025-02-05 16:44:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308080303] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998277004] [2025-02-05 16:44:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:52,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:52,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:52,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:52,408 INFO L87 Difference]: Start difference. First operand 127299 states and 180400 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:53,110 INFO L93 Difference]: Finished difference Result 244695 states and 345778 transitions. [2025-02-05 16:44:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 172 [2025-02-05 16:44:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:53,267 INFO L225 Difference]: With dead ends: 244695 [2025-02-05 16:44:53,267 INFO L226 Difference]: Without dead ends: 117557 [2025-02-05 16:44:53,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:53,361 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 74 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 463 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-02-05 16:44:53,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 463 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117557 states. [2025-02-05 16:44:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117557 to 114771. [2025-02-05 16:44:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114771 states, 114770 states have (on average 1.4020388603293543) internal successors, (160912), 114770 states have internal predecessors, (160912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:54,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114771 states to 114771 states and 160912 transitions. [2025-02-05 16:44:54,907 INFO L78 Accepts]: Start accepts. Automaton has 114771 states and 160912 transitions. Word has length 172 [2025-02-05 16:44:54,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:44:54,908 INFO L471 AbstractCegarLoop]: Abstraction has 114771 states and 160912 transitions. [2025-02-05 16:44:54,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:54,908 INFO L276 IsEmpty]: Start isEmpty. Operand 114771 states and 160912 transitions. [2025-02-05 16:44:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 16:44:54,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:44:54,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:44:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-02-05 16:44:54,917 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:44:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:44:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1538808917, now seen corresponding path program 1 times [2025-02-05 16:44:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:44:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334405641] [2025-02-05 16:44:54,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:44:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:44:54,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 16:44:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 16:44:54,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:44:54,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:44:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:44:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:44:55,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334405641] [2025-02-05 16:44:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334405641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:44:55,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:44:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:44:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858239248] [2025-02-05 16:44:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:44:55,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:44:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:44:55,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:44:55,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:55,343 INFO L87 Difference]: Start difference. First operand 114771 states and 160912 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:44:55,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:44:55,961 INFO L93 Difference]: Finished difference Result 333783 states and 465682 transitions. [2025-02-05 16:44:55,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:44:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 173 [2025-02-05 16:44:55,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:44:56,268 INFO L225 Difference]: With dead ends: 333783 [2025-02-05 16:44:56,268 INFO L226 Difference]: Without dead ends: 219173 [2025-02-05 16:44:56,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:44:56,391 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 67 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 464 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-02-05 16:44:56,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 464 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:44:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219173 states. [2025-02-05 16:44:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219173 to 206179. [2025-02-05 16:44:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206179 states, 206178 states have (on average 1.3890133767909283) internal successors, (286384), 206178 states have internal predecessors, (286384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)