./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-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 169d16a82e2efb21b41720aab8fadcf5ecf67324651e69e91d6cb4f921e3dcd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:36:06,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:36:06,803 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:36:06,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:36:06,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:36:06,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:36:06,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:36:06,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:36:06,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:36:06,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:36:06,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:36:06,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:36:06,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:36:06,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:36:06,839 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:36:06,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:36:06,840 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:36:06,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:36:06,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:36:06,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:36:06,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:36:06,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:36:06,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:36:06,841 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 -> 169d16a82e2efb21b41720aab8fadcf5ecf67324651e69e91d6cb4f921e3dcd4 [2025-02-05 16:36:07,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:36:07,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:36:07,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:36:07,140 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:36:07,140 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:36:07,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-02-05 16:36:08,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41918bdb8/57aea72b47d04f02bad149f82a56a4d0/FLAG93416d380 [2025-02-05 16:36:08,794 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:36:08,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-02-05 16:36:08,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41918bdb8/57aea72b47d04f02bad149f82a56a4d0/FLAG93416d380 [2025-02-05 16:36:08,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/41918bdb8/57aea72b47d04f02bad149f82a56a4d0 [2025-02-05 16:36:08,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:36:08,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:36:08,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:08,833 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:36:08,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:36:08,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:08" (1/1) ... [2025-02-05 16:36:08,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f9667da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:08, skipping insertion in model container [2025-02-05 16:36:08,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:36:08" (1/1) ... [2025-02-05 16:36:08,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:36:09,116 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[13215,13228] [2025-02-05 16:36:09,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:09,207 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:36:09,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[13215,13228] [2025-02-05 16:36:09,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:36:09,344 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:36:09,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09 WrapperNode [2025-02-05 16:36:09,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:36:09,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:36:09,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:36:09,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:36:09,352 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:36:09" (1/1) ... [2025-02-05 16:36:09,365 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:36:09" (1/1) ... [2025-02-05 16:36:09,415 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1437 [2025-02-05 16:36:09,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:36:09,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:36:09,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:36:09,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:36:09,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,426 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,464 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:36:09,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,486 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:36:09,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:36:09,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:36:09,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:36:09,514 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (1/1) ... [2025-02-05 16:36:09,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:36:09,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:36:09,547 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:36:09,551 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:36:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:36:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:36:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:36:09,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:36:09,709 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:36:09,711 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:36:11,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L993: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:11,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L267: havoc main_~node3__m3~0#1; [2025-02-05 16:36:11,007 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1225: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1656: havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1425: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L633: havoc main_~node2__m2~3#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L303: havoc main_~node5__m5~0#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2087: havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1856: havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L965: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L503: havoc main_~node2__m2~2#1; [2025-02-05 16:36:11,008 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2287: havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L669: havoc main_~node4__m4~3#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1397: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node4__m4~2#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1828: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L376: havoc main_~node2__m2~1#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2259: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:36:11,009 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1137: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L907: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L412: havoc main_~node4__m4~1#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1569: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1339: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L249: havoc main_~node2__m2~0#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2000: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1770: havoc main_~node4____CPAchecker_TMP_1~2#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2431: havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L879: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L285: havoc main_~node4__m4~0#1; [2025-02-05 16:36:11,010 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2201: havoc main_~node4____CPAchecker_TMP_1~3#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1079: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1311: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc main_~node3__m3~3#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1511: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L521: havoc main_~node3__m3~2#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2173: havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1942: havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L687: havoc main_~node5__m5~3#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1051: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2373: havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L821: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L557: havoc main_~node5__m5~2#1; [2025-02-05 16:36:11,011 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1483: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L394: havoc main_~node3__m3~1#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1684: havoc main_~node5____CPAchecker_TMP_1~2#1; [2025-02-05 16:36:11,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2345: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:36:11,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L793: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-02-05 16:36:11,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L430: havoc main_~node5__m5~1#1; [2025-02-05 16:36:11,013 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2115: havoc main_~node5____CPAchecker_TMP_1~3#1; [2025-02-05 16:36:11,114 INFO L? ?]: Removed 190 outVars from TransFormulas that were not future-live. [2025-02-05 16:36:11,115 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:36:11,143 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:36:11,144 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:36:11,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:36:11 BoogieIcfgContainer [2025-02-05 16:36:11,145 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:36:11,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:36:11,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:36:11,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:36:11,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:36:08" (1/3) ... [2025-02-05 16:36:11,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d034e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:36:11, skipping insertion in model container [2025-02-05 16:36:11,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:36:09" (2/3) ... [2025-02-05 16:36:11,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5d034e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:36:11, skipping insertion in model container [2025-02-05 16:36:11,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:36:11" (3/3) ... [2025-02-05 16:36:11,153 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-02-05 16:36:11,168 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:36:11,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c that has 1 procedures, 406 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:36:11,249 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:36:11,263 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;@37de5805, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:36:11,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:36:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 406 states, 404 states have (on average 1.6485148514851484) internal successors, (666), 405 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:11,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 16:36:11,288 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:11,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:11,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:11,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:11,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2086308443, now seen corresponding path program 1 times [2025-02-05 16:36:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996493144] [2025-02-05 16:36:11,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:11,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:11,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 16:36:11,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 16:36:11,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:11,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:11,882 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:36:11,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996493144] [2025-02-05 16:36:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996493144] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:36:11,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321617791] [2025-02-05 16:36:11,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 16:36:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:11,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 16:36:11,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:36:11,910 INFO L87 Difference]: Start difference. First operand has 406 states, 404 states have (on average 1.6485148514851484) internal successors, (666), 405 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:12,108 INFO L93 Difference]: Finished difference Result 779 states and 1267 transitions. [2025-02-05 16:36:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 16:36:12,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 16:36:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:12,123 INFO L225 Difference]: With dead ends: 779 [2025-02-05 16:36:12,124 INFO L226 Difference]: Without dead ends: 403 [2025-02-05 16:36:12,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 16:36:12,129 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 146 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1789 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:12,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1789 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-02-05 16:36:12,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-02-05 16:36:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 1.5497512437810945) internal successors, (623), 402 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 623 transitions. [2025-02-05 16:36:12,195 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 623 transitions. Word has length 103 [2025-02-05 16:36:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:12,196 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 623 transitions. [2025-02-05 16:36:12,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 623 transitions. [2025-02-05 16:36:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 16:36:12,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:12,202 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:36:12,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:36:12,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:12,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:12,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1623728130, now seen corresponding path program 1 times [2025-02-05 16:36:12,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:12,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758742518] [2025-02-05 16:36:12,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:12,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:12,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 16:36:12,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 16:36:12,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:12,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:12,471 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:36:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:12,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758742518] [2025-02-05 16:36:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758742518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:12,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636909917] [2025-02-05 16:36:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:12,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:12,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:12,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:12,478 INFO L87 Difference]: Start difference. First operand 403 states and 623 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:36:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:12,559 INFO L93 Difference]: Finished difference Result 952 states and 1499 transitions. [2025-02-05 16:36:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:12,561 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:36:12,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:12,567 INFO L225 Difference]: With dead ends: 952 [2025-02-05 16:36:12,567 INFO L226 Difference]: Without dead ends: 611 [2025-02-05 16:36:12,569 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:36:12,570 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 419 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:12,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1096 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:36:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-02-05 16:36:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2025-02-05 16:36:12,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 1.5608552631578947) internal successors, (949), 608 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 949 transitions. [2025-02-05 16:36:12,619 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 949 transitions. Word has length 134 [2025-02-05 16:36:12,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:12,619 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 949 transitions. [2025-02-05 16:36:12,619 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:36:12,619 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 949 transitions. [2025-02-05 16:36:12,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-02-05 16:36:12,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:12,621 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:36:12,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:36:12,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:12,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:12,622 INFO L85 PathProgramCache]: Analyzing trace with hash -507882956, now seen corresponding path program 1 times [2025-02-05 16:36:12,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:12,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683929663] [2025-02-05 16:36:12,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:12,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:12,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-02-05 16:36:12,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-02-05 16:36:12,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:12,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:12,812 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:36:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683929663] [2025-02-05 16:36:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683929663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:12,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810484819] [2025-02-05 16:36:12,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:12,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:12,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:12,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:12,815 INFO L87 Difference]: Start difference. First operand 609 states and 949 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:36:12,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:12,878 INFO L93 Difference]: Finished difference Result 1494 states and 2358 transitions. [2025-02-05 16:36:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:12,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:36:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:12,883 INFO L225 Difference]: With dead ends: 1494 [2025-02-05 16:36:12,884 INFO L226 Difference]: Without dead ends: 960 [2025-02-05 16:36:12,885 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:36:12,888 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 404 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:12,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1061 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2025-02-05 16:36:12,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 958. [2025-02-05 16:36:12,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.5663531870428422) internal successors, (1499), 957 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1499 transitions. [2025-02-05 16:36:12,925 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1499 transitions. Word has length 136 [2025-02-05 16:36:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:12,925 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1499 transitions. [2025-02-05 16:36:12,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 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:36:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1499 transitions. [2025-02-05 16:36:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 16:36:12,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:12,930 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] [2025-02-05 16:36:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:36:12,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 300535498, now seen corresponding path program 1 times [2025-02-05 16:36:12,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:12,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497927140] [2025-02-05 16:36:12,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:12,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:12,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 16:36:12,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 16:36:12,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:12,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:13,099 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:36:13,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:13,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497927140] [2025-02-05 16:36:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497927140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:13,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139293183] [2025-02-05 16:36:13,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:13,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:13,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:13,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:13,101 INFO L87 Difference]: Start difference. First operand 958 states and 1499 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:13,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:13,157 INFO L93 Difference]: Finished difference Result 2397 states and 3779 transitions. [2025-02-05 16:36:13,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2025-02-05 16:36:13,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:13,166 INFO L225 Difference]: With dead ends: 2397 [2025-02-05 16:36:13,166 INFO L226 Difference]: Without dead ends: 1527 [2025-02-05 16:36:13,168 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:36:13,170 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 388 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:13,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1146 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2025-02-05 16:36:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1525. [2025-02-05 16:36:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.56496062992126) internal successors, (2385), 1524 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:13,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2385 transitions. [2025-02-05 16:36:13,219 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2385 transitions. Word has length 138 [2025-02-05 16:36:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:13,219 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2385 transitions. [2025-02-05 16:36:13,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2385 transitions. [2025-02-05 16:36:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-05 16:36:13,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:13,226 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:36:13,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:36:13,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:13,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 914399348, now seen corresponding path program 1 times [2025-02-05 16:36:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:13,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619783953] [2025-02-05 16:36:13,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-05 16:36:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-05 16:36:13,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:13,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:13,377 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:36:13,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:13,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619783953] [2025-02-05 16:36:13,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619783953] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:13,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:13,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:13,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219647940] [2025-02-05 16:36:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:13,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:13,379 INFO L87 Difference]: Start difference. First operand 1525 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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:36:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:13,447 INFO L93 Difference]: Finished difference Result 3818 states and 5988 transitions. [2025-02-05 16:36:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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:36:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:13,458 INFO L225 Difference]: With dead ends: 3818 [2025-02-05 16:36:13,458 INFO L226 Difference]: Without dead ends: 2394 [2025-02-05 16:36:13,461 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:36:13,462 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 374 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:13,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 991 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states. [2025-02-05 16:36:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 2392. [2025-02-05 16:36:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2392 states, 2391 states have (on average 1.5554161438728566) internal successors, (3719), 2391 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 3719 transitions. [2025-02-05 16:36:13,530 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 3719 transitions. Word has length 140 [2025-02-05 16:36:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:13,530 INFO L471 AbstractCegarLoop]: Abstraction has 2392 states and 3719 transitions. [2025-02-05 16:36:13,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 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:36:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 3719 transitions. [2025-02-05 16:36:13,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-02-05 16:36:13,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:13,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:13,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:36:13,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:13,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:13,538 INFO L85 PathProgramCache]: Analyzing trace with hash 944662166, now seen corresponding path program 1 times [2025-02-05 16:36:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047423018] [2025-02-05 16:36:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-05 16:36:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-05 16:36:13,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:13,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:13,838 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:36:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047423018] [2025-02-05 16:36:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047423018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494386986] [2025-02-05 16:36:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:13,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:13,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:13,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:13,843 INFO L87 Difference]: Start difference. First operand 2392 states and 3719 transitions. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:14,248 INFO L93 Difference]: Finished difference Result 14072 states and 21897 transitions. [2025-02-05 16:36:14,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2025-02-05 16:36:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:14,297 INFO L225 Difference]: With dead ends: 14072 [2025-02-05 16:36:14,298 INFO L226 Difference]: Without dead ends: 11785 [2025-02-05 16:36:14,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:14,308 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 4935 mSDsluCounter, 4993 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 5584 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:14,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 5584 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11785 states. [2025-02-05 16:36:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11785 to 4734. [2025-02-05 16:36:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 4733 states have (on average 1.5387703359391507) internal successors, (7283), 4733 states have internal predecessors, (7283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 7283 transitions. [2025-02-05 16:36:14,567 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 7283 transitions. Word has length 142 [2025-02-05 16:36:14,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:14,569 INFO L471 AbstractCegarLoop]: Abstraction has 4734 states and 7283 transitions. [2025-02-05 16:36:14,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 7283 transitions. [2025-02-05 16:36:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 16:36:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:14,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:14,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:36:14,581 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:14,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 677335466, now seen corresponding path program 1 times [2025-02-05 16:36:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585147226] [2025-02-05 16:36:14,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:14,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 16:36:14,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 16:36:14,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:14,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:14,696 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:36:14,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:14,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585147226] [2025-02-05 16:36:14,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585147226] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:14,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:14,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:14,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111671752] [2025-02-05 16:36:14,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:14,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:14,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:14,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:14,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:14,698 INFO L87 Difference]: Start difference. First operand 4734 states and 7283 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:14,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:14,791 INFO L93 Difference]: Finished difference Result 13106 states and 20134 transitions. [2025-02-05 16:36:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:14,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2025-02-05 16:36:14,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:14,827 INFO L225 Difference]: With dead ends: 13106 [2025-02-05 16:36:14,827 INFO L226 Difference]: Without dead ends: 8416 [2025-02-05 16:36:14,837 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:36:14,838 INFO L435 NwaCegarLoop]: 823 mSDtfsCounter, 413 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:14,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1316 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2025-02-05 16:36:14,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 8414. [2025-02-05 16:36:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8414 states, 8413 states have (on average 1.5253773921312255) internal successors, (12833), 8413 states have internal predecessors, (12833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8414 states to 8414 states and 12833 transitions. [2025-02-05 16:36:15,049 INFO L78 Accepts]: Start accepts. Automaton has 8414 states and 12833 transitions. Word has length 145 [2025-02-05 16:36:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:15,050 INFO L471 AbstractCegarLoop]: Abstraction has 8414 states and 12833 transitions. [2025-02-05 16:36:15,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 8414 states and 12833 transitions. [2025-02-05 16:36:15,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:36:15,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:15,068 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:15,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:36:15,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:15,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:15,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1685681198, now seen corresponding path program 1 times [2025-02-05 16:36:15,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:15,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109595533] [2025-02-05 16:36:15,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:15,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:36:15,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:36:15,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:15,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:15,219 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:36:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:15,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109595533] [2025-02-05 16:36:15,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109595533] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:15,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:15,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:15,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195465569] [2025-02-05 16:36:15,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:15,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:15,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:15,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:15,221 INFO L87 Difference]: Start difference. First operand 8414 states and 12833 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:15,361 INFO L93 Difference]: Finished difference Result 24239 states and 36920 transitions. [2025-02-05 16:36:15,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 16:36:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:15,402 INFO L225 Difference]: With dead ends: 24239 [2025-02-05 16:36:15,402 INFO L226 Difference]: Without dead ends: 15971 [2025-02-05 16:36:15,416 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:36:15,417 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 449 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:15,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1087 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15971 states. [2025-02-05 16:36:15,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15971 to 15969. [2025-02-05 16:36:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15969 states, 15968 states have (on average 1.5127129258517034) internal successors, (24155), 15968 states have internal predecessors, (24155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15969 states to 15969 states and 24155 transitions. [2025-02-05 16:36:15,841 INFO L78 Accepts]: Start accepts. Automaton has 15969 states and 24155 transitions. Word has length 146 [2025-02-05 16:36:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:15,842 INFO L471 AbstractCegarLoop]: Abstraction has 15969 states and 24155 transitions. [2025-02-05 16:36:15,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 15969 states and 24155 transitions. [2025-02-05 16:36:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:36:15,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:15,873 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:15,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:36:15,874 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:15,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:15,874 INFO L85 PathProgramCache]: Analyzing trace with hash 940923732, now seen corresponding path program 1 times [2025-02-05 16:36:15,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862012481] [2025-02-05 16:36:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:15,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:36:15,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:36:15,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:15,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:15,992 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:36:15,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:15,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862012481] [2025-02-05 16:36:15,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862012481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:15,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:15,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:15,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224883036] [2025-02-05 16:36:15,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:15,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:15,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:15,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:15,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:15,995 INFO L87 Difference]: Start difference. First operand 15969 states and 24155 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:16,211 INFO L93 Difference]: Finished difference Result 45751 states and 69018 transitions. [2025-02-05 16:36:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:16,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 16:36:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:16,284 INFO L225 Difference]: With dead ends: 45751 [2025-02-05 16:36:16,284 INFO L226 Difference]: Without dead ends: 30164 [2025-02-05 16:36:16,312 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:36:16,313 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 431 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:16,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1087 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30164 states. [2025-02-05 16:36:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30164 to 30162. [2025-02-05 16:36:16,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30162 states, 30161 states have (on average 1.497132057955638) internal successors, (45155), 30161 states have internal predecessors, (45155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30162 states to 30162 states and 45155 transitions. [2025-02-05 16:36:17,084 INFO L78 Accepts]: Start accepts. Automaton has 30162 states and 45155 transitions. Word has length 146 [2025-02-05 16:36:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:17,084 INFO L471 AbstractCegarLoop]: Abstraction has 30162 states and 45155 transitions. [2025-02-05 16:36:17,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 30162 states and 45155 transitions. [2025-02-05 16:36:17,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:36:17,139 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:17,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:17,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:36:17,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:17,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:17,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1586442912, now seen corresponding path program 1 times [2025-02-05 16:36:17,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:17,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695241067] [2025-02-05 16:36:17,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:17,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:17,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:36:17,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:36:17,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:17,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:36:17,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695241067] [2025-02-05 16:36:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695241067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:17,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001486057] [2025-02-05 16:36:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:17,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:17,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:17,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:17,240 INFO L87 Difference]: Start difference. First operand 30162 states and 45155 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:17,586 INFO L93 Difference]: Finished difference Result 83119 states and 123542 transitions. [2025-02-05 16:36:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 16:36:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:17,735 INFO L225 Difference]: With dead ends: 83119 [2025-02-05 16:36:17,735 INFO L226 Difference]: Without dead ends: 55896 [2025-02-05 16:36:17,781 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:36:17,782 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 395 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:17,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1087 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:17,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55896 states. [2025-02-05 16:36:18,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55896 to 55894. [2025-02-05 16:36:18,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55894 states, 55893 states have (on average 1.4736192367559444) internal successors, (82365), 55893 states have internal predecessors, (82365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55894 states to 55894 states and 82365 transitions. [2025-02-05 16:36:19,223 INFO L78 Accepts]: Start accepts. Automaton has 55894 states and 82365 transitions. Word has length 146 [2025-02-05 16:36:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:19,223 INFO L471 AbstractCegarLoop]: Abstraction has 55894 states and 82365 transitions. [2025-02-05 16:36:19,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55894 states and 82365 transitions. [2025-02-05 16:36:19,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 16:36:19,303 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:19,304 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:19,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:36:19,304 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:19,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1927261017, now seen corresponding path program 1 times [2025-02-05 16:36:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883021193] [2025-02-05 16:36:19,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:19,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 16:36:19,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 16:36:19,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:19,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:19,722 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:36:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883021193] [2025-02-05 16:36:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883021193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:19,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:19,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:19,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956380187] [2025-02-05 16:36:19,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:19,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:19,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:19,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:19,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:19,726 INFO L87 Difference]: Start difference. First operand 55894 states and 82365 transitions. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:20,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:20,467 INFO L93 Difference]: Finished difference Result 126235 states and 183139 transitions. [2025-02-05 16:36:20,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:20,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 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 146 [2025-02-05 16:36:20,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:20,723 INFO L225 Difference]: With dead ends: 126235 [2025-02-05 16:36:20,723 INFO L226 Difference]: Without dead ends: 87621 [2025-02-05 16:36:20,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:20,809 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 4150 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4150 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:20,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4150 Valid, 2242 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:36:20,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87621 states. [2025-02-05 16:36:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87621 to 82503. [2025-02-05 16:36:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82503 states, 82502 states have (on average 1.444280138663305) internal successors, (119156), 82502 states have internal predecessors, (119156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82503 states to 82503 states and 119156 transitions. [2025-02-05 16:36:22,338 INFO L78 Accepts]: Start accepts. Automaton has 82503 states and 119156 transitions. Word has length 146 [2025-02-05 16:36:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:22,338 INFO L471 AbstractCegarLoop]: Abstraction has 82503 states and 119156 transitions. [2025-02-05 16:36:22,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 82503 states and 119156 transitions. [2025-02-05 16:36:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:36:22,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:22,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:22,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:36:22,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:22,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:22,474 INFO L85 PathProgramCache]: Analyzing trace with hash -205902520, now seen corresponding path program 1 times [2025-02-05 16:36:22,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:22,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702423238] [2025-02-05 16:36:22,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:22,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:36:22,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:36:22,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:22,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:22,807 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:36:22,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:22,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702423238] [2025-02-05 16:36:22,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702423238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:22,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060981129] [2025-02-05 16:36:22,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:22,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:22,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:22,809 INFO L87 Difference]: Start difference. First operand 82503 states and 119156 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:24,051 INFO L93 Difference]: Finished difference Result 182734 states and 266181 transitions. [2025-02-05 16:36:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:36:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:24,332 INFO L225 Difference]: With dead ends: 182734 [2025-02-05 16:36:24,332 INFO L226 Difference]: Without dead ends: 162019 [2025-02-05 16:36:24,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:24,367 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 3830 mSDsluCounter, 3251 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3830 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:24,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3830 Valid, 4155 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162019 states. [2025-02-05 16:36:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162019 to 105980. [2025-02-05 16:36:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105980 states, 105979 states have (on average 1.4436539314392474) internal successors, (152997), 105979 states have internal predecessors, (152997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105980 states to 105980 states and 152997 transitions. [2025-02-05 16:36:26,573 INFO L78 Accepts]: Start accepts. Automaton has 105980 states and 152997 transitions. Word has length 149 [2025-02-05 16:36:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:26,574 INFO L471 AbstractCegarLoop]: Abstraction has 105980 states and 152997 transitions. [2025-02-05 16:36:26,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:26,574 INFO L276 IsEmpty]: Start isEmpty. Operand 105980 states and 152997 transitions. [2025-02-05 16:36:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:36:26,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:26,708 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:26,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:36:26,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:26,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 815842083, now seen corresponding path program 1 times [2025-02-05 16:36:26,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:26,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523847327] [2025-02-05 16:36:26,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:26,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:26,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:36:26,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:36:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:26,821 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:36:26,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:26,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523847327] [2025-02-05 16:36:26,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523847327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:26,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:26,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:26,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448367445] [2025-02-05 16:36:26,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:26,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:26,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:26,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:26,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:26,824 INFO L87 Difference]: Start difference. First operand 105980 states and 152997 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:27,517 INFO L93 Difference]: Finished difference Result 132493 states and 190977 transitions. [2025-02-05 16:36:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:27,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:36:27,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:27,697 INFO L225 Difference]: With dead ends: 132493 [2025-02-05 16:36:27,697 INFO L226 Difference]: Without dead ends: 98494 [2025-02-05 16:36:27,762 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:36:27,763 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 407 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:27,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1504 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98494 states. [2025-02-05 16:36:29,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98494 to 98460. [2025-02-05 16:36:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98460 states, 98459 states have (on average 1.4322205181852345) internal successors, (141015), 98459 states have internal predecessors, (141015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98460 states to 98460 states and 141015 transitions. [2025-02-05 16:36:29,645 INFO L78 Accepts]: Start accepts. Automaton has 98460 states and 141015 transitions. Word has length 149 [2025-02-05 16:36:29,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:29,645 INFO L471 AbstractCegarLoop]: Abstraction has 98460 states and 141015 transitions. [2025-02-05 16:36:29,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 98460 states and 141015 transitions. [2025-02-05 16:36:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:36:29,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:29,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:36:29,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:29,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1343826776, now seen corresponding path program 1 times [2025-02-05 16:36:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186870905] [2025-02-05 16:36:29,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:29,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:29,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:36:29,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:36:29,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:29,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:29,984 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:36:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186870905] [2025-02-05 16:36:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186870905] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621973882] [2025-02-05 16:36:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:29,987 INFO L87 Difference]: Start difference. First operand 98460 states and 141015 transitions. Second operand has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:31,030 INFO L93 Difference]: Finished difference Result 192586 states and 277926 transitions. [2025-02-05 16:36:31,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:31,031 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:36:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:31,231 INFO L225 Difference]: With dead ends: 192586 [2025-02-05 16:36:31,231 INFO L226 Difference]: Without dead ends: 169151 [2025-02-05 16:36:31,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:31,277 INFO L435 NwaCegarLoop]: 932 mSDtfsCounter, 3989 mSDsluCounter, 2969 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3989 SdHoareTripleChecker+Valid, 3901 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:31,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3989 Valid, 3901 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:36:31,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169151 states. [2025-02-05 16:36:33,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169151 to 125409. [2025-02-05 16:36:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125409 states, 125408 states have (on average 1.4320139066088289) internal successors, (179586), 125408 states have internal predecessors, (179586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125409 states to 125409 states and 179586 transitions. [2025-02-05 16:36:33,638 INFO L78 Accepts]: Start accepts. Automaton has 125409 states and 179586 transitions. Word has length 149 [2025-02-05 16:36:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:33,639 INFO L471 AbstractCegarLoop]: Abstraction has 125409 states and 179586 transitions. [2025-02-05 16:36:33,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.285714285714285) internal successors, (149), 7 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 125409 states and 179586 transitions. [2025-02-05 16:36:33,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-02-05 16:36:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:33,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:33,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:36:33,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:33,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:33,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1168878669, now seen corresponding path program 1 times [2025-02-05 16:36:33,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:33,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892258035] [2025-02-05 16:36:33,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:33,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-02-05 16:36:33,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-02-05 16:36:33,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:33,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:33,935 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:36:33,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:33,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892258035] [2025-02-05 16:36:33,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892258035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598505263] [2025-02-05 16:36:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:33,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:33,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:33,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:33,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:33,938 INFO L87 Difference]: Start difference. First operand 125409 states and 179586 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:34,832 INFO L93 Difference]: Finished difference Result 167212 states and 239026 transitions. [2025-02-05 16:36:34,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:34,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-02-05 16:36:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:34,971 INFO L225 Difference]: With dead ends: 167212 [2025-02-05 16:36:34,972 INFO L226 Difference]: Without dead ends: 115137 [2025-02-05 16:36:34,998 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:36:34,999 INFO L435 NwaCegarLoop]: 1005 mSDtfsCounter, 426 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:34,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1523 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115137 states. [2025-02-05 16:36:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115137 to 115090. [2025-02-05 16:36:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115090 states, 115089 states have (on average 1.4210915030976028) internal successors, (163552), 115089 states have internal predecessors, (163552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115090 states to 115090 states and 163552 transitions. [2025-02-05 16:36:37,050 INFO L78 Accepts]: Start accepts. Automaton has 115090 states and 163552 transitions. Word has length 149 [2025-02-05 16:36:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:37,050 INFO L471 AbstractCegarLoop]: Abstraction has 115090 states and 163552 transitions. [2025-02-05 16:36:37,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 115090 states and 163552 transitions. [2025-02-05 16:36:37,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:36:37,149 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:37,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:37,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:36:37,150 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:37,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2141284632, now seen corresponding path program 1 times [2025-02-05 16:36:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896296734] [2025-02-05 16:36:37,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:37,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:36:37,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:36:37,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:37,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:37,229 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:36:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896296734] [2025-02-05 16:36:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896296734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:37,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398539931] [2025-02-05 16:36:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:37,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:37,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:37,233 INFO L87 Difference]: Start difference. First operand 115090 states and 163552 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:38,552 INFO L93 Difference]: Finished difference Result 309399 states and 438046 transitions. [2025-02-05 16:36:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 16:36:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:38,794 INFO L225 Difference]: With dead ends: 309399 [2025-02-05 16:36:38,794 INFO L226 Difference]: Without dead ends: 203659 [2025-02-05 16:36:38,848 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:36:38,849 INFO L435 NwaCegarLoop]: 1054 mSDtfsCounter, 488 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:38,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1572 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203659 states. [2025-02-05 16:36:41,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203659 to 203612. [2025-02-05 16:36:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203612 states, 203611 states have (on average 1.4035194562179842) internal successors, (285772), 203611 states have internal predecessors, (285772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203612 states to 203612 states and 285772 transitions. [2025-02-05 16:36:42,253 INFO L78 Accepts]: Start accepts. Automaton has 203612 states and 285772 transitions. Word has length 150 [2025-02-05 16:36:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:42,253 INFO L471 AbstractCegarLoop]: Abstraction has 203612 states and 285772 transitions. [2025-02-05 16:36:42,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 203612 states and 285772 transitions. [2025-02-05 16:36:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:36:42,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:42,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:36:42,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:42,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:42,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2078864164, now seen corresponding path program 1 times [2025-02-05 16:36:42,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382405736] [2025-02-05 16:36:42,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:42,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:36:42,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:36:42,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:42,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:42,804 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:36:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382405736] [2025-02-05 16:36:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382405736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:42,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:36:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583361053] [2025-02-05 16:36:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:36:42,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:42,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:36:42,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:36:42,806 INFO L87 Difference]: Start difference. First operand 203612 states and 285772 transitions. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:44,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:44,209 INFO L93 Difference]: Finished difference Result 300085 states and 423540 transitions. [2025-02-05 16:36:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:36:44,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 16:36:44,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:44,659 INFO L225 Difference]: With dead ends: 300085 [2025-02-05 16:36:44,660 INFO L226 Difference]: Without dead ends: 282355 [2025-02-05 16:36:44,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:36:44,751 INFO L435 NwaCegarLoop]: 822 mSDtfsCounter, 4340 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4340 SdHoareTripleChecker+Valid, 3699 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:44,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4340 Valid, 3699 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:36:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282355 states. [2025-02-05 16:36:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282355 to 222048. [2025-02-05 16:36:48,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222048 states, 222047 states have (on average 1.4036172522033623) internal successors, (311669), 222047 states have internal predecessors, (311669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222048 states to 222048 states and 311669 transitions. [2025-02-05 16:36:49,176 INFO L78 Accepts]: Start accepts. Automaton has 222048 states and 311669 transitions. Word has length 150 [2025-02-05 16:36:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:49,177 INFO L471 AbstractCegarLoop]: Abstraction has 222048 states and 311669 transitions. [2025-02-05 16:36:49,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 222048 states and 311669 transitions. [2025-02-05 16:36:50,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:36:50,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:50,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:36:50,110 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:50,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1068630243, now seen corresponding path program 1 times [2025-02-05 16:36:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744626609] [2025-02-05 16:36:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:50,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:36:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:36:50,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:50,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:50,325 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:36:50,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:50,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744626609] [2025-02-05 16:36:50,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744626609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:50,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:50,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:36:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704750760] [2025-02-05 16:36:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:50,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:36:50,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:50,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:36:50,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:36:50,327 INFO L87 Difference]: Start difference. First operand 222048 states and 311669 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:51,481 INFO L93 Difference]: Finished difference Result 367032 states and 515809 transitions. [2025-02-05 16:36:51,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:36:51,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 16:36:51,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:51,688 INFO L225 Difference]: With dead ends: 367032 [2025-02-05 16:36:51,688 INFO L226 Difference]: Without dead ends: 165702 [2025-02-05 16:36:51,827 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:36:51,828 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 328 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:51,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 989 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165702 states. [2025-02-05 16:36:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165702 to 165655. [2025-02-05 16:36:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165655 states, 165654 states have (on average 1.3966098011517982) internal successors, (231354), 165654 states have internal predecessors, (231354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:54,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165655 states to 165655 states and 231354 transitions. [2025-02-05 16:36:54,645 INFO L78 Accepts]: Start accepts. Automaton has 165655 states and 231354 transitions. Word has length 150 [2025-02-05 16:36:54,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:36:54,645 INFO L471 AbstractCegarLoop]: Abstraction has 165655 states and 231354 transitions. [2025-02-05 16:36:54,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:54,646 INFO L276 IsEmpty]: Start isEmpty. Operand 165655 states and 231354 transitions. [2025-02-05 16:36:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-02-05 16:36:54,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:36:54,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:36:54,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:36:54,753 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:36:54,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:36:54,753 INFO L85 PathProgramCache]: Analyzing trace with hash -40476851, now seen corresponding path program 1 times [2025-02-05 16:36:54,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:36:54,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631103706] [2025-02-05 16:36:54,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:36:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:36:54,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-05 16:36:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-05 16:36:54,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:36:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:36:55,144 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:36:55,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:36:55,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631103706] [2025-02-05 16:36:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631103706] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:36:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:36:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:36:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056529973] [2025-02-05 16:36:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:36:55,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:36:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:36:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:36:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:36:55,146 INFO L87 Difference]: Start difference. First operand 165655 states and 231354 transitions. Second operand has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:36:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:36:56,047 INFO L93 Difference]: Finished difference Result 170523 states and 238653 transitions. [2025-02-05 16:36:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:36:56,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2025-02-05 16:36:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:36:56,281 INFO L225 Difference]: With dead ends: 170523 [2025-02-05 16:36:56,281 INFO L226 Difference]: Without dead ends: 170519 [2025-02-05 16:36:56,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:36:56,322 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:36:56,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2717 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:36:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170519 states.