./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.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a475a1757f9d6a7e4fb14b3de484172261c724bb5d3b2a10ee5c8f5de9de51b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:09:23,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:09:23,721 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:09:23,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:09:23,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:09:23,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:09:23,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:09:23,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:09:23,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:09:23,747 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:09:23,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:09:23,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:09:23,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:09:23,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:09:23,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:09:23,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:23,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:09:23,749 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a475a1757f9d6a7e4fb14b3de484172261c724bb5d3b2a10ee5c8f5de9de51b [2025-03-03 15:09:23,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:09:23,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:09:23,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:09:23,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:09:23,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:09:23,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:25,115 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9f7fdd2/33c35c2c00a1446c9e4d715c4c25b214/FLAGfaeb464bc [2025-03-03 15:09:25,396 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:09:25,396 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:25,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9f7fdd2/33c35c2c00a1446c9e4d715c4c25b214/FLAGfaeb464bc [2025-03-03 15:09:25,428 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9f7fdd2/33c35c2c00a1446c9e4d715c4c25b214 [2025-03-03 15:09:25,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:09:25,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:09:25,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:25,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:09:25,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:09:25,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d6d3d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25, skipping insertion in model container [2025-03-03 15:09:25,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:09:25,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2025-03-03 15:09:25,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:25,668 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:09:25,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2025-03-03 15:09:25,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:25,772 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:09:25,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25 WrapperNode [2025-03-03 15:09:25,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:25,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:25,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:09:25,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:09:25,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,839 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 853 [2025-03-03 15:09:25,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:25,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:09:25,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:09:25,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:09:25,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:09:25,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,889 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:09:25,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:09:25,901 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:09:25,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:09:25,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (1/1) ... [2025-03-03 15:09:25,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:25,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:25,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:09:25,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:09:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:09:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:09:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:09:25,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:09:26,065 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:09:26,066 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node2__m2~2#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L911: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: havoc main_~node3__m3~2#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1210: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: havoc main_~node4__m4~2#1; [2025-03-03 15:09:26,633 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L765: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L238: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1166: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L823: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1254: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1122: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:26,634 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: 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-03-03 15:09:26,635 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:26,668 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-03 15:09:26,668 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:09:26,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:09:26,678 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:09:26,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:26 BoogieIcfgContainer [2025-03-03 15:09:26,678 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:09:26,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:09:26,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:09:26,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:09:26,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:09:25" (1/3) ... [2025-03-03 15:09:26,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2d9c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:26, skipping insertion in model container [2025-03-03 15:09:26,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:25" (2/3) ... [2025-03-03 15:09:26,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2d9c11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:26, skipping insertion in model container [2025-03-03 15:09:26,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:26" (3/3) ... [2025-03-03 15:09:26,685 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:26,695 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:09:26,699 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 207 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:09:26,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:09:26,746 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;@557c3075, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:09:26,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:09:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 207 states, 205 states have (on average 1.721951219512195) internal successors, (353), 206 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-03 15:09:26,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:26,756 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] [2025-03-03 15:09:26,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:26,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1780348969, now seen corresponding path program 1 times [2025-03-03 15:09:26,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:26,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859468221] [2025-03-03 15:09:26,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:26,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-03 15:09:26,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-03 15:09:26,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:27,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:27,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859468221] [2025-03-03 15:09:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859468221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:27,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:27,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:27,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145121470] [2025-03-03 15:09:27,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:27,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:27,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:27,404 INFO L87 Difference]: Start difference. First operand has 207 states, 205 states have (on average 1.721951219512195) internal successors, (353), 206 states have internal predecessors, (353), 0 states have call successors, (0), 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 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:27,635 INFO L93 Difference]: Finished difference Result 829 states and 1341 transitions. [2025-03-03 15:09:27,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:27,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-03-03 15:09:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:27,651 INFO L225 Difference]: With dead ends: 829 [2025-03-03 15:09:27,652 INFO L226 Difference]: Without dead ends: 714 [2025-03-03 15:09:27,654 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-03-03 15:09:27,656 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 2265 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:27,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 2783 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:27,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-03 15:09:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 315. [2025-03-03 15:09:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 314 states have (on average 1.4968152866242037) internal successors, (470), 314 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 470 transitions. [2025-03-03 15:09:27,704 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 470 transitions. Word has length 80 [2025-03-03 15:09:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:27,704 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 470 transitions. [2025-03-03 15:09:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 470 transitions. [2025-03-03 15:09:27,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:27,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:27,709 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] [2025-03-03 15:09:27,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:09:27,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:27,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash -642796331, now seen corresponding path program 1 times [2025-03-03 15:09:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:27,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207148712] [2025-03-03 15:09:27,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:27,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:27,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:27,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:27,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:28,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:28,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207148712] [2025-03-03 15:09:28,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207148712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:28,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:28,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:28,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176231693] [2025-03-03 15:09:28,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:28,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:28,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:28,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:28,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:28,029 INFO L87 Difference]: Start difference. First operand 315 states and 470 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:28,198 INFO L93 Difference]: Finished difference Result 1371 states and 2113 transitions. [2025-03-03 15:09:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:28,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 15:09:28,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:28,203 INFO L225 Difference]: With dead ends: 1371 [2025-03-03 15:09:28,203 INFO L226 Difference]: Without dead ends: 1133 [2025-03-03 15:09:28,205 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-03-03 15:09:28,206 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 1895 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1895 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:28,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1895 Valid, 1008 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-03 15:09:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1125. [2025-03-03 15:09:28,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1124 states have (on average 1.5364768683274022) internal successors, (1727), 1124 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1727 transitions. [2025-03-03 15:09:28,251 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1727 transitions. Word has length 81 [2025-03-03 15:09:28,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:28,252 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1727 transitions. [2025-03-03 15:09:28,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1727 transitions. [2025-03-03 15:09:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:28,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:28,256 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] [2025-03-03 15:09:28,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:09:28,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1539142241, now seen corresponding path program 1 times [2025-03-03 15:09:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253758102] [2025-03-03 15:09:28,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:28,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:28,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:28,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:28,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:28,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:28,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253758102] [2025-03-03 15:09:28,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253758102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:28,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:28,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:28,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195663725] [2025-03-03 15:09:28,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:28,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:28,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:28,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:28,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:28,422 INFO L87 Difference]: Start difference. First operand 1125 states and 1727 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:28,646 INFO L93 Difference]: Finished difference Result 2870 states and 4470 transitions. [2025-03-03 15:09:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:28,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:09:28,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:28,652 INFO L225 Difference]: With dead ends: 2870 [2025-03-03 15:09:28,652 INFO L226 Difference]: Without dead ends: 1887 [2025-03-03 15:09:28,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:28,655 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1068 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1068 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:28,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1068 Valid, 296 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1887 states. [2025-03-03 15:09:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1887 to 1885. [2025-03-03 15:09:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1885 states, 1884 states have (on average 1.5467091295116773) internal successors, (2914), 1884 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2914 transitions. [2025-03-03 15:09:28,698 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2914 transitions. Word has length 82 [2025-03-03 15:09:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:28,698 INFO L471 AbstractCegarLoop]: Abstraction has 1885 states and 2914 transitions. [2025-03-03 15:09:28,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:28,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2914 transitions. [2025-03-03 15:09:28,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:28,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:28,700 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] [2025-03-03 15:09:28,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:09:28,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash -312885491, now seen corresponding path program 1 times [2025-03-03 15:09:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963398908] [2025-03-03 15:09:28,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:28,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:28,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:28,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:28,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:28,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:28,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963398908] [2025-03-03 15:09:28,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963398908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:28,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:28,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372239351] [2025-03-03 15:09:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:28,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:28,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:28,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:28,818 INFO L87 Difference]: Start difference. First operand 1885 states and 2914 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:29,045 INFO L93 Difference]: Finished difference Result 5192 states and 8091 transitions. [2025-03-03 15:09:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:09:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:29,057 INFO L225 Difference]: With dead ends: 5192 [2025-03-03 15:09:29,057 INFO L226 Difference]: Without dead ends: 3415 [2025-03-03 15:09:29,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:29,064 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1074 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:29,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 285 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2025-03-03 15:09:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3413. [2025-03-03 15:09:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3413 states, 3412 states have (on average 1.5495310668229778) internal successors, (5287), 3412 states have internal predecessors, (5287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3413 states to 3413 states and 5287 transitions. [2025-03-03 15:09:29,133 INFO L78 Accepts]: Start accepts. Automaton has 3413 states and 5287 transitions. Word has length 82 [2025-03-03 15:09:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:29,133 INFO L471 AbstractCegarLoop]: Abstraction has 3413 states and 5287 transitions. [2025-03-03 15:09:29,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3413 states and 5287 transitions. [2025-03-03 15:09:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:29,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:29,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:09:29,136 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1989683783, now seen corresponding path program 1 times [2025-03-03 15:09:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:29,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852838782] [2025-03-03 15:09:29,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:29,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:29,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:29,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:29,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:29,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:29,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852838782] [2025-03-03 15:09:29,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852838782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:29,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:29,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:29,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584225322] [2025-03-03 15:09:29,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:29,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:29,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:29,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:29,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:29,267 INFO L87 Difference]: Start difference. First operand 3413 states and 5287 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:29,494 INFO L93 Difference]: Finished difference Result 9844 states and 15320 transitions. [2025-03-03 15:09:29,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:29,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:09:29,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:29,516 INFO L225 Difference]: With dead ends: 9844 [2025-03-03 15:09:29,516 INFO L226 Difference]: Without dead ends: 6509 [2025-03-03 15:09:29,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:29,523 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1096 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:29,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 285 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2025-03-03 15:09:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 6507. [2025-03-03 15:09:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6507 states, 6506 states have (on average 1.5476483246234245) internal successors, (10069), 6506 states have internal predecessors, (10069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 10069 transitions. [2025-03-03 15:09:29,639 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 10069 transitions. Word has length 82 [2025-03-03 15:09:29,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:29,639 INFO L471 AbstractCegarLoop]: Abstraction has 6507 states and 10069 transitions. [2025-03-03 15:09:29,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:29,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 10069 transitions. [2025-03-03 15:09:29,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:29,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:29,642 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] [2025-03-03 15:09:29,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:09:29,643 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:29,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1376602523, now seen corresponding path program 1 times [2025-03-03 15:09:29,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004813163] [2025-03-03 15:09:29,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:29,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:29,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:29,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004813163] [2025-03-03 15:09:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004813163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221993560] [2025-03-03 15:09:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:29,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:29,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:29,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:29,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:29,755 INFO L87 Difference]: Start difference. First operand 6507 states and 10069 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:30,030 INFO L93 Difference]: Finished difference Result 19181 states and 29759 transitions. [2025-03-03 15:09:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:30,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:09:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:30,078 INFO L225 Difference]: With dead ends: 19181 [2025-03-03 15:09:30,080 INFO L226 Difference]: Without dead ends: 12729 [2025-03-03 15:09:30,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:30,093 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1122 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:30,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 283 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:30,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12729 states. [2025-03-03 15:09:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12729 to 12727. [2025-03-03 15:09:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12727 states, 12726 states have (on average 1.541882759704542) internal successors, (19622), 12726 states have internal predecessors, (19622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12727 states to 12727 states and 19622 transitions. [2025-03-03 15:09:30,378 INFO L78 Accepts]: Start accepts. Automaton has 12727 states and 19622 transitions. Word has length 82 [2025-03-03 15:09:30,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:30,378 INFO L471 AbstractCegarLoop]: Abstraction has 12727 states and 19622 transitions. [2025-03-03 15:09:30,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12727 states and 19622 transitions. [2025-03-03 15:09:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:30,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:30,381 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] [2025-03-03 15:09:30,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:09:30,382 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:30,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:30,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1177087721, now seen corresponding path program 1 times [2025-03-03 15:09:30,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:30,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525055357] [2025-03-03 15:09:30,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:30,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:30,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:30,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:30,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:30,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:30,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525055357] [2025-03-03 15:09:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525055357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:30,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:09:30,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442208664] [2025-03-03 15:09:30,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:30,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:30,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:30,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:30,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:30,639 INFO L87 Difference]: Start difference. First operand 12727 states and 19622 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:30,684 INFO L93 Difference]: Finished difference Result 13049 states and 20103 transitions. [2025-03-03 15:09:30,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:30,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-03 15:09:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:30,707 INFO L225 Difference]: With dead ends: 13049 [2025-03-03 15:09:30,707 INFO L226 Difference]: Without dead ends: 13047 [2025-03-03 15:09:30,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:30,715 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:30,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1114 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:30,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2025-03-03 15:09:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 13047. [2025-03-03 15:09:30,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13047 states, 13046 states have (on average 1.528591139046451) internal successors, (19942), 13046 states have internal predecessors, (19942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13047 states to 13047 states and 19942 transitions. [2025-03-03 15:09:30,919 INFO L78 Accepts]: Start accepts. Automaton has 13047 states and 19942 transitions. Word has length 83 [2025-03-03 15:09:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:30,920 INFO L471 AbstractCegarLoop]: Abstraction has 13047 states and 19942 transitions. [2025-03-03 15:09:30,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13047 states and 19942 transitions. [2025-03-03 15:09:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:09:30,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:30,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:30,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:09:30,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:30,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:30,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2125207257, now seen corresponding path program 1 times [2025-03-03 15:09:30,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:30,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35462850] [2025-03-03 15:09:30,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:30,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:09:30,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:09:30,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:30,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:31,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35462850] [2025-03-03 15:09:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35462850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:31,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:31,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:31,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359390323] [2025-03-03 15:09:31,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:31,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:31,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:31,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:31,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:31,101 INFO L87 Difference]: Start difference. First operand 13047 states and 19942 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:31,191 INFO L93 Difference]: Finished difference Result 36891 states and 56296 transitions. [2025-03-03 15:09:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2025-03-03 15:09:31,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:31,238 INFO L225 Difference]: With dead ends: 36891 [2025-03-03 15:09:31,238 INFO L226 Difference]: Without dead ends: 24409 [2025-03-03 15:09:31,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:31,263 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 193 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:31,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 612 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:31,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24409 states. [2025-03-03 15:09:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24409 to 24407. [2025-03-03 15:09:31,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24407 states, 24406 states have (on average 1.515938703597476) internal successors, (36998), 24406 states have internal predecessors, (36998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24407 states to 24407 states and 36998 transitions. [2025-03-03 15:09:31,698 INFO L78 Accepts]: Start accepts. Automaton has 24407 states and 36998 transitions. Word has length 84 [2025-03-03 15:09:31,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:31,699 INFO L471 AbstractCegarLoop]: Abstraction has 24407 states and 36998 transitions. [2025-03-03 15:09:31,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:31,699 INFO L276 IsEmpty]: Start isEmpty. Operand 24407 states and 36998 transitions. [2025-03-03 15:09:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:31,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:31,702 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] [2025-03-03 15:09:31,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:09:31,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:31,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:31,703 INFO L85 PathProgramCache]: Analyzing trace with hash 620190175, now seen corresponding path program 1 times [2025-03-03 15:09:31,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:31,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929500069] [2025-03-03 15:09:31,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:31,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:31,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:31,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:31,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929500069] [2025-03-03 15:09:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929500069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:31,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:31,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212523048] [2025-03-03 15:09:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:31,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:31,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:31,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:31,759 INFO L87 Difference]: Start difference. First operand 24407 states and 36998 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:31,889 INFO L93 Difference]: Finished difference Result 62930 states and 95423 transitions. [2025-03-03 15:09:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:32,070 INFO L225 Difference]: With dead ends: 62930 [2025-03-03 15:09:32,070 INFO L226 Difference]: Without dead ends: 43040 [2025-03-03 15:09:32,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:32,092 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 200 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:32,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 556 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:32,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43040 states. [2025-03-03 15:09:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43040 to 43038. [2025-03-03 15:09:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43038 states, 43037 states have (on average 1.5056114506122638) internal successors, (64797), 43037 states have internal predecessors, (64797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43038 states to 43038 states and 64797 transitions. [2025-03-03 15:09:32,737 INFO L78 Accepts]: Start accepts. Automaton has 43038 states and 64797 transitions. Word has length 85 [2025-03-03 15:09:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:32,737 INFO L471 AbstractCegarLoop]: Abstraction has 43038 states and 64797 transitions. [2025-03-03 15:09:32,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 43038 states and 64797 transitions. [2025-03-03 15:09:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:32,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:32,744 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] [2025-03-03 15:09:32,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:32,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1854027838, now seen corresponding path program 1 times [2025-03-03 15:09:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494350196] [2025-03-03 15:09:32,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:32,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:32,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:32,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:32,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:32,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:32,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494350196] [2025-03-03 15:09:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494350196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:32,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191000171] [2025-03-03 15:09:32,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:32,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:32,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:32,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:32,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:32,844 INFO L87 Difference]: Start difference. First operand 43038 states and 64797 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:33,230 INFO L93 Difference]: Finished difference Result 92501 states and 138963 transitions. [2025-03-03 15:09:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:33,320 INFO L225 Difference]: With dead ends: 92501 [2025-03-03 15:09:33,320 INFO L226 Difference]: Without dead ends: 54307 [2025-03-03 15:09:33,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:33,346 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 193 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:33,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 541 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:33,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54307 states. [2025-03-03 15:09:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54307 to 53952. [2025-03-03 15:09:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53952 states, 53951 states have (on average 1.4830494337454356) internal successors, (80012), 53951 states have internal predecessors, (80012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53952 states to 53952 states and 80012 transitions. [2025-03-03 15:09:33,973 INFO L78 Accepts]: Start accepts. Automaton has 53952 states and 80012 transitions. Word has length 85 [2025-03-03 15:09:33,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:33,974 INFO L471 AbstractCegarLoop]: Abstraction has 53952 states and 80012 transitions. [2025-03-03 15:09:33,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:33,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53952 states and 80012 transitions. [2025-03-03 15:09:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:33,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:33,981 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] [2025-03-03 15:09:33,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:33,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:33,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:33,983 INFO L85 PathProgramCache]: Analyzing trace with hash 622857791, now seen corresponding path program 1 times [2025-03-03 15:09:33,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:33,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299375481] [2025-03-03 15:09:33,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:33,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:34,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:34,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:34,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:34,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:34,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299375481] [2025-03-03 15:09:34,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299375481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:34,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:34,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469440668] [2025-03-03 15:09:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:34,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:34,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:34,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:34,052 INFO L87 Difference]: Start difference. First operand 53952 states and 80012 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:34,394 INFO L93 Difference]: Finished difference Result 107677 states and 159297 transitions. [2025-03-03 15:09:34,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:34,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:34,500 INFO L225 Difference]: With dead ends: 107677 [2025-03-03 15:09:34,500 INFO L226 Difference]: Without dead ends: 66467 [2025-03-03 15:09:34,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:34,539 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 181 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:34,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 539 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:34,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66467 states. [2025-03-03 15:09:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66467 to 65918. [2025-03-03 15:09:35,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65918 states, 65917 states have (on average 1.4578333358617654) internal successors, (96096), 65917 states have internal predecessors, (96096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65918 states to 65918 states and 96096 transitions. [2025-03-03 15:09:35,418 INFO L78 Accepts]: Start accepts. Automaton has 65918 states and 96096 transitions. Word has length 85 [2025-03-03 15:09:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 65918 states and 96096 transitions. [2025-03-03 15:09:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 65918 states and 96096 transitions. [2025-03-03 15:09:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:35,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:35,425 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] [2025-03-03 15:09:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:09:35,426 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 174763768, now seen corresponding path program 1 times [2025-03-03 15:09:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:35,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741534370] [2025-03-03 15:09:35,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:35,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:35,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:35,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:35,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:35,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:35,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741534370] [2025-03-03 15:09:35,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741534370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:35,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:35,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678260570] [2025-03-03 15:09:35,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:35,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:35,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:35,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:35,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:35,557 INFO L87 Difference]: Start difference. First operand 65918 states and 96096 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:35,985 INFO L93 Difference]: Finished difference Result 157719 states and 230936 transitions. [2025-03-03 15:09:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:36,210 INFO L225 Difference]: With dead ends: 157719 [2025-03-03 15:09:36,210 INFO L226 Difference]: Without dead ends: 147421 [2025-03-03 15:09:36,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-03-03 15:09:36,267 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 1979 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1979 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:36,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1979 Valid, 1440 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147421 states. [2025-03-03 15:09:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147421 to 76070. [2025-03-03 15:09:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76070 states, 76069 states have (on average 1.4562042356281797) internal successors, (110772), 76069 states have internal predecessors, (110772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76070 states to 76070 states and 110772 transitions. [2025-03-03 15:09:37,728 INFO L78 Accepts]: Start accepts. Automaton has 76070 states and 110772 transitions. Word has length 85 [2025-03-03 15:09:37,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:37,729 INFO L471 AbstractCegarLoop]: Abstraction has 76070 states and 110772 transitions. [2025-03-03 15:09:37,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 76070 states and 110772 transitions. [2025-03-03 15:09:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:37,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:37,742 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] [2025-03-03 15:09:37,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:09:37,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:37,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash 776789982, now seen corresponding path program 1 times [2025-03-03 15:09:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806448013] [2025-03-03 15:09:37,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:37,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:37,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:37,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:37,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806448013] [2025-03-03 15:09:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806448013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:37,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:37,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419178739] [2025-03-03 15:09:37,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:37,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:37,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:37,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:37,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:37,840 INFO L87 Difference]: Start difference. First operand 76070 states and 110772 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:38,203 INFO L93 Difference]: Finished difference Result 139371 states and 202113 transitions. [2025-03-03 15:09:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:38,537 INFO L225 Difference]: With dead ends: 139371 [2025-03-03 15:09:38,537 INFO L226 Difference]: Without dead ends: 89849 [2025-03-03 15:09:38,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:38,562 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 169 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:38,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 559 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89849 states. [2025-03-03 15:09:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89849 to 89029. [2025-03-03 15:09:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89029 states, 89028 states have (on average 1.4266747540099745) internal successors, (127014), 89028 states have internal predecessors, (127014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89029 states to 89029 states and 127014 transitions. [2025-03-03 15:09:39,649 INFO L78 Accepts]: Start accepts. Automaton has 89029 states and 127014 transitions. Word has length 85 [2025-03-03 15:09:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:39,650 INFO L471 AbstractCegarLoop]: Abstraction has 89029 states and 127014 transitions. [2025-03-03 15:09:39,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 89029 states and 127014 transitions. [2025-03-03 15:09:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:39,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:39,675 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] [2025-03-03 15:09:39,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:09:39,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1382538146, now seen corresponding path program 1 times [2025-03-03 15:09:39,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:39,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253036158] [2025-03-03 15:09:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:39,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:39,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:39,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:39,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:39,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253036158] [2025-03-03 15:09:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253036158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:39,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:39,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:39,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326218866] [2025-03-03 15:09:39,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:39,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:39,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:39,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:39,869 INFO L87 Difference]: Start difference. First operand 89029 states and 127014 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:40,885 INFO L93 Difference]: Finished difference Result 201219 states and 288751 transitions. [2025-03-03 15:09:40,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:40,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:40,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:41,295 INFO L225 Difference]: With dead ends: 201219 [2025-03-03 15:09:41,295 INFO L226 Difference]: Without dead ends: 182353 [2025-03-03 15:09:41,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-03-03 15:09:41,337 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 1774 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 1529 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:41,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 1529 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182353 states. [2025-03-03 15:09:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182353 to 107633. [2025-03-03 15:09:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107633 states, 107632 states have (on average 1.4262858629403894) internal successors, (153514), 107632 states have internal predecessors, (153514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107633 states to 107633 states and 153514 transitions. [2025-03-03 15:09:43,046 INFO L78 Accepts]: Start accepts. Automaton has 107633 states and 153514 transitions. Word has length 85 [2025-03-03 15:09:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 107633 states and 153514 transitions. [2025-03-03 15:09:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 107633 states and 153514 transitions. [2025-03-03 15:09:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:43,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:43,070 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] [2025-03-03 15:09:43,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:09:43,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:43,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1266702143, now seen corresponding path program 1 times [2025-03-03 15:09:43,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:43,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732321221] [2025-03-03 15:09:43,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:43,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:43,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:43,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:43,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:43,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:43,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:43,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732321221] [2025-03-03 15:09:43,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732321221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:43,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:43,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:43,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350414372] [2025-03-03 15:09:43,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:43,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:43,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:43,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:43,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:43,206 INFO L87 Difference]: Start difference. First operand 107633 states and 153514 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:43,872 INFO L93 Difference]: Finished difference Result 228159 states and 327367 transitions. [2025-03-03 15:09:43,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:43,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:44,177 INFO L225 Difference]: With dead ends: 228159 [2025-03-03 15:09:44,178 INFO L226 Difference]: Without dead ends: 200797 [2025-03-03 15:09:44,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:44,253 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 1756 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:44,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 1628 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200797 states. [2025-03-03 15:09:46,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200797 to 128573. [2025-03-03 15:09:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128573 states, 128572 states have (on average 1.4281336527393211) internal successors, (183618), 128572 states have internal predecessors, (183618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128573 states to 128573 states and 183618 transitions. [2025-03-03 15:09:46,496 INFO L78 Accepts]: Start accepts. Automaton has 128573 states and 183618 transitions. Word has length 85 [2025-03-03 15:09:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:46,496 INFO L471 AbstractCegarLoop]: Abstraction has 128573 states and 183618 transitions. [2025-03-03 15:09:46,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 128573 states and 183618 transitions. [2025-03-03 15:09:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:46,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:46,511 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] [2025-03-03 15:09:46,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:09:46,511 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -387889730, now seen corresponding path program 1 times [2025-03-03 15:09:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:46,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199964556] [2025-03-03 15:09:46,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:46,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:46,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:46,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:46,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:46,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:46,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:46,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199964556] [2025-03-03 15:09:46,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199964556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:46,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:46,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:46,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584779891] [2025-03-03 15:09:46,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:46,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:46,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:46,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:46,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:46,643 INFO L87 Difference]: Start difference. First operand 128573 states and 183618 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:47,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:47,519 INFO L93 Difference]: Finished difference Result 260667 states and 373867 transitions. [2025-03-03 15:09:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:47,519 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:47,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:47,824 INFO L225 Difference]: With dead ends: 260667 [2025-03-03 15:09:47,824 INFO L226 Difference]: Without dead ends: 227689 [2025-03-03 15:09:47,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:47,885 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 1907 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:47,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 1723 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227689 states. [2025-03-03 15:09:49,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227689 to 147493. [2025-03-03 15:09:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147493 states, 147492 states have (on average 1.4296843218615247) internal successors, (210867), 147492 states have internal predecessors, (210867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147493 states to 147493 states and 210867 transitions. [2025-03-03 15:09:50,459 INFO L78 Accepts]: Start accepts. Automaton has 147493 states and 210867 transitions. Word has length 85 [2025-03-03 15:09:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:50,459 INFO L471 AbstractCegarLoop]: Abstraction has 147493 states and 210867 transitions. [2025-03-03 15:09:50,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 147493 states and 210867 transitions. [2025-03-03 15:09:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:50,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:50,468 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] [2025-03-03 15:09:50,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:09:50,468 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 449047908, now seen corresponding path program 1 times [2025-03-03 15:09:50,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:50,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675551189] [2025-03-03 15:09:50,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:50,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:50,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:50,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:50,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:50,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:50,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675551189] [2025-03-03 15:09:50,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675551189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:50,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:50,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:50,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497874304] [2025-03-03 15:09:50,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:50,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:50,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:50,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:50,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:50,588 INFO L87 Difference]: Start difference. First operand 147493 states and 210867 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:51,626 INFO L93 Difference]: Finished difference Result 297025 states and 425772 transitions. [2025-03-03 15:09:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2025-03-03 15:09:51,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:52,021 INFO L225 Difference]: With dead ends: 297025 [2025-03-03 15:09:52,022 INFO L226 Difference]: Without dead ends: 260255 [2025-03-03 15:09:52,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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-03-03 15:09:52,085 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1914 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1914 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:52,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1914 Valid, 1473 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260255 states. [2025-03-03 15:09:54,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260255 to 166487. [2025-03-03 15:09:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166487 states, 166486 states have (on average 1.430991194454789) internal successors, (238240), 166486 states have internal predecessors, (238240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166487 states to 166487 states and 238240 transitions. [2025-03-03 15:09:54,713 INFO L78 Accepts]: Start accepts. Automaton has 166487 states and 238240 transitions. Word has length 85 [2025-03-03 15:09:54,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:54,713 INFO L471 AbstractCegarLoop]: Abstraction has 166487 states and 238240 transitions. [2025-03-03 15:09:54,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 166487 states and 238240 transitions. [2025-03-03 15:09:54,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 15:09:54,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:54,725 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] [2025-03-03 15:09:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:09:54,725 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash -49821983, now seen corresponding path program 1 times [2025-03-03 15:09:54,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:54,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921112626] [2025-03-03 15:09:54,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:54,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 15:09:54,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 15:09:54,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:54,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:54,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:54,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:54,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921112626] [2025-03-03 15:09:54,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921112626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:54,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:54,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:54,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432971265] [2025-03-03 15:09:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:54,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:54,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:54,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:54,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:54,771 INFO L87 Difference]: Start difference. First operand 166487 states and 238240 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:55,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:55,660 INFO L93 Difference]: Finished difference Result 239692 states and 341294 transitions. [2025-03-03 15:09:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2025-03-03 15:09:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:55,859 INFO L225 Difference]: With dead ends: 239692 [2025-03-03 15:09:55,859 INFO L226 Difference]: Without dead ends: 161442 [2025-03-03 15:09:55,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:55,914 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 160 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:55,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 641 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161442 states. [2025-03-03 15:09:57,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161442 to 144010. [2025-03-03 15:09:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144010 states, 144009 states have (on average 1.4076481331027921) internal successors, (202714), 144009 states have internal predecessors, (202714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144010 states to 144010 states and 202714 transitions. [2025-03-03 15:09:57,840 INFO L78 Accepts]: Start accepts. Automaton has 144010 states and 202714 transitions. Word has length 88 [2025-03-03 15:09:57,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:57,840 INFO L471 AbstractCegarLoop]: Abstraction has 144010 states and 202714 transitions. [2025-03-03 15:09:57,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 144010 states and 202714 transitions. [2025-03-03 15:09:57,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:09:57,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:57,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:09:57,857 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:57,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:57,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1967023009, now seen corresponding path program 1 times [2025-03-03 15:09:57,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715361798] [2025-03-03 15:09:57,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:57,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:09:57,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:09:57,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:57,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715361798] [2025-03-03 15:09:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715361798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:09:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486189361] [2025-03-03 15:09:57,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:57,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:57,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:57,974 INFO L87 Difference]: Start difference. First operand 144010 states and 202714 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:59,628 INFO L93 Difference]: Finished difference Result 406764 states and 566626 transitions. [2025-03-03 15:09:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:09:59,629 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:09:59,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:00,104 INFO L225 Difference]: With dead ends: 406764 [2025-03-03 15:10:00,104 INFO L226 Difference]: Without dead ends: 358462 [2025-03-03 15:10:00,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:00,206 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1821 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:00,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 539 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:10:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358462 states. [2025-03-03 15:10:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358462 to 144590. [2025-03-03 15:10:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144590 states, 144589 states have (on average 1.4072716458375119) internal successors, (203476), 144589 states have internal predecessors, (203476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:03,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144590 states to 144590 states and 203476 transitions. [2025-03-03 15:10:03,280 INFO L78 Accepts]: Start accepts. Automaton has 144590 states and 203476 transitions. Word has length 90 [2025-03-03 15:10:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:03,280 INFO L471 AbstractCegarLoop]: Abstraction has 144590 states and 203476 transitions. [2025-03-03 15:10:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 144590 states and 203476 transitions. [2025-03-03 15:10:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:03,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:03,297 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:03,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:10:03,297 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:03,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:03,297 INFO L85 PathProgramCache]: Analyzing trace with hash -159266, now seen corresponding path program 1 times [2025-03-03 15:10:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399230018] [2025-03-03 15:10:03,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:03,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:03,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:03,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:03,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399230018] [2025-03-03 15:10:03,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399230018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:03,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:03,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:10:03,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571695141] [2025-03-03 15:10:03,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:10:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:03,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:10:03,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:03,407 INFO L87 Difference]: Start difference. First operand 144590 states and 203476 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:05,210 INFO L93 Difference]: Finished difference Result 488252 states and 682304 transitions. [2025-03-03 15:10:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:05,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:10:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:05,880 INFO L225 Difference]: With dead ends: 488252 [2025-03-03 15:10:05,881 INFO L226 Difference]: Without dead ends: 419362 [2025-03-03 15:10:06,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:06,025 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1974 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:06,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 553 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:10:06,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419362 states. [2025-03-03 15:10:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419362 to 144926. [2025-03-03 15:10:09,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144926 states, 144925 states have (on average 1.4069760220803864) internal successors, (203906), 144925 states have internal predecessors, (203906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144926 states to 144926 states and 203906 transitions. [2025-03-03 15:10:09,610 INFO L78 Accepts]: Start accepts. Automaton has 144926 states and 203906 transitions. Word has length 90 [2025-03-03 15:10:09,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:10:09,610 INFO L471 AbstractCegarLoop]: Abstraction has 144926 states and 203906 transitions. [2025-03-03 15:10:09,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 144926 states and 203906 transitions. [2025-03-03 15:10:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 15:10:09,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:10:09,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:10:09,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:10:09,626 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:10:09,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:10:09,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2122662145, now seen corresponding path program 1 times [2025-03-03 15:10:09,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:10:09,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722844386] [2025-03-03 15:10:09,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:10:09,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:10:09,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 15:10:09,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 15:10:09,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:10:09,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:10:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:10:09,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:10:09,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722844386] [2025-03-03 15:10:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722844386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:10:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:10:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:10:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309029088] [2025-03-03 15:10:09,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:10:09,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:10:09,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:10:09,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:10:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:10:09,746 INFO L87 Difference]: Start difference. First operand 144926 states and 203906 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:10:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:10:11,127 INFO L93 Difference]: Finished difference Result 375400 states and 526074 transitions. [2025-03-03 15:10:11,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:10:11,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2025-03-03 15:10:11,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:10:11,542 INFO L225 Difference]: With dead ends: 375400 [2025-03-03 15:10:11,542 INFO L226 Difference]: Without dead ends: 321676 [2025-03-03 15:10:11,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:10:11,662 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2130 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:10:11,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 570 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:10:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321676 states. [2025-03-03 15:10:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321676 to 144986. [2025-03-03 15:10:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144986 states, 144985 states have (on average 1.406945546090975) internal successors, (203986), 144985 states have internal predecessors, (203986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)