./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-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 4a068220cd9a63125e810935e79eeb0e481ecd288491865590be5286d46acb22 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:26:43,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:26:43,373 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:26:43,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:26:43,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:26:43,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:26:43,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:26:43,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:26:43,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:26:43,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:26:43,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:26:43,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:26:43,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:26:43,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:26:43,415 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:26:43,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:26:43,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:26:43,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:26:43,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:26:43,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:26:43,417 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 -> 4a068220cd9a63125e810935e79eeb0e481ecd288491865590be5286d46acb22 [2025-02-05 16:26:43,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:26:43,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:26:43,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:26:43,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:26:43,727 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:26:43,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:26:45,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29629e402/fc02e98a95a2488eb8298a3aada0359b/FLAG0388667d6 [2025-02-05 16:26:45,461 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:26:45,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:26:45,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29629e402/fc02e98a95a2488eb8298a3aada0359b/FLAG0388667d6 [2025-02-05 16:26:45,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29629e402/fc02e98a95a2488eb8298a3aada0359b [2025-02-05 16:26:45,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:26:45,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:26:45,503 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:26:45,503 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:26:45,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:26:45,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:45,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbcdac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45, skipping insertion in model container [2025-02-05 16:26:45,511 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:45,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:26:45,763 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2025-02-05 16:26:45,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:26:45,827 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:26:45,881 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_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[7235,7248] [2025-02-05 16:26:45,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:26:45,925 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:26:45,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45 WrapperNode [2025-02-05 16:26:45,926 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:26:45,927 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:26:45,927 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:26:45,927 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:26:45,934 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:26:45" (1/1) ... [2025-02-05 16:26:45,946 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:26:45" (1/1) ... [2025-02-05 16:26:45,993 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 633 [2025-02-05 16:26:45,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:26:45,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:26:45,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:26:45,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:26:46,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,006 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,025 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:26:46,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,044 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:26:46,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:26:46,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:26:46,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:26:46,061 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (1/1) ... [2025-02-05 16:26:46,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:26:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:26:46,096 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:26:46,100 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:26:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:26:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:26:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:26:46,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:26:46,250 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:26:46,252 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:26:46,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L515: havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:26:46,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:26:46,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L616: havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:26:46,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:26:46,817 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L113: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1; [2025-02-05 16:26:46,861 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-02-05 16:26:46,863 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:26:46,879 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:26:46,879 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:26:46,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:26:46 BoogieIcfgContainer [2025-02-05 16:26:46,880 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:26:46,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:26:46,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:26:46,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:26:46,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:26:45" (1/3) ... [2025-02-05 16:26:46,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9002af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:26:46, skipping insertion in model container [2025-02-05 16:26:46,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:26:45" (2/3) ... [2025-02-05 16:26:46,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9002af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:26:46, skipping insertion in model container [2025-02-05 16:26:46,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:26:46" (3/3) ... [2025-02-05 16:26:46,890 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:26:46,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:26:46,909 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 135 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:26:46,993 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:26:47,005 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;@75b139c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:26:47,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:26:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 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:26:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:26:47,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:47,020 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] [2025-02-05 16:26:47,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -436874549, now seen corresponding path program 1 times [2025-02-05 16:26:47,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:47,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106358635] [2025-02-05 16:26:47,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:47,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:47,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:26:47,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:26:47,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:47,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:47,582 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:26:47,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:47,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106358635] [2025-02-05 16:26:47,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106358635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:47,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:47,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743201073] [2025-02-05 16:26:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:47,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:47,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:47,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:47,614 INFO L87 Difference]: Start difference. First operand has 135 states, 133 states have (on average 1.7744360902255638) internal successors, (236), 134 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:26:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:47,720 INFO L93 Difference]: Finished difference Result 288 states and 491 transitions. [2025-02-05 16:26:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:47,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-02-05 16:26:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:47,730 INFO L225 Difference]: With dead ends: 288 [2025-02-05 16:26:47,730 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 16:26:47,737 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:26:47,740 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 131 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:47,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 412 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:47,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 16:26:47,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2025-02-05 16:26:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 1.5808080808080809) internal successors, (313), 198 states have internal predecessors, (313), 0 states have call successors, (0), 0 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:26:47,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 313 transitions. [2025-02-05 16:26:47,786 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 313 transitions. Word has length 57 [2025-02-05 16:26:47,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:47,787 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 313 transitions. [2025-02-05 16:26:47,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:26:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 313 transitions. [2025-02-05 16:26:47,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-05 16:26:47,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:47,789 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] [2025-02-05 16:26:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:26:47,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:47,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash -331784162, now seen corresponding path program 1 times [2025-02-05 16:26:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905522383] [2025-02-05 16:26:47,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:47,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-05 16:26:47,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-05 16:26:47,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:47,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:48,018 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:26:48,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:48,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905522383] [2025-02-05 16:26:48,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905522383] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:48,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:48,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937196891] [2025-02-05 16:26:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:48,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:48,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:48,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:48,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:48,024 INFO L87 Difference]: Start difference. First operand 199 states and 313 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:26:48,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:48,064 INFO L93 Difference]: Finished difference Result 475 states and 769 transitions. [2025-02-05 16:26:48,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:48,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-02-05 16:26:48,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:48,070 INFO L225 Difference]: With dead ends: 475 [2025-02-05 16:26:48,071 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 16:26:48,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:48,072 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 110 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:48,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 378 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 16:26:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-02-05 16:26:48,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.6055045871559632) internal successors, (525), 327 states have internal predecessors, (525), 0 states have call successors, (0), 0 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:26:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 525 transitions. [2025-02-05 16:26:48,098 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 525 transitions. Word has length 59 [2025-02-05 16:26:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:48,098 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 525 transitions. [2025-02-05 16:26:48,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:26:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 525 transitions. [2025-02-05 16:26:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:26:48,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:48,100 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] [2025-02-05 16:26:48,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:26:48,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:48,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:48,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1994921611, now seen corresponding path program 1 times [2025-02-05 16:26:48,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:48,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750168794] [2025-02-05 16:26:48,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:48,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:48,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:26:48,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:26:48,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:48,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:48,268 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:26:48,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:48,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750168794] [2025-02-05 16:26:48,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750168794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:48,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:48,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:48,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283041239] [2025-02-05 16:26:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:48,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:48,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:48,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:48,272 INFO L87 Difference]: Start difference. First operand 328 states and 525 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:26:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:48,306 INFO L93 Difference]: Finished difference Result 848 states and 1379 transitions. [2025-02-05 16:26:48,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:48,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2025-02-05 16:26:48,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:48,310 INFO L225 Difference]: With dead ends: 848 [2025-02-05 16:26:48,310 INFO L226 Difference]: Without dead ends: 574 [2025-02-05 16:26:48,311 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:26:48,312 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 105 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:48,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 379 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-02-05 16:26:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2025-02-05 16:26:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.6129597197898424) internal successors, (921), 571 states have internal predecessors, (921), 0 states have call successors, (0), 0 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:26:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 921 transitions. [2025-02-05 16:26:48,334 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 921 transitions. Word has length 61 [2025-02-05 16:26:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:48,335 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 921 transitions. [2025-02-05 16:26:48,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 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:26:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 921 transitions. [2025-02-05 16:26:48,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:26:48,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:48,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:48,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:26:48,338 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:48,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:48,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1981246946, now seen corresponding path program 1 times [2025-02-05 16:26:48,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:48,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445673965] [2025-02-05 16:26:48,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:48,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:26:48,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:26:48,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:48,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:48,568 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:26:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:48,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445673965] [2025-02-05 16:26:48,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445673965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:48,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:48,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:48,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081259897] [2025-02-05 16:26:48,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:48,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:48,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:48,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:48,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:48,570 INFO L87 Difference]: Start difference. First operand 572 states and 921 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:48,755 INFO L93 Difference]: Finished difference Result 2452 states and 4047 transitions. [2025-02-05 16:26:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:26:48,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:26:48,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:48,764 INFO L225 Difference]: With dead ends: 2452 [2025-02-05 16:26:48,765 INFO L226 Difference]: Without dead ends: 1934 [2025-02-05 16:26:48,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:26:48,767 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 850 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:48,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 1219 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:48,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2025-02-05 16:26:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1023. [2025-02-05 16:26:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1022 states have (on average 1.6252446183953033) internal successors, (1661), 1022 states have internal predecessors, (1661), 0 states have call successors, (0), 0 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:26:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1661 transitions. [2025-02-05 16:26:48,808 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1661 transitions. Word has length 63 [2025-02-05 16:26:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:48,808 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1661 transitions. [2025-02-05 16:26:48,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1661 transitions. [2025-02-05 16:26:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:26:48,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:48,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:48,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:26:48,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:48,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1287234297, now seen corresponding path program 1 times [2025-02-05 16:26:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772196551] [2025-02-05 16:26:48,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:48,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:48,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:26:48,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:26:48,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:48,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:48,966 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:26:48,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:48,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772196551] [2025-02-05 16:26:48,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772196551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:48,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:48,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:26:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789603163] [2025-02-05 16:26:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:48,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:26:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:48,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:26:48,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:26:48,969 INFO L87 Difference]: Start difference. First operand 1023 states and 1661 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:49,058 INFO L93 Difference]: Finished difference Result 2976 states and 4902 transitions. [2025-02-05 16:26:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:26:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:26:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:49,068 INFO L225 Difference]: With dead ends: 2976 [2025-02-05 16:26:49,068 INFO L226 Difference]: Without dead ends: 2007 [2025-02-05 16:26:49,070 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:26:49,071 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 379 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:49,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 678 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:49,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-02-05 16:26:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1506. [2025-02-05 16:26:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6332225913621263) internal successors, (2458), 1505 states have internal predecessors, (2458), 0 states have call successors, (0), 0 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:26:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2458 transitions. [2025-02-05 16:26:49,132 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2458 transitions. Word has length 64 [2025-02-05 16:26:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2458 transitions. [2025-02-05 16:26:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2458 transitions. [2025-02-05 16:26:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:26:49,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:49,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:49,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:26:49,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:49,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:49,137 INFO L85 PathProgramCache]: Analyzing trace with hash 191492041, now seen corresponding path program 1 times [2025-02-05 16:26:49,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:49,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270532235] [2025-02-05 16:26:49,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:49,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:49,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:26:49,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:26:49,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:49,248 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:26:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270532235] [2025-02-05 16:26:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270532235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:49,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:49,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:49,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195985749] [2025-02-05 16:26:49,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:49,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:49,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:49,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:49,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:49,250 INFO L87 Difference]: Start difference. First operand 1506 states and 2458 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:49,286 INFO L93 Difference]: Finished difference Result 3041 states and 4994 transitions. [2025-02-05 16:26:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:49,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:26:49,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:49,297 INFO L225 Difference]: With dead ends: 3041 [2025-02-05 16:26:49,297 INFO L226 Difference]: Without dead ends: 2217 [2025-02-05 16:26:49,302 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:26:49,303 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 106 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:49,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 412 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:49,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2025-02-05 16:26:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2215. [2025-02-05 16:26:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2215 states, 2214 states have (on average 1.6287262872628727) internal successors, (3606), 2214 states have internal predecessors, (3606), 0 states have call successors, (0), 0 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:26:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2215 states to 2215 states and 3606 transitions. [2025-02-05 16:26:49,381 INFO L78 Accepts]: Start accepts. Automaton has 2215 states and 3606 transitions. Word has length 64 [2025-02-05 16:26:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:49,381 INFO L471 AbstractCegarLoop]: Abstraction has 2215 states and 3606 transitions. [2025-02-05 16:26:49,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2215 states and 3606 transitions. [2025-02-05 16:26:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:26:49,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:49,384 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:26:49,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:49,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash 551175626, now seen corresponding path program 1 times [2025-02-05 16:26:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:49,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805911478] [2025-02-05 16:26:49,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:49,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:49,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:26:49,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:26:49,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:49,475 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:26:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805911478] [2025-02-05 16:26:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805911478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:49,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:49,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:49,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45416383] [2025-02-05 16:26:49,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:49,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:49,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:49,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:49,479 INFO L87 Difference]: Start difference. First operand 2215 states and 3606 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:49,526 INFO L93 Difference]: Finished difference Result 4157 states and 6812 transitions. [2025-02-05 16:26:49,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:49,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:26:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:49,539 INFO L225 Difference]: With dead ends: 4157 [2025-02-05 16:26:49,539 INFO L226 Difference]: Without dead ends: 2979 [2025-02-05 16:26:49,542 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:26:49,543 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 111 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:49,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 444 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:49,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2979 states. [2025-02-05 16:26:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2979 to 2977. [2025-02-05 16:26:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2977 states, 2976 states have (on average 1.6256720430107527) internal successors, (4838), 2976 states have internal predecessors, (4838), 0 states have call successors, (0), 0 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:26:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4838 transitions. [2025-02-05 16:26:49,616 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4838 transitions. Word has length 64 [2025-02-05 16:26:49,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:49,616 INFO L471 AbstractCegarLoop]: Abstraction has 2977 states and 4838 transitions. [2025-02-05 16:26:49,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4838 transitions. [2025-02-05 16:26:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:26:49,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:49,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:49,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:26:49,618 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:49,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1276868503, now seen corresponding path program 1 times [2025-02-05 16:26:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:49,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693805542] [2025-02-05 16:26:49,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:49,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:49,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:26:49,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:26:49,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:49,721 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:26:49,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:49,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693805542] [2025-02-05 16:26:49,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693805542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:49,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513916994] [2025-02-05 16:26:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:49,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:49,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:49,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:49,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:49,723 INFO L87 Difference]: Start difference. First operand 2977 states and 4838 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:49,773 INFO L93 Difference]: Finished difference Result 6399 states and 10550 transitions. [2025-02-05 16:26:49,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:49,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:26:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:49,794 INFO L225 Difference]: With dead ends: 6399 [2025-02-05 16:26:49,794 INFO L226 Difference]: Without dead ends: 4313 [2025-02-05 16:26:49,799 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:26:49,800 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 116 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:49,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 467 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:49,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-02-05 16:26:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4311. [2025-02-05 16:26:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4311 states, 4310 states have (on average 1.6331786542923434) internal successors, (7039), 4310 states have internal predecessors, (7039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 7039 transitions. [2025-02-05 16:26:49,921 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 7039 transitions. Word has length 64 [2025-02-05 16:26:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 4311 states and 7039 transitions. [2025-02-05 16:26:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 7039 transitions. [2025-02-05 16:26:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:26:49,926 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:49,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:26:49,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1247768031, now seen corresponding path program 1 times [2025-02-05 16:26:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037247360] [2025-02-05 16:26:49,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:49,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:26:49,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:26:49,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:50,057 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:26:50,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:50,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037247360] [2025-02-05 16:26:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037247360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:26:50,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42100572] [2025-02-05 16:26:50,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:50,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:26:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:50,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:26:50,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:26:50,059 INFO L87 Difference]: Start difference. First operand 4311 states and 7039 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:50,224 INFO L93 Difference]: Finished difference Result 13702 states and 22482 transitions. [2025-02-05 16:26:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:26:50,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:26:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:50,271 INFO L225 Difference]: With dead ends: 13702 [2025-02-05 16:26:50,272 INFO L226 Difference]: Without dead ends: 9473 [2025-02-05 16:26:50,283 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:26:50,284 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 377 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:50,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 676 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:50,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states. [2025-02-05 16:26:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 6863. [2025-02-05 16:26:50,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6863 states, 6862 states have (on average 1.6264937336053629) internal successors, (11161), 6862 states have internal predecessors, (11161), 0 states have call successors, (0), 0 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:26:50,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6863 states to 6863 states and 11161 transitions. [2025-02-05 16:26:50,471 INFO L78 Accepts]: Start accepts. Automaton has 6863 states and 11161 transitions. Word has length 65 [2025-02-05 16:26:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:50,471 INFO L471 AbstractCegarLoop]: Abstraction has 6863 states and 11161 transitions. [2025-02-05 16:26:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6863 states and 11161 transitions. [2025-02-05 16:26:50,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:26:50,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:50,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:50,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:26:50,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:50,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:50,475 INFO L85 PathProgramCache]: Analyzing trace with hash -24403158, now seen corresponding path program 1 times [2025-02-05 16:26:50,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:50,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255918352] [2025-02-05 16:26:50,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:50,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:50,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:26:50,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:26:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:50,597 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:26:50,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:50,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255918352] [2025-02-05 16:26:50,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255918352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:50,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:50,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:26:50,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706253275] [2025-02-05 16:26:50,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:50,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:26:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:50,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:26:50,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:26:50,599 INFO L87 Difference]: Start difference. First operand 6863 states and 11161 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:50,739 INFO L93 Difference]: Finished difference Result 21434 states and 34994 transitions. [2025-02-05 16:26:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:26:50,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:26:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:50,790 INFO L225 Difference]: With dead ends: 21434 [2025-02-05 16:26:50,790 INFO L226 Difference]: Without dead ends: 14653 [2025-02-05 16:26:50,804 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:26:50,805 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 375 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:50,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 679 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:50,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14653 states. [2025-02-05 16:26:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14653 to 10715. [2025-02-05 16:26:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.6190965092402465) internal successors, (17347), 10714 states have internal predecessors, (17347), 0 states have call successors, (0), 0 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:26:51,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17347 transitions. [2025-02-05 16:26:51,091 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17347 transitions. Word has length 66 [2025-02-05 16:26:51,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:51,092 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17347 transitions. [2025-02-05 16:26:51,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17347 transitions. [2025-02-05 16:26:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:26:51,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:51,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:26:51,124 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:51,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1925113428, now seen corresponding path program 1 times [2025-02-05 16:26:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618875384] [2025-02-05 16:26:51,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:51,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:26:51,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:26:51,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:51,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:51,387 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:26:51,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:51,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618875384] [2025-02-05 16:26:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618875384] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:51,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117347321] [2025-02-05 16:26:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:51,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:51,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:51,390 INFO L87 Difference]: Start difference. First operand 10715 states and 17347 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:51,550 INFO L93 Difference]: Finished difference Result 21350 states and 34583 transitions. [2025-02-05 16:26:51,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:51,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2025-02-05 16:26:51,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:51,577 INFO L225 Difference]: With dead ends: 21350 [2025-02-05 16:26:51,577 INFO L226 Difference]: Without dead ends: 10717 [2025-02-05 16:26:51,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:51,594 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 105 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:51,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 730 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10717 states. [2025-02-05 16:26:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10717 to 10715. [2025-02-05 16:26:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10715 states, 10714 states have (on average 1.607429531454172) internal successors, (17222), 10714 states have internal predecessors, (17222), 0 states have call successors, (0), 0 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:26:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 17222 transitions. [2025-02-05 16:26:51,903 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 17222 transitions. Word has length 68 [2025-02-05 16:26:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:51,903 INFO L471 AbstractCegarLoop]: Abstraction has 10715 states and 17222 transitions. [2025-02-05 16:26:51,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 17222 transitions. [2025-02-05 16:26:51,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:26:51,904 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:51,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] [2025-02-05 16:26:51,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:26:51,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:51,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1031757195, now seen corresponding path program 1 times [2025-02-05 16:26:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630835071] [2025-02-05 16:26:51,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:26:51,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:26:51,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:51,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:52,115 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:26:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:52,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630835071] [2025-02-05 16:26:52,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630835071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:52,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981832598] [2025-02-05 16:26:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:52,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:52,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:52,119 INFO L87 Difference]: Start difference. First operand 10715 states and 17222 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:52,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:52,275 INFO L93 Difference]: Finished difference Result 30660 states and 49437 transitions. [2025-02-05 16:26:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:52,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-05 16:26:52,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:52,327 INFO L225 Difference]: With dead ends: 30660 [2025-02-05 16:26:52,328 INFO L226 Difference]: Without dead ends: 20027 [2025-02-05 16:26:52,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:26:52,349 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 205 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:52,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 558 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:52,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20027 states. [2025-02-05 16:26:52,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20027 to 20025. [2025-02-05 16:26:52,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20025 states, 20024 states have (on average 1.5949360767079506) internal successors, (31937), 20024 states have internal predecessors, (31937), 0 states have call successors, (0), 0 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:26:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20025 states to 20025 states and 31937 transitions. [2025-02-05 16:26:52,752 INFO L78 Accepts]: Start accepts. Automaton has 20025 states and 31937 transitions. Word has length 71 [2025-02-05 16:26:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:52,752 INFO L471 AbstractCegarLoop]: Abstraction has 20025 states and 31937 transitions. [2025-02-05 16:26:52,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20025 states and 31937 transitions. [2025-02-05 16:26:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:26:52,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:52,754 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:52,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:26:52,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:52,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1920657337, now seen corresponding path program 1 times [2025-02-05 16:26:52,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:52,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666674167] [2025-02-05 16:26:52,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:52,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:52,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:26:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:26:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:26:53,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666674167] [2025-02-05 16:26:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666674167] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:53,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101517032] [2025-02-05 16:26:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:53,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:53,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:53,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:53,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:53,166 INFO L87 Difference]: Start difference. First operand 20025 states and 31937 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:53,270 INFO L93 Difference]: Finished difference Result 20751 states and 33024 transitions. [2025-02-05 16:26:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2025-02-05 16:26:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:53,323 INFO L225 Difference]: With dead ends: 20751 [2025-02-05 16:26:53,323 INFO L226 Difference]: Without dead ends: 20749 [2025-02-05 16:26:53,334 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:26:53,334 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:53,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 787 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20749 states. [2025-02-05 16:26:53,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20749 to 20749. [2025-02-05 16:26:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20749 states, 20748 states have (on average 1.573742047426258) internal successors, (32652), 20748 states have internal predecessors, (32652), 0 states have call successors, (0), 0 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:26:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20749 states to 20749 states and 32652 transitions. [2025-02-05 16:26:53,748 INFO L78 Accepts]: Start accepts. Automaton has 20749 states and 32652 transitions. Word has length 72 [2025-02-05 16:26:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:53,748 INFO L471 AbstractCegarLoop]: Abstraction has 20749 states and 32652 transitions. [2025-02-05 16:26:53,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 20749 states and 32652 transitions. [2025-02-05 16:26:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:26:53,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:53,751 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:26:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:26:53,752 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1307908251, now seen corresponding path program 1 times [2025-02-05 16:26:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379110671] [2025-02-05 16:26:53,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:53,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:26:53,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:26:53,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:53,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 16:26:53,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:53,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379110671] [2025-02-05 16:26:53,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379110671] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:53,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:53,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:53,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088070299] [2025-02-05 16:26:53,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:53,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:53,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:53,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:53,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:53,912 INFO L87 Difference]: Start difference. First operand 20749 states and 32652 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:26:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:54,133 INFO L93 Difference]: Finished difference Result 50557 states and 79854 transitions. [2025-02-05 16:26:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 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:26:54,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:54,199 INFO L225 Difference]: With dead ends: 50557 [2025-02-05 16:26:54,199 INFO L226 Difference]: Without dead ends: 40765 [2025-02-05 16:26:54,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:26:54,225 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 484 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:54,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 926 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40765 states. [2025-02-05 16:26:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40765 to 31835. [2025-02-05 16:26:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31835 states, 31834 states have (on average 1.572532512408117) internal successors, (50060), 31834 states have internal predecessors, (50060), 0 states have call successors, (0), 0 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:26:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31835 states to 31835 states and 50060 transitions. [2025-02-05 16:26:54,879 INFO L78 Accepts]: Start accepts. Automaton has 31835 states and 50060 transitions. Word has length 93 [2025-02-05 16:26:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:54,879 INFO L471 AbstractCegarLoop]: Abstraction has 31835 states and 50060 transitions. [2025-02-05 16:26:54,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:26:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31835 states and 50060 transitions. [2025-02-05 16:26:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:26:54,882 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:54,882 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:26:54,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:26:54,882 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:54,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash -948224666, now seen corresponding path program 1 times [2025-02-05 16:26:54,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:54,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317173473] [2025-02-05 16:26:54,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:54,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:26:54,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:26:54,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:54,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:26:55,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:55,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317173473] [2025-02-05 16:26:55,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317173473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:55,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:55,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:55,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521170225] [2025-02-05 16:26:55,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:55,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:55,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:55,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:55,202 INFO L87 Difference]: Start difference. First operand 31835 states and 50060 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:55,410 INFO L93 Difference]: Finished difference Result 54449 states and 86018 transitions. [2025-02-05 16:26:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:55,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-02-05 16:26:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:55,487 INFO L225 Difference]: With dead ends: 54449 [2025-02-05 16:26:55,487 INFO L226 Difference]: Without dead ends: 44657 [2025-02-05 16:26:55,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:26:55,517 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 482 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:55,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 915 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44657 states. [2025-02-05 16:26:56,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44657 to 43067. [2025-02-05 16:26:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43067 states, 43066 states have (on average 1.573445409371662) internal successors, (67762), 43066 states have internal predecessors, (67762), 0 states have call successors, (0), 0 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:26:56,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43067 states to 43067 states and 67762 transitions. [2025-02-05 16:26:56,461 INFO L78 Accepts]: Start accepts. Automaton has 43067 states and 67762 transitions. Word has length 93 [2025-02-05 16:26:56,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:56,461 INFO L471 AbstractCegarLoop]: Abstraction has 43067 states and 67762 transitions. [2025-02-05 16:26:56,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:26:56,462 INFO L276 IsEmpty]: Start isEmpty. Operand 43067 states and 67762 transitions. [2025-02-05 16:26:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:26:56,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:56,466 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:26:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:26:56,466 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1518698501, now seen corresponding path program 1 times [2025-02-05 16:26:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630567348] [2025-02-05 16:26:56,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:56,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:56,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:26:56,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:26:56,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:56,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:56,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:26:56,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:56,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630567348] [2025-02-05 16:26:56,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630567348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:56,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:26:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72894723] [2025-02-05 16:26:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:56,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:26:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:56,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:26:56,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:26:56,626 INFO L87 Difference]: Start difference. First operand 43067 states and 67762 transitions. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:26:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:56,875 INFO L93 Difference]: Finished difference Result 61063 states and 96646 transitions. [2025-02-05 16:26:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:26:56,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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 93 [2025-02-05 16:26:56,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:56,976 INFO L225 Difference]: With dead ends: 61063 [2025-02-05 16:26:56,976 INFO L226 Difference]: Without dead ends: 51041 [2025-02-05 16:26:57,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:26:57,014 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 484 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:57,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 877 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:26:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51041 states. [2025-02-05 16:26:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51041 to 49451. [2025-02-05 16:26:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49451 states, 49450 states have (on average 1.5763397371081902) internal successors, (77950), 49450 states have internal predecessors, (77950), 0 states have call successors, (0), 0 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:26:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49451 states to 49451 states and 77950 transitions. [2025-02-05 16:26:57,893 INFO L78 Accepts]: Start accepts. Automaton has 49451 states and 77950 transitions. Word has length 93 [2025-02-05 16:26:57,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:57,893 INFO L471 AbstractCegarLoop]: Abstraction has 49451 states and 77950 transitions. [2025-02-05 16:26:57,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 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:26:57,893 INFO L276 IsEmpty]: Start isEmpty. Operand 49451 states and 77950 transitions. [2025-02-05 16:26:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:26:57,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:57,896 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:26:57,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:26:57,896 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:57,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2144555647, now seen corresponding path program 1 times [2025-02-05 16:26:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:57,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291571265] [2025-02-05 16:26:57,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:57,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:26:57,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:26:57,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:57,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:26:58,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:58,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291571265] [2025-02-05 16:26:58,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291571265] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:58,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:58,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:26:58,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754669808] [2025-02-05 16:26:58,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:58,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:26:58,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:58,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:26:58,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:26:58,031 INFO L87 Difference]: Start difference. First operand 49451 states and 77950 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:26:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:26:58,529 INFO L93 Difference]: Finished difference Result 92380 states and 146099 transitions. [2025-02-05 16:26:58,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:26:58,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:26:58,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:26:58,679 INFO L225 Difference]: With dead ends: 92380 [2025-02-05 16:26:58,679 INFO L226 Difference]: Without dead ends: 43011 [2025-02-05 16:26:58,704 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:26:58,709 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 87 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:26:58,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 433 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:26:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43011 states. [2025-02-05 16:26:59,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43011 to 43005. [2025-02-05 16:26:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43005 states, 43004 states have (on average 1.5771556134313087) internal successors, (67824), 43004 states have internal predecessors, (67824), 0 states have call successors, (0), 0 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:26:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43005 states to 43005 states and 67824 transitions. [2025-02-05 16:26:59,697 INFO L78 Accepts]: Start accepts. Automaton has 43005 states and 67824 transitions. Word has length 94 [2025-02-05 16:26:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:26:59,697 INFO L471 AbstractCegarLoop]: Abstraction has 43005 states and 67824 transitions. [2025-02-05 16:26:59,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:26:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 43005 states and 67824 transitions. [2025-02-05 16:26:59,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:26:59,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:26:59,700 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:26:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:26:59,700 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:26:59,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:26:59,701 INFO L85 PathProgramCache]: Analyzing trace with hash -163107840, now seen corresponding path program 1 times [2025-02-05 16:26:59,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:26:59,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706499877] [2025-02-05 16:26:59,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:26:59,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:26:59,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:26:59,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:26:59,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:26:59,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:26:59,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:26:59,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:26:59,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706499877] [2025-02-05 16:26:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706499877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:26:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:26:59,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:26:59,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131333347] [2025-02-05 16:26:59,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:26:59,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:26:59,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:26:59,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:26:59,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:26:59,847 INFO L87 Difference]: Start difference. First operand 43005 states and 67824 transitions. Second operand has 4 states, 4 states have (on average 23.25) 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:27:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:00,323 INFO L93 Difference]: Finished difference Result 74138 states and 117293 transitions. [2025-02-05 16:27:00,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:00,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) 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 94 [2025-02-05 16:27:00,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:00,429 INFO L225 Difference]: With dead ends: 74138 [2025-02-05 16:27:00,429 INFO L226 Difference]: Without dead ends: 57732 [2025-02-05 16:27:00,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:00,460 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 212 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:00,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 692 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:00,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57732 states. [2025-02-05 16:27:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57732 to 56144. [2025-02-05 16:27:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56144 states, 56143 states have (on average 1.5750850506741714) internal successors, (88430), 56143 states have internal predecessors, (88430), 0 states have call successors, (0), 0 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:27:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56144 states to 56144 states and 88430 transitions. [2025-02-05 16:27:01,073 INFO L78 Accepts]: Start accepts. Automaton has 56144 states and 88430 transitions. Word has length 94 [2025-02-05 16:27:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:01,073 INFO L471 AbstractCegarLoop]: Abstraction has 56144 states and 88430 transitions. [2025-02-05 16:27:01,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) 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:27:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 56144 states and 88430 transitions. [2025-02-05 16:27:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:27:01,075 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:01,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:01,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:27:01,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:01,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1315618498, now seen corresponding path program 1 times [2025-02-05 16:27:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060401927] [2025-02-05 16:27:01,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:01,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:01,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:27:01,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:27:01,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:01,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:01,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:01,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060401927] [2025-02-05 16:27:01,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060401927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:01,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790881725] [2025-02-05 16:27:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:01,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:01,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:01,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:01,362 INFO L87 Difference]: Start difference. First operand 56144 states and 88430 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:01,692 INFO L93 Difference]: Finished difference Result 79853 states and 125914 transitions. [2025-02-05 16:27:01,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:01,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:01,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:01,736 INFO L225 Difference]: With dead ends: 79853 [2025-02-05 16:27:01,736 INFO L226 Difference]: Without dead ends: 23814 [2025-02-05 16:27:01,763 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:27:01,764 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 66 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:01,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 405 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:01,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2025-02-05 16:27:01,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 23796. [2025-02-05 16:27:02,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23796 states, 23795 states have (on average 1.5700777474259298) internal successors, (37360), 23795 states have internal predecessors, (37360), 0 states have call successors, (0), 0 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:27:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23796 states to 23796 states and 37360 transitions. [2025-02-05 16:27:02,060 INFO L78 Accepts]: Start accepts. Automaton has 23796 states and 37360 transitions. Word has length 94 [2025-02-05 16:27:02,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:02,060 INFO L471 AbstractCegarLoop]: Abstraction has 23796 states and 37360 transitions. [2025-02-05 16:27:02,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 23796 states and 37360 transitions. [2025-02-05 16:27:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:27:02,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:02,145 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:27:02,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:27:02,145 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:02,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1675302083, now seen corresponding path program 1 times [2025-02-05 16:27:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:02,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521875698] [2025-02-05 16:27:02,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:02,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:27:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:27:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:02,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:02,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521875698] [2025-02-05 16:27:02,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521875698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:02,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:02,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:02,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491489681] [2025-02-05 16:27:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:02,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:02,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:02,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:02,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:02,272 INFO L87 Difference]: Start difference. First operand 23796 states and 37360 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:02,374 INFO L93 Difference]: Finished difference Result 33777 states and 53100 transitions. [2025-02-05 16:27:02,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:02,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:02,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:02,391 INFO L225 Difference]: With dead ends: 33777 [2025-02-05 16:27:02,391 INFO L226 Difference]: Without dead ends: 10086 [2025-02-05 16:27:02,409 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:27:02,410 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 45 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:02,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 377 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:02,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10086 states. [2025-02-05 16:27:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10086 to 10032. [2025-02-05 16:27:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10032 states, 10031 states have (on average 1.564549895324494) internal successors, (15694), 10031 states have internal predecessors, (15694), 0 states have call successors, (0), 0 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:27:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10032 states to 10032 states and 15694 transitions. [2025-02-05 16:27:02,581 INFO L78 Accepts]: Start accepts. Automaton has 10032 states and 15694 transitions. Word has length 94 [2025-02-05 16:27:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:02,581 INFO L471 AbstractCegarLoop]: Abstraction has 10032 states and 15694 transitions. [2025-02-05 16:27:02,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 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:27:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 10032 states and 15694 transitions. [2025-02-05 16:27:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:27:02,583 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:02,583 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] [2025-02-05 16:27:02,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:27:02,583 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:02,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:02,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1298433823, now seen corresponding path program 1 times [2025-02-05 16:27:02,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507421443] [2025-02-05 16:27:02,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:02,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:02,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:27:02,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:27:02,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:02,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 16:27:02,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:02,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507421443] [2025-02-05 16:27:02,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507421443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:02,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:02,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792033133] [2025-02-05 16:27:02,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:02,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:02,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:02,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:02,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:02,908 INFO L87 Difference]: Start difference. First operand 10032 states and 15694 transitions. Second operand has 4 states, 4 states have (on average 23.25) 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:27:03,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:03,063 INFO L93 Difference]: Finished difference Result 24807 states and 38839 transitions. [2025-02-05 16:27:03,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:03,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) 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 94 [2025-02-05 16:27:03,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:03,091 INFO L225 Difference]: With dead ends: 24807 [2025-02-05 16:27:03,091 INFO L226 Difference]: Without dead ends: 18497 [2025-02-05 16:27:03,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:27:03,105 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 354 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:03,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 583 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:27:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18497 states. [2025-02-05 16:27:03,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18497 to 15869. [2025-02-05 16:27:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15869 states, 15868 states have (on average 1.562704814721452) internal successors, (24797), 15868 states have internal predecessors, (24797), 0 states have call successors, (0), 0 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:27:03,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15869 states to 15869 states and 24797 transitions. [2025-02-05 16:27:03,291 INFO L78 Accepts]: Start accepts. Automaton has 15869 states and 24797 transitions. Word has length 94 [2025-02-05 16:27:03,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:03,292 INFO L471 AbstractCegarLoop]: Abstraction has 15869 states and 24797 transitions. [2025-02-05 16:27:03,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) 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:27:03,292 INFO L276 IsEmpty]: Start isEmpty. Operand 15869 states and 24797 transitions. [2025-02-05 16:27:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:27:03,292 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:03,293 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] [2025-02-05 16:27:03,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:27:03,293 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:03,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:03,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1354034080, now seen corresponding path program 1 times [2025-02-05 16:27:03,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:03,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890914852] [2025-02-05 16:27:03,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:03,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:03,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:27:03,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:27:03,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:03,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:27:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890914852] [2025-02-05 16:27:03,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890914852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:03,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656066230] [2025-02-05 16:27:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:03,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:03,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:03,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:03,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:03,541 INFO L87 Difference]: Start difference. First operand 15869 states and 24797 transitions. Second operand has 4 states, 4 states have (on average 23.25) 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:27:03,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:03,673 INFO L93 Difference]: Finished difference Result 38174 states and 59879 transitions. [2025-02-05 16:27:03,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:27:03,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) 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 94 [2025-02-05 16:27:03,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:03,723 INFO L225 Difference]: With dead ends: 38174 [2025-02-05 16:27:03,723 INFO L226 Difference]: Without dead ends: 28600 [2025-02-05 16:27:03,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:27:03,742 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 365 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:03,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 576 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:03,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28600 states. [2025-02-05 16:27:04,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28600 to 25088. [2025-02-05 16:27:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25088 states, 25087 states have (on average 1.5626420058197472) internal successors, (39202), 25087 states have internal predecessors, (39202), 0 states have call successors, (0), 0 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:27:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25088 states to 25088 states and 39202 transitions. [2025-02-05 16:27:04,142 INFO L78 Accepts]: Start accepts. Automaton has 25088 states and 39202 transitions. Word has length 94 [2025-02-05 16:27:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:04,142 INFO L471 AbstractCegarLoop]: Abstraction has 25088 states and 39202 transitions. [2025-02-05 16:27:04,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) 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:27:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25088 states and 39202 transitions. [2025-02-05 16:27:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:27:04,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:04,144 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] [2025-02-05 16:27:04,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:27:04,144 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:04,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:04,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1771529598, now seen corresponding path program 1 times [2025-02-05 16:27:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819762564] [2025-02-05 16:27:04,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:04,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:04,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:27:04,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:27:04,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:04,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:27:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:04,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819762564] [2025-02-05 16:27:04,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819762564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:04,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:04,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:04,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728134813] [2025-02-05 16:27:04,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:04,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:04,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:04,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:04,212 INFO L87 Difference]: Start difference. First operand 25088 states and 39202 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:04,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:04,348 INFO L93 Difference]: Finished difference Result 56471 states and 88351 transitions. [2025-02-05 16:27:04,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:04,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2025-02-05 16:27:04,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:04,419 INFO L225 Difference]: With dead ends: 56471 [2025-02-05 16:27:04,419 INFO L226 Difference]: Without dead ends: 43845 [2025-02-05 16:27:04,443 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:27:04,444 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 96 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:04,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 383 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43845 states. [2025-02-05 16:27:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43845 to 43711. [2025-02-05 16:27:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43711 states, 43710 states have (on average 1.5594600777854037) internal successors, (68164), 43710 states have internal predecessors, (68164), 0 states have call successors, (0), 0 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:27:04,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43711 states to 43711 states and 68164 transitions. [2025-02-05 16:27:04,990 INFO L78 Accepts]: Start accepts. Automaton has 43711 states and 68164 transitions. Word has length 94 [2025-02-05 16:27:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:04,990 INFO L471 AbstractCegarLoop]: Abstraction has 43711 states and 68164 transitions. [2025-02-05 16:27:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43711 states and 68164 transitions. [2025-02-05 16:27:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:27:04,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:04,991 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] [2025-02-05 16:27:04,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:27:04,991 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1641781316, now seen corresponding path program 1 times [2025-02-05 16:27:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:04,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182060436] [2025-02-05 16:27:04,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:04,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:05,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:27:05,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:27:05,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:05,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182060436] [2025-02-05 16:27:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182060436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71517090] [2025-02-05 16:27:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:05,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:05,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:05,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:05,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:05,058 INFO L87 Difference]: Start difference. First operand 43711 states and 68164 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:05,575 INFO L93 Difference]: Finished difference Result 128714 states and 200636 transitions. [2025-02-05 16:27:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:05,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:27:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:05,744 INFO L225 Difference]: With dead ends: 128714 [2025-02-05 16:27:05,745 INFO L226 Difference]: Without dead ends: 85074 [2025-02-05 16:27:05,809 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:27:05,810 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 135 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:05,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 457 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:05,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85074 states. [2025-02-05 16:27:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85074 to 85072. [2025-02-05 16:27:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85072 states, 85071 states have (on average 1.5473780724336144) internal successors, (131637), 85071 states have internal predecessors, (131637), 0 states have call successors, (0), 0 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:27:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85072 states to 85072 states and 131637 transitions. [2025-02-05 16:27:07,289 INFO L78 Accepts]: Start accepts. Automaton has 85072 states and 131637 transitions. Word has length 95 [2025-02-05 16:27:07,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:07,289 INFO L471 AbstractCegarLoop]: Abstraction has 85072 states and 131637 transitions. [2025-02-05 16:27:07,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 85072 states and 131637 transitions. [2025-02-05 16:27:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:27:07,290 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:07,290 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] [2025-02-05 16:27:07,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:27:07,290 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1024262876, now seen corresponding path program 1 times [2025-02-05 16:27:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340254835] [2025-02-05 16:27:07,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:07,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:27:07,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:27:07,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:07,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:27:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:07,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340254835] [2025-02-05 16:27:07,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340254835] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:07,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:07,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:07,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019907145] [2025-02-05 16:27:07,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:07,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:07,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:07,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:07,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:07,354 INFO L87 Difference]: Start difference. First operand 85072 states and 131637 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:08,382 INFO L93 Difference]: Finished difference Result 250379 states and 387212 transitions. [2025-02-05 16:27:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:27:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:08,704 INFO L225 Difference]: With dead ends: 250379 [2025-02-05 16:27:08,704 INFO L226 Difference]: Without dead ends: 165450 [2025-02-05 16:27:08,761 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:27:08,761 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 153 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:08,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 490 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:08,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165450 states. [2025-02-05 16:27:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165450 to 165448. [2025-02-05 16:27:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165448 states, 165447 states have (on average 1.5346304254534684) internal successors, (253900), 165447 states have internal predecessors, (253900), 0 states have call successors, (0), 0 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:27:10,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165448 states to 165448 states and 253900 transitions. [2025-02-05 16:27:10,919 INFO L78 Accepts]: Start accepts. Automaton has 165448 states and 253900 transitions. Word has length 95 [2025-02-05 16:27:10,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:10,919 INFO L471 AbstractCegarLoop]: Abstraction has 165448 states and 253900 transitions. [2025-02-05 16:27:10,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:10,919 INFO L276 IsEmpty]: Start isEmpty. Operand 165448 states and 253900 transitions. [2025-02-05 16:27:10,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:27:10,921 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:10,921 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] [2025-02-05 16:27:10,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:27:10,921 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:10,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:10,922 INFO L85 PathProgramCache]: Analyzing trace with hash -810469977, now seen corresponding path program 1 times [2025-02-05 16:27:10,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:10,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404185492] [2025-02-05 16:27:10,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:10,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:10,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:27:11,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:27:11,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:11,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:11,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:27:11,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:11,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404185492] [2025-02-05 16:27:11,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404185492] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:11,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:11,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:11,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22165695] [2025-02-05 16:27:11,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:11,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:11,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:11,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:11,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:11,492 INFO L87 Difference]: Start difference. First operand 165448 states and 253900 transitions. Second operand has 4 states, 4 states have (on average 24.25) 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:27:12,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:12,114 INFO L93 Difference]: Finished difference Result 254846 states and 392279 transitions. [2025-02-05 16:27:12,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:12,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) 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 98 [2025-02-05 16:27:12,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:12,418 INFO L225 Difference]: With dead ends: 254846 [2025-02-05 16:27:12,419 INFO L226 Difference]: Without dead ends: 182908 [2025-02-05 16:27:12,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:12,510 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 210 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:12,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 640 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:12,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182908 states. [2025-02-05 16:27:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182908 to 181419. [2025-02-05 16:27:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181419 states, 181418 states have (on average 1.5335303001907197) internal successors, (278210), 181418 states have internal predecessors, (278210), 0 states have call successors, (0), 0 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:27:15,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181419 states to 181419 states and 278210 transitions. [2025-02-05 16:27:15,386 INFO L78 Accepts]: Start accepts. Automaton has 181419 states and 278210 transitions. Word has length 98 [2025-02-05 16:27:15,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:15,386 INFO L471 AbstractCegarLoop]: Abstraction has 181419 states and 278210 transitions. [2025-02-05 16:27:15,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) 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:27:15,386 INFO L276 IsEmpty]: Start isEmpty. Operand 181419 states and 278210 transitions. [2025-02-05 16:27:15,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:27:15,387 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:15,387 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:27:15,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:27:15,388 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:15,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:15,388 INFO L85 PathProgramCache]: Analyzing trace with hash 491755877, now seen corresponding path program 1 times [2025-02-05 16:27:15,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:15,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106885197] [2025-02-05 16:27:15,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:15,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:27:15,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:27:15,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:15,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:15,635 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-05 16:27:15,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:15,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106885197] [2025-02-05 16:27:15,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106885197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:15,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:15,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:27:15,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272172482] [2025-02-05 16:27:15,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:15,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:27:15,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:15,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:27:15,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:15,639 INFO L87 Difference]: Start difference. First operand 181419 states and 278210 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:17,613 INFO L93 Difference]: Finished difference Result 705236 states and 1080121 transitions. [2025-02-05 16:27:17,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:27:17,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-02-05 16:27:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:19,222 INFO L225 Difference]: With dead ends: 705236 [2025-02-05 16:27:19,223 INFO L226 Difference]: Without dead ends: 523862 [2025-02-05 16:27:19,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:27:19,331 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 372 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:19,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 670 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:19,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523862 states. [2025-02-05 16:27:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523862 to 352640. [2025-02-05 16:27:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352640 states, 352639 states have (on average 1.5200105490317293) internal successors, (536015), 352639 states have internal predecessors, (536015), 0 states have call successors, (0), 0 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:27:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352640 states to 352640 states and 536015 transitions. [2025-02-05 16:27:25,010 INFO L78 Accepts]: Start accepts. Automaton has 352640 states and 536015 transitions. Word has length 98 [2025-02-05 16:27:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:27:25,010 INFO L471 AbstractCegarLoop]: Abstraction has 352640 states and 536015 transitions. [2025-02-05 16:27:25,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 352640 states and 536015 transitions. [2025-02-05 16:27:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 16:27:25,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:27:25,017 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:27:25,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:27:25,018 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:27:25,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:27:25,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1129511549, now seen corresponding path program 1 times [2025-02-05 16:27:25,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:27:25,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101153095] [2025-02-05 16:27:25,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:27:25,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:27:25,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 16:27:25,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 16:27:25,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:27:25,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:27:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 16:27:25,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:27:25,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101153095] [2025-02-05 16:27:25,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101153095] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:27:25,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:27:25,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:27:25,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871201042] [2025-02-05 16:27:25,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:27:25,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:27:25,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:27:25,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:27:25,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:27:25,066 INFO L87 Difference]: Start difference. First operand 352640 states and 536015 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:27:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:27:28,505 INFO L93 Difference]: Finished difference Result 705234 states and 1071954 transitions. [2025-02-05 16:27:28,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:27:28,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2025-02-05 16:27:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:27:29,205 INFO L225 Difference]: With dead ends: 705234 [2025-02-05 16:27:29,205 INFO L226 Difference]: Without dead ends: 352642 [2025-02-05 16:27:29,330 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:27:29,331 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:27:29,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:27:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352642 states. [2025-02-05 16:27:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352642 to 352642. [2025-02-05 16:27:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352642 states, 352641 states have (on average 1.5200075997969607) internal successors, (536017), 352641 states have internal predecessors, (536017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)