./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.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_opt-floodmax.4.2.ufo.UNBOUNDED.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 a0830d37f242e09defcc4d2d6beb9093926cd5edb365bec0ac48d44d51893439 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:48:57,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:48:57,716 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:48:57,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:48:57,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:48:57,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:48:57,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:48:57,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:48:57,748 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:48:57,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:48:57,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:48:57,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:48:57,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:48:57,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:48:57,749 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:48:57,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:48:57,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:48:57,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:48:57,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:48:57,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:48:57,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:48:57,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:48:57,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:48:57,752 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 -> a0830d37f242e09defcc4d2d6beb9093926cd5edb365bec0ac48d44d51893439 [2025-02-05 16:48:57,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:48:57,965 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:48:57,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:48:57,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:48:57,968 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:48:57,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:48:59,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60bdeed26/c016a0efa2b1420ca84f5da5bd85a63b/FLAG2de99407e [2025-02-05 16:48:59,342 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:48:59,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:48:59,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60bdeed26/c016a0efa2b1420ca84f5da5bd85a63b/FLAG2de99407e [2025-02-05 16:48:59,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/60bdeed26/c016a0efa2b1420ca84f5da5bd85a63b [2025-02-05 16:48:59,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:48:59,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:48:59,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:48:59,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:48:59,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:48:59,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25821b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:48:59, skipping insertion in model container [2025-02-05 16:48:59,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:48:59" (1/1) ... [2025-02-05 16:48:59,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:48:59,866 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_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2025-02-05 16:48:59,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:48:59,931 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:48:59,994 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_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[13826,13839] [2025-02-05 16:49:00,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:49:00,037 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:49:00,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00 WrapperNode [2025-02-05 16:49:00,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:49:00,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:49:00,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:49:00,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:49:00,044 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:49:00" (1/1) ... [2025-02-05 16:49:00,062 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:49:00" (1/1) ... [2025-02-05 16:49:00,124 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1451 [2025-02-05 16:49:00,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:49:00,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:49:00,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:49:00,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:49:00,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,141 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,173 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:49:00,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:49:00,213 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:49:00,214 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:49:00,214 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:49:00,214 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (1/1) ... [2025-02-05 16:49:00,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:49:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:49:00,241 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:49:00,243 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:49:00,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:49:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:49:00,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:49:00,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:49:00,369 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:49:00,371 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:49:01,404 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1400: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:49:01,404 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1235: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:49:01,404 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1070: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:49:01,404 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L905: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:49:01,404 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L575: havoc main_~node3__newmax~0#1; [2025-02-05 16:49:01,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1__newmax~0#1;havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2025-02-05 16:49:01,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L621: havoc main_~node4__newmax~0#1; [2025-02-05 16:49:01,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:49:01,405 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_~node2__newmax~0#1; [2025-02-05 16:49:01,509 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-02-05 16:49:01,509 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:49:01,528 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:49:01,530 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:49:01,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:49:01 BoogieIcfgContainer [2025-02-05 16:49:01,531 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:49:01,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:49:01,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:49:01,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:49:01,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:48:59" (1/3) ... [2025-02-05 16:49:01,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:49:01, skipping insertion in model container [2025-02-05 16:49:01,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:49:00" (2/3) ... [2025-02-05 16:49:01,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2c60b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:49:01, skipping insertion in model container [2025-02-05 16:49:01,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:49:01" (3/3) ... [2025-02-05 16:49:01,542 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:49:01,555 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:49:01,558 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_opt-floodmax.4.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 350 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:49:01,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:49:01,621 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;@157fa460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:49:01,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:49:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 348 states have (on average 1.7873563218390804) internal successors, (622), 349 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 16:49:01,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:01,637 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:01,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:01,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:01,642 INFO L85 PathProgramCache]: Analyzing trace with hash -351713340, now seen corresponding path program 1 times [2025-02-05 16:49:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:01,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-02-05 16:49:01,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:01,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:01,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 16:49:01,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 16:49:01,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:01,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:02,272 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:49:02,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:02,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670948015] [2025-02-05 16:49:02,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670948015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:02,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:02,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:02,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946525874] [2025-02-05 16:49:02,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:02,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:02,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:02,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:02,305 INFO L87 Difference]: Start difference. First operand has 350 states, 348 states have (on average 1.7873563218390804) internal successors, (622), 349 states have internal predecessors, (622), 0 states have call successors, (0), 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 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:02,422 INFO L93 Difference]: Finished difference Result 652 states and 1124 transitions. [2025-02-05 16:49:02,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:02,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2025-02-05 16:49:02,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:02,442 INFO L225 Difference]: With dead ends: 652 [2025-02-05 16:49:02,442 INFO L226 Difference]: Without dead ends: 489 [2025-02-05 16:49:02,448 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:49:02,450 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 266 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:02,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1146 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-02-05 16:49:02,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2025-02-05 16:49:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 485 states have (on average 1.6515463917525772) internal successors, (801), 485 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 801 transitions. [2025-02-05 16:49:02,522 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 801 transitions. Word has length 118 [2025-02-05 16:49:02,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:02,522 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 801 transitions. [2025-02-05 16:49:02,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 801 transitions. [2025-02-05 16:49:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 16:49:02,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:02,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:02,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:49:02,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:02,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:02,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2063950241, now seen corresponding path program 1 times [2025-02-05 16:49:02,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732511790] [2025-02-05 16:49:02,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:02,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 16:49:02,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 16:49:02,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:02,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:02,846 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:49:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:02,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732511790] [2025-02-05 16:49:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732511790] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351192443] [2025-02-05 16:49:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:02,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:02,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:02,850 INFO L87 Difference]: Start difference. First operand 486 states and 801 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:02,902 INFO L93 Difference]: Finished difference Result 1052 states and 1741 transitions. [2025-02-05 16:49:02,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:02,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-02-05 16:49:02,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:02,906 INFO L225 Difference]: With dead ends: 1052 [2025-02-05 16:49:02,906 INFO L226 Difference]: Without dead ends: 759 [2025-02-05 16:49:02,909 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:49:02,910 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 229 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:02,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:02,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2025-02-05 16:49:02,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 755. [2025-02-05 16:49:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 1.6525198938992043) internal successors, (1246), 754 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1246 transitions. [2025-02-05 16:49:02,942 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1246 transitions. Word has length 121 [2025-02-05 16:49:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1246 transitions. [2025-02-05 16:49:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1246 transitions. [2025-02-05 16:49:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 16:49:02,949 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:02,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:02,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:49:02,949 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:02,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:02,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1046751321, now seen corresponding path program 1 times [2025-02-05 16:49:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948868101] [2025-02-05 16:49:02,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:02,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 16:49:03,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 16:49:03,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:03,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:03,155 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:49:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948868101] [2025-02-05 16:49:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948868101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:03,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445401499] [2025-02-05 16:49:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:03,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:03,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:03,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:03,157 INFO L87 Difference]: Start difference. First operand 755 states and 1246 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:03,203 INFO L93 Difference]: Finished difference Result 1839 states and 3040 transitions. [2025-02-05 16:49:03,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:03,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-05 16:49:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:03,211 INFO L225 Difference]: With dead ends: 1839 [2025-02-05 16:49:03,211 INFO L226 Difference]: Without dead ends: 1277 [2025-02-05 16:49:03,212 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:49:03,214 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:03,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1097 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:03,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-05 16:49:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1271. [2025-02-05 16:49:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.6488188976377953) internal successors, (2094), 1270 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2094 transitions. [2025-02-05 16:49:03,257 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2094 transitions. Word has length 124 [2025-02-05 16:49:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:03,259 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2094 transitions. [2025-02-05 16:49:03,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2094 transitions. [2025-02-05 16:49:03,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-05 16:49:03,261 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:03,262 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:49:03,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 166285588, now seen corresponding path program 1 times [2025-02-05 16:49:03,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:03,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342190503] [2025-02-05 16:49:03,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:03,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:03,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-05 16:49:03,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-05 16:49:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:03,466 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:49:03,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:03,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342190503] [2025-02-05 16:49:03,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342190503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:03,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:03,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:03,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657703674] [2025-02-05 16:49:03,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:03,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:03,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:03,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:03,468 INFO L87 Difference]: Start difference. First operand 1271 states and 2094 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:03,519 INFO L93 Difference]: Finished difference Result 3347 states and 5512 transitions. [2025-02-05 16:49:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:03,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-02-05 16:49:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:03,530 INFO L225 Difference]: With dead ends: 3347 [2025-02-05 16:49:03,530 INFO L226 Difference]: Without dead ends: 2269 [2025-02-05 16:49:03,535 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:49:03,536 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 215 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:03,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1098 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2025-02-05 16:49:03,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2259. [2025-02-05 16:49:03,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2258 states have (on average 1.6412754650132861) internal successors, (3706), 2258 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3706 transitions. [2025-02-05 16:49:03,587 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3706 transitions. Word has length 127 [2025-02-05 16:49:03,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:03,587 INFO L471 AbstractCegarLoop]: Abstraction has 2259 states and 3706 transitions. [2025-02-05 16:49:03,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:03,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3706 transitions. [2025-02-05 16:49:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 16:49:03,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:03,590 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:03,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:49:03,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:03,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 687643118, now seen corresponding path program 1 times [2025-02-05 16:49:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:03,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288068340] [2025-02-05 16:49:03,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:03,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 16:49:03,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 16:49:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:03,825 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:49:03,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:03,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288068340] [2025-02-05 16:49:03,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288068340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:03,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:03,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:03,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205159510] [2025-02-05 16:49:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:03,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:03,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:03,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:03,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:03,827 INFO L87 Difference]: Start difference. First operand 2259 states and 3706 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,141 INFO L93 Difference]: Finished difference Result 11839 states and 19570 transitions. [2025-02-05 16:49:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:49:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-02-05 16:49:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,174 INFO L225 Difference]: With dead ends: 11839 [2025-02-05 16:49:04,174 INFO L226 Difference]: Without dead ends: 9773 [2025-02-05 16:49:04,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:49:04,182 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2227 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 5442 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:04,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 5442 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:49:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9773 states. [2025-02-05 16:49:04,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9773 to 4189. [2025-02-05 16:49:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4189 states, 4188 states have (on average 1.6411174785100286) internal successors, (6873), 4188 states have internal predecessors, (6873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 6873 transitions. [2025-02-05 16:49:04,312 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 6873 transitions. Word has length 130 [2025-02-05 16:49:04,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:04,312 INFO L471 AbstractCegarLoop]: Abstraction has 4189 states and 6873 transitions. [2025-02-05 16:49:04,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 6873 transitions. [2025-02-05 16:49:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 16:49:04,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:04,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:04,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:49:04,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:04,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash -155931622, now seen corresponding path program 1 times [2025-02-05 16:49:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114880148] [2025-02-05 16:49:04,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:04,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 16:49:04,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 16:49:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:04,474 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:49:04,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114880148] [2025-02-05 16:49:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114880148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:04,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:04,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075759422] [2025-02-05 16:49:04,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:04,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:04,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:04,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:04,476 INFO L87 Difference]: Start difference. First operand 4189 states and 6873 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:04,591 INFO L93 Difference]: Finished difference Result 12287 states and 20261 transitions. [2025-02-05 16:49:04,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:04,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-02-05 16:49:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:04,659 INFO L225 Difference]: With dead ends: 12287 [2025-02-05 16:49:04,659 INFO L226 Difference]: Without dead ends: 8291 [2025-02-05 16:49:04,662 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:49:04,667 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 752 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1904 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:49:04,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1904 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:04,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2025-02-05 16:49:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 6223. [2025-02-05 16:49:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6223 states, 6222 states have (on average 1.6435229829636773) internal successors, (10226), 6222 states have internal predecessors, (10226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6223 states to 6223 states and 10226 transitions. [2025-02-05 16:49:04,831 INFO L78 Accepts]: Start accepts. Automaton has 6223 states and 10226 transitions. Word has length 131 [2025-02-05 16:49:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 6223 states and 10226 transitions. [2025-02-05 16:49:04,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 6223 states and 10226 transitions. [2025-02-05 16:49:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-05 16:49:04,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:04,835 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:04,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:49:04,836 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:04,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:04,836 INFO L85 PathProgramCache]: Analyzing trace with hash -537034159, now seen corresponding path program 1 times [2025-02-05 16:49:04,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:04,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788708447] [2025-02-05 16:49:04,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:04,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:04,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-05 16:49:04,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-05 16:49:04,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:04,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:05,006 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:49:05,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:05,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788708447] [2025-02-05 16:49:05,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788708447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:05,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:05,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:05,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468447704] [2025-02-05 16:49:05,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:05,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:05,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:05,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:05,009 INFO L87 Difference]: Start difference. First operand 6223 states and 10226 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:05,145 INFO L93 Difference]: Finished difference Result 18285 states and 30121 transitions. [2025-02-05 16:49:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-02-05 16:49:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:05,170 INFO L225 Difference]: With dead ends: 18285 [2025-02-05 16:49:05,171 INFO L226 Difference]: Without dead ends: 12255 [2025-02-05 16:49:05,182 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:49:05,182 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 752 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 1894 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:49:05,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 1894 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12255 states. [2025-02-05 16:49:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12255 to 9215. [2025-02-05 16:49:05,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9215 states, 9214 states have (on average 1.6418493596700674) internal successors, (15128), 9214 states have internal predecessors, (15128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:05,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9215 states to 9215 states and 15128 transitions. [2025-02-05 16:49:05,457 INFO L78 Accepts]: Start accepts. Automaton has 9215 states and 15128 transitions. Word has length 132 [2025-02-05 16:49:05,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:05,457 INFO L471 AbstractCegarLoop]: Abstraction has 9215 states and 15128 transitions. [2025-02-05 16:49:05,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:05,457 INFO L276 IsEmpty]: Start isEmpty. Operand 9215 states and 15128 transitions. [2025-02-05 16:49:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 16:49:05,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:05,462 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:05,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:49:05,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash 533599709, now seen corresponding path program 1 times [2025-02-05 16:49:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895141742] [2025-02-05 16:49:05,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:05,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:05,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 16:49:05,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 16:49:05,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:05,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:05,640 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:49:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895141742] [2025-02-05 16:49:05,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895141742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:05,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:05,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060962762] [2025-02-05 16:49:05,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:05,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:05,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:05,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:05,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:05,643 INFO L87 Difference]: Start difference. First operand 9215 states and 15128 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:05,803 INFO L93 Difference]: Finished difference Result 27109 states and 44609 transitions. [2025-02-05 16:49:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-02-05 16:49:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:05,849 INFO L225 Difference]: With dead ends: 27109 [2025-02-05 16:49:05,850 INFO L226 Difference]: Without dead ends: 18087 [2025-02-05 16:49:05,867 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:49:05,867 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 750 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:05,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1824 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18087 states. [2025-02-05 16:49:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18087 to 13617. [2025-02-05 16:49:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13617 states, 13616 states have (on average 1.640129259694477) internal successors, (22332), 13616 states have internal predecessors, (22332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13617 states to 13617 states and 22332 transitions. [2025-02-05 16:49:06,230 INFO L78 Accepts]: Start accepts. Automaton has 13617 states and 22332 transitions. Word has length 133 [2025-02-05 16:49:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:06,230 INFO L471 AbstractCegarLoop]: Abstraction has 13617 states and 22332 transitions. [2025-02-05 16:49:06,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 13617 states and 22332 transitions. [2025-02-05 16:49:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:49:06,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:06,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:06,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:49:06,237 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:06,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -911119601, now seen corresponding path program 1 times [2025-02-05 16:49:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2460753] [2025-02-05 16:49:06,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:06,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:49:06,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:49:06,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:06,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:06,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:49:06,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:06,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2460753] [2025-02-05 16:49:06,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2460753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:06,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:06,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:06,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177441423] [2025-02-05 16:49:06,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:06,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:06,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:06,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:06,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:06,345 INFO L87 Difference]: Start difference. First operand 13617 states and 22332 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:06,432 INFO L93 Difference]: Finished difference Result 30328 states and 49938 transitions. [2025-02-05 16:49:06,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:06,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:49:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:06,470 INFO L225 Difference]: With dead ends: 30328 [2025-02-05 16:49:06,471 INFO L226 Difference]: Without dead ends: 20901 [2025-02-05 16:49:06,541 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:49:06,542 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 235 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1289 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:49:06,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1289 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2025-02-05 16:49:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 20899. [2025-02-05 16:49:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20899 states, 20898 states have (on average 1.6394870322518902) internal successors, (34262), 20898 states have internal predecessors, (34262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:06,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20899 states to 20899 states and 34262 transitions. [2025-02-05 16:49:06,795 INFO L78 Accepts]: Start accepts. Automaton has 20899 states and 34262 transitions. Word has length 134 [2025-02-05 16:49:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:06,796 INFO L471 AbstractCegarLoop]: Abstraction has 20899 states and 34262 transitions. [2025-02-05 16:49:06,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 20899 states and 34262 transitions. [2025-02-05 16:49:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:49:06,798 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:06,798 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:06,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:49:06,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1154948141, now seen corresponding path program 1 times [2025-02-05 16:49:06,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:06,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726309251] [2025-02-05 16:49:06,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:06,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:06,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:49:06,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:49:06,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:06,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:06,899 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:49:06,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:06,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726309251] [2025-02-05 16:49:06,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726309251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:06,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627638118] [2025-02-05 16:49:06,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:06,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:06,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:06,900 INFO L87 Difference]: Start difference. First operand 20899 states and 34262 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:07,077 INFO L93 Difference]: Finished difference Result 46164 states and 75762 transitions. [2025-02-05 16:49:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:07,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:49:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:07,139 INFO L225 Difference]: With dead ends: 46164 [2025-02-05 16:49:07,139 INFO L226 Difference]: Without dead ends: 31745 [2025-02-05 16:49:07,164 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:49:07,165 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 228 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1264 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:07,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1264 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:07,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31745 states. [2025-02-05 16:49:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31745 to 31743. [2025-02-05 16:49:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31743 states, 31742 states have (on average 1.6347111083107555) internal successors, (51889), 31742 states have internal predecessors, (51889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31743 states to 31743 states and 51889 transitions. [2025-02-05 16:49:07,782 INFO L78 Accepts]: Start accepts. Automaton has 31743 states and 51889 transitions. Word has length 134 [2025-02-05 16:49:07,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:07,783 INFO L471 AbstractCegarLoop]: Abstraction has 31743 states and 51889 transitions. [2025-02-05 16:49:07,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31743 states and 51889 transitions. [2025-02-05 16:49:07,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:49:07,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:07,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:07,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:49:07,785 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:07,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:07,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1703816813, now seen corresponding path program 1 times [2025-02-05 16:49:07,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:07,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202079403] [2025-02-05 16:49:07,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:07,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:07,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:49:07,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:49:07,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:07,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:07,938 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:49:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202079403] [2025-02-05 16:49:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202079403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:07,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522953594] [2025-02-05 16:49:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:07,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:07,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:07,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:07,941 INFO L87 Difference]: Start difference. First operand 31743 states and 51889 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:08,184 INFO L93 Difference]: Finished difference Result 62055 states and 101576 transitions. [2025-02-05 16:49:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:49:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:08,308 INFO L225 Difference]: With dead ends: 62055 [2025-02-05 16:49:08,308 INFO L226 Difference]: Without dead ends: 44529 [2025-02-05 16:49:08,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:08,348 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 214 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1178 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:49:08,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:08,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44529 states. [2025-02-05 16:49:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44529 to 44527. [2025-02-05 16:49:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44527 states, 44526 states have (on average 1.629969006872389) internal successors, (72576), 44526 states have internal predecessors, (72576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:09,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44527 states to 44527 states and 72576 transitions. [2025-02-05 16:49:09,071 INFO L78 Accepts]: Start accepts. Automaton has 44527 states and 72576 transitions. Word has length 134 [2025-02-05 16:49:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:09,071 INFO L471 AbstractCegarLoop]: Abstraction has 44527 states and 72576 transitions. [2025-02-05 16:49:09,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:09,072 INFO L276 IsEmpty]: Start isEmpty. Operand 44527 states and 72576 transitions. [2025-02-05 16:49:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:49:09,073 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:09,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:09,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:49:09,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:09,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:09,073 INFO L85 PathProgramCache]: Analyzing trace with hash -636578124, now seen corresponding path program 1 times [2025-02-05 16:49:09,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:09,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030760608] [2025-02-05 16:49:09,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:09,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:09,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:49:09,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:49:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:09,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:09,190 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:49:09,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:09,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030760608] [2025-02-05 16:49:09,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030760608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:09,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:09,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:49:09,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298707685] [2025-02-05 16:49:09,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:09,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:49:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:09,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:49:09,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:49:09,194 INFO L87 Difference]: Start difference. First operand 44527 states and 72576 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:09,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:09,667 INFO L93 Difference]: Finished difference Result 142153 states and 232072 transitions. [2025-02-05 16:49:09,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:49:09,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:49:09,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:09,891 INFO L225 Difference]: With dead ends: 142153 [2025-02-05 16:49:09,892 INFO L226 Difference]: Without dead ends: 97907 [2025-02-05 16:49:09,937 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:49:09,938 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 748 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 1898 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:49:09,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 1898 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97907 states. [2025-02-05 16:49:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97907 to 71083. [2025-02-05 16:49:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71083 states, 71082 states have (on average 1.6262626262626263) internal successors, (115598), 71082 states have internal predecessors, (115598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:11,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71083 states to 71083 states and 115598 transitions. [2025-02-05 16:49:11,189 INFO L78 Accepts]: Start accepts. Automaton has 71083 states and 115598 transitions. Word has length 134 [2025-02-05 16:49:11,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:11,189 INFO L471 AbstractCegarLoop]: Abstraction has 71083 states and 115598 transitions. [2025-02-05 16:49:11,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 71083 states and 115598 transitions. [2025-02-05 16:49:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:49:11,191 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:11,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:11,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:49:11,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:11,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:11,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1970450225, now seen corresponding path program 1 times [2025-02-05 16:49:11,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:11,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988959111] [2025-02-05 16:49:11,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:11,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:11,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:49:11,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:49:11,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:11,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:11,502 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:49:11,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:11,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988959111] [2025-02-05 16:49:11,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988959111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:11,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:11,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:49:11,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587204619] [2025-02-05 16:49:11,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:11,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:49:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:11,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:49:11,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:49:11,504 INFO L87 Difference]: Start difference. First operand 71083 states and 115598 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:12,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:12,009 INFO L93 Difference]: Finished difference Result 155604 states and 253242 transitions. [2025-02-05 16:49:12,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:49:12,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 134 [2025-02-05 16:49:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:12,229 INFO L225 Difference]: With dead ends: 155604 [2025-02-05 16:49:12,229 INFO L226 Difference]: Without dead ends: 105867 [2025-02-05 16:49:12,277 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:49:12,277 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 221 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1231 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:49:12,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1231 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105867 states. [2025-02-05 16:49:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105867 to 105865. [2025-02-05 16:49:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105865 states, 105864 states have (on average 1.6187655860349128) internal successors, (171369), 105864 states have internal predecessors, (171369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105865 states to 105865 states and 171369 transitions. [2025-02-05 16:49:14,037 INFO L78 Accepts]: Start accepts. Automaton has 105865 states and 171369 transitions. Word has length 134 [2025-02-05 16:49:14,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:14,037 INFO L471 AbstractCegarLoop]: Abstraction has 105865 states and 171369 transitions. [2025-02-05 16:49:14,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:14,037 INFO L276 IsEmpty]: Start isEmpty. Operand 105865 states and 171369 transitions. [2025-02-05 16:49:14,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:49:14,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:14,038 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:14,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:49:14,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:14,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:14,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1814738058, now seen corresponding path program 1 times [2025-02-05 16:49:14,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:14,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730556899] [2025-02-05 16:49:14,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:14,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:14,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:49:14,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:49:14,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:14,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:14,338 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:49:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730556899] [2025-02-05 16:49:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730556899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620564999] [2025-02-05 16:49:14,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:14,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:14,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:14,340 INFO L87 Difference]: Start difference. First operand 105865 states and 171369 transitions. Second operand has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:15,029 INFO L93 Difference]: Finished difference Result 211471 states and 342322 transitions. [2025-02-05 16:49:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2025-02-05 16:49:15,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:15,199 INFO L225 Difference]: With dead ends: 211471 [2025-02-05 16:49:15,199 INFO L226 Difference]: Without dead ends: 105867 [2025-02-05 16:49:15,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:49:15,462 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 437 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2174 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:15,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2174 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105867 states. [2025-02-05 16:49:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105867 to 105865. [2025-02-05 16:49:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105865 states, 105864 states have (on average 1.6128617849316105) internal successors, (170744), 105864 states have internal predecessors, (170744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105865 states to 105865 states and 170744 transitions. [2025-02-05 16:49:17,028 INFO L78 Accepts]: Start accepts. Automaton has 105865 states and 170744 transitions. Word has length 136 [2025-02-05 16:49:17,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:17,028 INFO L471 AbstractCegarLoop]: Abstraction has 105865 states and 170744 transitions. [2025-02-05 16:49:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:17,028 INFO L276 IsEmpty]: Start isEmpty. Operand 105865 states and 170744 transitions. [2025-02-05 16:49:17,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-05 16:49:17,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:17,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:49:17,029 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -720601465, now seen corresponding path program 1 times [2025-02-05 16:49:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:17,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687848533] [2025-02-05 16:49:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:17,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-05 16:49:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-05 16:49:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:17,282 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:49:17,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:17,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687848533] [2025-02-05 16:49:17,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687848533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:17,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214115792] [2025-02-05 16:49:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:17,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:17,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:17,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:17,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:17,284 INFO L87 Difference]: Start difference. First operand 105865 states and 170744 transitions. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:18,333 INFO L93 Difference]: Finished difference Result 309469 states and 499582 transitions. [2025-02-05 16:49:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-02-05 16:49:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:18,670 INFO L225 Difference]: With dead ends: 309469 [2025-02-05 16:49:18,670 INFO L226 Difference]: Without dead ends: 203865 [2025-02-05 16:49:18,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:49:18,744 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 863 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:18,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 2183 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203865 states. [2025-02-05 16:49:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203865 to 203863. [2025-02-05 16:49:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203863 states, 203862 states have (on average 1.6051888041910705) internal successors, (327237), 203862 states have internal predecessors, (327237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203863 states to 203863 states and 327237 transitions. [2025-02-05 16:49:21,615 INFO L78 Accepts]: Start accepts. Automaton has 203863 states and 327237 transitions. Word has length 139 [2025-02-05 16:49:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 203863 states and 327237 transitions. [2025-02-05 16:49:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 203863 states and 327237 transitions. [2025-02-05 16:49:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 16:49:21,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:21,624 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:21,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:49:21,624 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:21,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash -862853629, now seen corresponding path program 1 times [2025-02-05 16:49:21,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:21,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057526016] [2025-02-05 16:49:21,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:21,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:21,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 16:49:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 16:49:21,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:21,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:49:22,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:22,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057526016] [2025-02-05 16:49:22,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057526016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:22,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:22,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:49:22,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857063450] [2025-02-05 16:49:22,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:22,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:49:22,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:22,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:49:22,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:49:22,367 INFO L87 Difference]: Start difference. First operand 203863 states and 327237 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:22,986 INFO L93 Difference]: Finished difference Result 207737 states and 333046 transitions. [2025-02-05 16:49:22,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:49:22,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2025-02-05 16:49:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:23,357 INFO L225 Difference]: With dead ends: 207737 [2025-02-05 16:49:23,357 INFO L226 Difference]: Without dead ends: 207735 [2025-02-05 16:49:23,444 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:49:23,445 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 0 mSDsluCounter, 1690 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2259 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:49:23,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2259 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:49:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207735 states. [2025-02-05 16:49:25,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207735 to 207735. [2025-02-05 16:49:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207735 states, 207734 states have (on average 1.5937785822253459) internal successors, (331082), 207734 states have internal predecessors, (331082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:26,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207735 states to 207735 states and 331082 transitions. [2025-02-05 16:49:26,417 INFO L78 Accepts]: Start accepts. Automaton has 207735 states and 331082 transitions. Word has length 140 [2025-02-05 16:49:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:26,417 INFO L471 AbstractCegarLoop]: Abstraction has 207735 states and 331082 transitions. [2025-02-05 16:49:26,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 207735 states and 331082 transitions. [2025-02-05 16:49:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 16:49:26,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:26,422 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:26,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:49:26,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:26,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:26,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2044462286, now seen corresponding path program 1 times [2025-02-05 16:49:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584092417] [2025-02-05 16:49:26,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:26,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:26,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:49:26,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:49:26,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:26,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:49:26,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:26,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584092417] [2025-02-05 16:49:26,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584092417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:26,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:26,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:26,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483101835] [2025-02-05 16:49:26,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:26,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:26,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:26,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:26,609 INFO L87 Difference]: Start difference. First operand 207735 states and 331082 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:28,912 INFO L93 Difference]: Finished difference Result 566807 states and 905943 transitions. [2025-02-05 16:49:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 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 176 [2025-02-05 16:49:28,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:29,871 INFO L225 Difference]: With dead ends: 566807 [2025-02-05 16:49:29,871 INFO L226 Difference]: Without dead ends: 474405 [2025-02-05 16:49:30,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:49:30,021 INFO L435 NwaCegarLoop]: 816 mSDtfsCounter, 1691 mSDsluCounter, 2388 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:30,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3204 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:49:30,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474405 states. [2025-02-05 16:49:34,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474405 to 334001. [2025-02-05 16:49:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334001 states, 334000 states have (on average 1.5922275449101797) internal successors, (531804), 334000 states have internal predecessors, (531804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334001 states to 334001 states and 531804 transitions. [2025-02-05 16:49:36,139 INFO L78 Accepts]: Start accepts. Automaton has 334001 states and 531804 transitions. Word has length 176 [2025-02-05 16:49:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:49:36,139 INFO L471 AbstractCegarLoop]: Abstraction has 334001 states and 531804 transitions. [2025-02-05 16:49:36,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 334001 states and 531804 transitions. [2025-02-05 16:49:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-02-05 16:49:36,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:49:36,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:49:36,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:49:36,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:49:36,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:49:36,152 INFO L85 PathProgramCache]: Analyzing trace with hash 21605456, now seen corresponding path program 1 times [2025-02-05 16:49:36,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:49:36,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497505385] [2025-02-05 16:49:36,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:49:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:49:36,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-02-05 16:49:36,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-02-05 16:49:36,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:49:36,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:49:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:49:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:49:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497505385] [2025-02-05 16:49:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497505385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:49:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:49:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:49:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519488398] [2025-02-05 16:49:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:49:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:49:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:49:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:49:36,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:49:36,368 INFO L87 Difference]: Start difference. First operand 334001 states and 531804 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:49:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:49:38,502 INFO L93 Difference]: Finished difference Result 637753 states and 1019459 transitions. [2025-02-05 16:49:38,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:49:38,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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 176 [2025-02-05 16:49:38,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:49:39,491 INFO L225 Difference]: With dead ends: 637753 [2025-02-05 16:49:39,491 INFO L226 Difference]: Without dead ends: 546501 [2025-02-05 16:49:39,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:49:39,678 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1683 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:49:39,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 3121 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:49:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546501 states.