./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.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.UNBOUNDED.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 eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:28:33,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:28:33,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:28:33,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:28:33,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:28:33,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:28:33,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:28:33,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:28:33,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:28:33,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:28:33,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:28:33,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:28:33,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:28:33,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:28:33,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:28:33,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:28:33,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:28:33,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:33,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:28:33,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:28:33,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:28:33,512 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 -> eb6a86313c6847913ca8b6f4f78c128447d9c9cbacc492e7ef1a5540e3f6a711 [2025-03-16 19:28:33,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:28:33,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:28:33,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:28:33,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:28:33,742 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:28:33,744 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.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:34,869 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673d6e0e1/c4b524cd4a9a4feab3f3d1cb12dc568f/FLAG91142f7f9 [2025-03-16 19:28:35,115 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:28:35,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:35,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673d6e0e1/c4b524cd4a9a4feab3f3d1cb12dc568f/FLAG91142f7f9 [2025-03-16 19:28:35,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673d6e0e1/c4b524cd4a9a4feab3f3d1cb12dc568f [2025-03-16 19:28:35,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:28:35,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:28:35,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:35,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:28:35,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:28:35,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,144 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c3e06b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35, skipping insertion in model container [2025-03-16 19:28:35,144 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:28:35,361 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.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-03-16 19:28:35,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:35,436 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:28:35,479 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.UNBOUNDED.pals.c.v+nlh-reducer.c[8460,8473] [2025-03-16 19:28:35,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:28:35,531 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:28:35,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35 WrapperNode [2025-03-16 19:28:35,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:28:35,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:35,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:28:35,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:28:35,537 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,580 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 838 [2025-03-16 19:28:35,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:28:35,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:28:35,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:28:35,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:28:35,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,596 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,626 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-16 19:28:35,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:28:35,668 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:28:35,668 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:28:35,668 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:28:35,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (1/1) ... [2025-03-16 19:28:35,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:28:35,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:28:35,698 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-16 19:28:35,704 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-16 19:28:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:28:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:28:35,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:28:35,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:28:35,840 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:28:35,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:28:36,413 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L647: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:36,413 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:36,413 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:36,413 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1245: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1113: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L256: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L934: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L589: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1201: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L277: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L906: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L675: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L478: havoc main_~node2__m2~2#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L214: 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-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L561: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L496: havoc main_~node3__m3~2#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1157: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-16 19:28:36,414 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L514: havoc main_~node4__m4~2#1; [2025-03-16 19:28:36,444 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2025-03-16 19:28:36,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:28:36,455 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:28:36,456 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:28:36,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:36 BoogieIcfgContainer [2025-03-16 19:28:36,456 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:28:36,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:28:36,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:28:36,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:28:36,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:28:35" (1/3) ... [2025-03-16 19:28:36,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce98f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:36, skipping insertion in model container [2025-03-16 19:28:36,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:28:35" (2/3) ... [2025-03-16 19:28:36,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce98f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:28:36, skipping insertion in model container [2025-03-16 19:28:36,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:28:36" (3/3) ... [2025-03-16 19:28:36,462 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:28:36,473 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:28:36,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 205 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:28:36,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:28:36,533 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;@659e6043, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:28:36,534 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:28:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 203 states have (on average 1.7241379310344827) internal successors, (350), 204 states have internal predecessors, (350), 0 states have call successors, (0), 0 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-16 19:28:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:28:36,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:36,548 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] [2025-03-16 19:28:36,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:36,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:36,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1535561168, now seen corresponding path program 1 times [2025-03-16 19:28:36,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893013055] [2025-03-16 19:28:36,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:36,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:28:36,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:28:36,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:36,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:37,147 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-16 19:28:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893013055] [2025-03-16 19:28:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893013055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456395138] [2025-03-16 19:28:37,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:37,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:37,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:37,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:37,173 INFO L87 Difference]: Start difference. First operand has 205 states, 203 states have (on average 1.7241379310344827) internal successors, (350), 204 states have internal predecessors, (350), 0 states have call successors, (0), 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.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-16 19:28:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:37,406 INFO L93 Difference]: Finished difference Result 827 states and 1338 transitions. [2025-03-16 19:28:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:37,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-03-16 19:28:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:37,423 INFO L225 Difference]: With dead ends: 827 [2025-03-16 19:28:37,423 INFO L226 Difference]: Without dead ends: 712 [2025-03-16 19:28:37,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:37,430 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 2286 mSDsluCounter, 2254 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:37,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 2609 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-16 19:28:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 313. [2025-03-16 19:28:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.5064102564102564) internal successors, (470), 312 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-16 19:28:37,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 470 transitions. [2025-03-16 19:28:37,489 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 470 transitions. Word has length 78 [2025-03-16 19:28:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:37,489 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 470 transitions. [2025-03-16 19:28:37,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-16 19:28:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 470 transitions. [2025-03-16 19:28:37,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:28:37,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:37,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:37,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:28:37,492 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash -356795535, now seen corresponding path program 1 times [2025-03-16 19:28:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:37,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556806442] [2025-03-16 19:28:37,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:37,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:37,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:28:37,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:28:37,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:37,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:37,750 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-16 19:28:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556806442] [2025-03-16 19:28:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556806442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:37,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890383372] [2025-03-16 19:28:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:37,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:37,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:37,753 INFO L87 Difference]: Start difference. First operand 313 states and 470 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-16 19:28:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:37,917 INFO L93 Difference]: Finished difference Result 1369 states and 2123 transitions. [2025-03-16 19:28:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-16 19:28:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:37,923 INFO L225 Difference]: With dead ends: 1369 [2025-03-16 19:28:37,923 INFO L226 Difference]: Without dead ends: 1131 [2025-03-16 19:28:37,924 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-16 19:28:37,927 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 1490 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:37,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 1294 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2025-03-16 19:28:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1123. [2025-03-16 19:28:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1122 states have (on average 1.5463458110516934) internal successors, (1735), 1122 states have internal predecessors, (1735), 0 states have call successors, (0), 0 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-16 19:28:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1735 transitions. [2025-03-16 19:28:37,972 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1735 transitions. Word has length 79 [2025-03-16 19:28:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:37,972 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1735 transitions. [2025-03-16 19:28:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-16 19:28:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1735 transitions. [2025-03-16 19:28:37,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:37,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:37,979 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-16 19:28:37,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:28:37,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:37,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:37,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2083703821, now seen corresponding path program 1 times [2025-03-16 19:28:37,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:37,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030786555] [2025-03-16 19:28:37,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:38,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:38,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:38,147 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-16 19:28:38,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030786555] [2025-03-16 19:28:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030786555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:38,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:38,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:38,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478633996] [2025-03-16 19:28:38,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:38,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:38,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:38,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:38,151 INFO L87 Difference]: Start difference. First operand 1123 states and 1735 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:38,370 INFO L93 Difference]: Finished difference Result 3047 states and 4765 transitions. [2025-03-16 19:28:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:38,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:38,379 INFO L225 Difference]: With dead ends: 3047 [2025-03-16 19:28:38,380 INFO L226 Difference]: Without dead ends: 1977 [2025-03-16 19:28:38,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:38,385 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1143 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:38,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 284 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2025-03-16 19:28:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1975. [2025-03-16 19:28:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1974 states have (on average 1.5562310030395137) internal successors, (3072), 1974 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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-16 19:28:38,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 3072 transitions. [2025-03-16 19:28:38,427 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 3072 transitions. Word has length 80 [2025-03-16 19:28:38,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:38,427 INFO L471 AbstractCegarLoop]: Abstraction has 1975 states and 3072 transitions. [2025-03-16 19:28:38,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 3072 transitions. [2025-03-16 19:28:38,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:38,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:38,430 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-16 19:28:38,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:28:38,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:38,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1147546443, now seen corresponding path program 1 times [2025-03-16 19:28:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161432082] [2025-03-16 19:28:38,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:38,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:38,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:38,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:38,578 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-16 19:28:38,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:38,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161432082] [2025-03-16 19:28:38,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161432082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:38,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:38,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:38,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223501591] [2025-03-16 19:28:38,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:38,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:38,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:38,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:38,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:38,580 INFO L87 Difference]: Start difference. First operand 1975 states and 3072 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:38,785 INFO L93 Difference]: Finished difference Result 5380 states and 8432 transitions. [2025-03-16 19:28:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:38,786 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:38,798 INFO L225 Difference]: With dead ends: 5380 [2025-03-16 19:28:38,798 INFO L226 Difference]: Without dead ends: 3511 [2025-03-16 19:28:38,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:38,805 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 1073 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:38,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 288 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:38,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2025-03-16 19:28:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3509. [2025-03-16 19:28:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 3508 states have (on average 1.5578677309007982) internal successors, (5465), 3508 states have internal predecessors, (5465), 0 states have call successors, (0), 0 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-16 19:28:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5465 transitions. [2025-03-16 19:28:38,888 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5465 transitions. Word has length 80 [2025-03-16 19:28:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:38,888 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 5465 transitions. [2025-03-16 19:28:38,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5465 transitions. [2025-03-16 19:28:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:38,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:38,894 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-16 19:28:38,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:28:38,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:38,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:38,895 INFO L85 PathProgramCache]: Analyzing trace with hash 704481289, now seen corresponding path program 1 times [2025-03-16 19:28:38,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:38,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989916346] [2025-03-16 19:28:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:38,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:38,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:38,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:38,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:38,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,026 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-16 19:28:39,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989916346] [2025-03-16 19:28:39,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989916346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:39,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664800673] [2025-03-16 19:28:39,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:39,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:39,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:39,028 INFO L87 Difference]: Start difference. First operand 3509 states and 5465 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,253 INFO L93 Difference]: Finished difference Result 9920 states and 15546 transitions. [2025-03-16 19:28:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:39,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,277 INFO L225 Difference]: With dead ends: 9920 [2025-03-16 19:28:39,277 INFO L226 Difference]: Without dead ends: 6551 [2025-03-16 19:28:39,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:39,285 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1059 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 297 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:39,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6551 states. [2025-03-16 19:28:39,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6551 to 6549. [2025-03-16 19:28:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6549 states, 6548 states have (on average 1.5595601710445939) internal successors, (10212), 6548 states have internal predecessors, (10212), 0 states have call successors, (0), 0 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-16 19:28:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 10212 transitions. [2025-03-16 19:28:39,466 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 10212 transitions. Word has length 80 [2025-03-16 19:28:39,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:39,467 INFO L471 AbstractCegarLoop]: Abstraction has 6549 states and 10212 transitions. [2025-03-16 19:28:39,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 10212 transitions. [2025-03-16 19:28:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:28:39,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:39,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:28:39,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:28:39,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:39,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1470622561, now seen corresponding path program 1 times [2025-03-16 19:28:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:39,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427914399] [2025-03-16 19:28:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:39,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:28:39,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:28:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:39,576 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-16 19:28:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427914399] [2025-03-16 19:28:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427914399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659553603] [2025-03-16 19:28:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:39,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:39,578 INFO L87 Difference]: Start difference. First operand 6549 states and 10212 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:39,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:39,816 INFO L93 Difference]: Finished difference Result 19200 states and 30017 transitions. [2025-03-16 19:28:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:39,864 INFO L225 Difference]: With dead ends: 19200 [2025-03-16 19:28:39,867 INFO L226 Difference]: Without dead ends: 12727 [2025-03-16 19:28:39,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:39,879 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1097 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:39,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 284 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12727 states. [2025-03-16 19:28:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12727 to 12725. [2025-03-16 19:28:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12725 states, 12724 states have (on average 1.5545425966677147) internal successors, (19780), 12724 states have internal predecessors, (19780), 0 states have call successors, (0), 0 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-16 19:28:40,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12725 states to 12725 states and 19780 transitions. [2025-03-16 19:28:40,168 INFO L78 Accepts]: Start accepts. Automaton has 12725 states and 19780 transitions. Word has length 80 [2025-03-16 19:28:40,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:40,168 INFO L471 AbstractCegarLoop]: Abstraction has 12725 states and 19780 transitions. [2025-03-16 19:28:40,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 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-16 19:28:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 12725 states and 19780 transitions. [2025-03-16 19:28:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:40,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:40,171 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-16 19:28:40,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:28:40,171 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:40,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:40,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1378178568, now seen corresponding path program 1 times [2025-03-16 19:28:40,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:40,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910693475] [2025-03-16 19:28:40,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:40,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:40,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:40,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:40,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:40,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:40,274 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-16 19:28:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:40,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910693475] [2025-03-16 19:28:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910693475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137344122] [2025-03-16 19:28:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:40,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:40,276 INFO L87 Difference]: Start difference. First operand 12725 states and 19780 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-16 19:28:40,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:40,512 INFO L93 Difference]: Finished difference Result 35615 states and 55444 transitions. [2025-03-16 19:28:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-16 19:28:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:40,553 INFO L225 Difference]: With dead ends: 35615 [2025-03-16 19:28:40,553 INFO L226 Difference]: Without dead ends: 22952 [2025-03-16 19:28:40,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:40,573 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1158 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:40,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 287 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:28:40,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22952 states. [2025-03-16 19:28:40,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22952 to 22950. [2025-03-16 19:28:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22950 states, 22949 states have (on average 1.550045753627609) internal successors, (35572), 22949 states have internal predecessors, (35572), 0 states have call successors, (0), 0 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-16 19:28:40,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22950 states to 22950 states and 35572 transitions. [2025-03-16 19:28:40,925 INFO L78 Accepts]: Start accepts. Automaton has 22950 states and 35572 transitions. Word has length 81 [2025-03-16 19:28:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:40,925 INFO L471 AbstractCegarLoop]: Abstraction has 22950 states and 35572 transitions. [2025-03-16 19:28:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 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-16 19:28:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 22950 states and 35572 transitions. [2025-03-16 19:28:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:28:40,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:40,931 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-16 19:28:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:28:40,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1261004467, now seen corresponding path program 1 times [2025-03-16 19:28:40,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:40,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366616213] [2025-03-16 19:28:40,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:40,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:40,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:28:40,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:28:40,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:40,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:41,237 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-16 19:28:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:41,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366616213] [2025-03-16 19:28:41,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366616213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:41,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:41,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:28:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385640030] [2025-03-16 19:28:41,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:41,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:28:41,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:41,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:28:41,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:28:41,239 INFO L87 Difference]: Start difference. First operand 22950 states and 35572 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-16 19:28:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:41,310 INFO L93 Difference]: Finished difference Result 23528 states and 36437 transitions. [2025-03-16 19:28:41,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:28:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-16 19:28:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:41,351 INFO L225 Difference]: With dead ends: 23528 [2025-03-16 19:28:41,352 INFO L226 Difference]: Without dead ends: 23526 [2025-03-16 19:28:41,360 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-16 19:28:41,361 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:41,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1110 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23526 states. [2025-03-16 19:28:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23526 to 23526. [2025-03-16 19:28:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.536578108395324) internal successors, (36148), 23525 states have internal predecessors, (36148), 0 states have call successors, (0), 0 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-16 19:28:41,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 36148 transitions. [2025-03-16 19:28:41,789 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 36148 transitions. Word has length 81 [2025-03-16 19:28:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:41,789 INFO L471 AbstractCegarLoop]: Abstraction has 23526 states and 36148 transitions. [2025-03-16 19:28:41,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 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-16 19:28:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 36148 transitions. [2025-03-16 19:28:41,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:41,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:41,794 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-16 19:28:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:28:41,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 441206478, now seen corresponding path program 1 times [2025-03-16 19:28:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968757326] [2025-03-16 19:28:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:41,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:41,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:41,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:41,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:42,098 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-16 19:28:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:42,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968757326] [2025-03-16 19:28:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968757326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:42,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:42,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:42,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672314260] [2025-03-16 19:28:42,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:42,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:42,100 INFO L87 Difference]: Start difference. First operand 23526 states and 36148 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:42,807 INFO L93 Difference]: Finished difference Result 53563 states and 81726 transitions. [2025-03-16 19:28:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:42,866 INFO L225 Difference]: With dead ends: 53563 [2025-03-16 19:28:42,867 INFO L226 Difference]: Without dead ends: 35180 [2025-03-16 19:28:42,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:28:42,885 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1336 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:42,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 932 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35180 states. [2025-03-16 19:28:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35180 to 23725. [2025-03-16 19:28:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23725 states, 23724 states have (on average 1.5346906086663294) internal successors, (36409), 23724 states have internal predecessors, (36409), 0 states have call successors, (0), 0 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-16 19:28:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23725 states to 23725 states and 36409 transitions. [2025-03-16 19:28:43,305 INFO L78 Accepts]: Start accepts. Automaton has 23725 states and 36409 transitions. Word has length 82 [2025-03-16 19:28:43,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:43,305 INFO L471 AbstractCegarLoop]: Abstraction has 23725 states and 36409 transitions. [2025-03-16 19:28:43,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23725 states and 36409 transitions. [2025-03-16 19:28:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:43,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:43,312 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-16 19:28:43,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:28:43,312 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:43,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash 998059982, now seen corresponding path program 1 times [2025-03-16 19:28:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:43,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36746081] [2025-03-16 19:28:43,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:43,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:43,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:43,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:43,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:43,559 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-16 19:28:43,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:43,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36746081] [2025-03-16 19:28:43,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36746081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:43,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:43,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:43,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829543629] [2025-03-16 19:28:43,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:43,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:43,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:43,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:43,561 INFO L87 Difference]: Start difference. First operand 23725 states and 36409 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:44,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:44,218 INFO L93 Difference]: Finished difference Result 39390 states and 59889 transitions. [2025-03-16 19:28:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:44,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:44,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:44,261 INFO L225 Difference]: With dead ends: 39390 [2025-03-16 19:28:44,262 INFO L226 Difference]: Without dead ends: 31036 [2025-03-16 19:28:44,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-16 19:28:44,279 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 1310 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:44,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 986 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31036 states. [2025-03-16 19:28:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31036 to 24186. [2025-03-16 19:28:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24186 states, 24185 states have (on average 1.5332230721521605) internal successors, (37081), 24185 states have internal predecessors, (37081), 0 states have call successors, (0), 0 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-16 19:28:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24186 states to 24186 states and 37081 transitions. [2025-03-16 19:28:44,821 INFO L78 Accepts]: Start accepts. Automaton has 24186 states and 37081 transitions. Word has length 82 [2025-03-16 19:28:44,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:44,821 INFO L471 AbstractCegarLoop]: Abstraction has 24186 states and 37081 transitions. [2025-03-16 19:28:44,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24186 states and 37081 transitions. [2025-03-16 19:28:44,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:44,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:44,827 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-16 19:28:44,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:28:44,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:44,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:44,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1149041586, now seen corresponding path program 1 times [2025-03-16 19:28:44,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909567435] [2025-03-16 19:28:44,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:44,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:44,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:44,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:44,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:45,085 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-16 19:28:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:45,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909567435] [2025-03-16 19:28:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909567435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:45,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:45,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576399992] [2025-03-16 19:28:45,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:45,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:45,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:45,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:45,087 INFO L87 Difference]: Start difference. First operand 24186 states and 37081 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:45,608 INFO L93 Difference]: Finished difference Result 30587 states and 46567 transitions. [2025-03-16 19:28:45,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 19:28:45,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:45,643 INFO L225 Difference]: With dead ends: 30587 [2025-03-16 19:28:45,644 INFO L226 Difference]: Without dead ends: 27500 [2025-03-16 19:28:45,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-16 19:28:45,656 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1119 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:45,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 904 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:28:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27500 states. [2025-03-16 19:28:45,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27500 to 24186. [2025-03-16 19:28:45,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24186 states, 24185 states have (on average 1.533057680380401) internal successors, (37077), 24185 states have internal predecessors, (37077), 0 states have call successors, (0), 0 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-16 19:28:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24186 states to 24186 states and 37077 transitions. [2025-03-16 19:28:45,973 INFO L78 Accepts]: Start accepts. Automaton has 24186 states and 37077 transitions. Word has length 82 [2025-03-16 19:28:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:45,973 INFO L471 AbstractCegarLoop]: Abstraction has 24186 states and 37077 transitions. [2025-03-16 19:28:45,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24186 states and 37077 transitions. [2025-03-16 19:28:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-16 19:28:45,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:45,980 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-16 19:28:45,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:28:45,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1821009074, now seen corresponding path program 1 times [2025-03-16 19:28:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114221913] [2025-03-16 19:28:45,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:45,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:45,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-16 19:28:46,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-16 19:28:46,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:46,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:46,205 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-16 19:28:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114221913] [2025-03-16 19:28:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114221913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256287184] [2025-03-16 19:28:46,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:46,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:46,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:46,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:46,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:46,207 INFO L87 Difference]: Start difference. First operand 24186 states and 37077 transitions. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:46,885 INFO L93 Difference]: Finished difference Result 47531 states and 72339 transitions. [2025-03-16 19:28:46,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:46,885 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:46,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:46,924 INFO L225 Difference]: With dead ends: 47531 [2025-03-16 19:28:46,924 INFO L226 Difference]: Without dead ends: 33907 [2025-03-16 19:28:46,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:28:46,943 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1198 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 990 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33907 states. [2025-03-16 19:28:47,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33907 to 24772. [2025-03-16 19:28:47,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24772 states, 24771 states have (on average 1.5282790359694804) internal successors, (37857), 24771 states have internal predecessors, (37857), 0 states have call successors, (0), 0 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-16 19:28:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24772 states to 24772 states and 37857 transitions. [2025-03-16 19:28:47,282 INFO L78 Accepts]: Start accepts. Automaton has 24772 states and 37857 transitions. Word has length 82 [2025-03-16 19:28:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:47,282 INFO L471 AbstractCegarLoop]: Abstraction has 24772 states and 37857 transitions. [2025-03-16 19:28:47,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 8 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-16 19:28:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 24772 states and 37857 transitions. [2025-03-16 19:28:47,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:47,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:47,291 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-16 19:28:47,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:28:47,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:47,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:47,291 INFO L85 PathProgramCache]: Analyzing trace with hash 175542733, now seen corresponding path program 1 times [2025-03-16 19:28:47,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319172860] [2025-03-16 19:28:47,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:47,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:47,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:47,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:47,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:47,647 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-16 19:28:47,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:47,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319172860] [2025-03-16 19:28:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319172860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:47,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:47,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:28:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834574130] [2025-03-16 19:28:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:28:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:47,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:28:47,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:28:47,648 INFO L87 Difference]: Start difference. First operand 24772 states and 37857 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-16 19:28:48,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:48,363 INFO L93 Difference]: Finished difference Result 62322 states and 94991 transitions. [2025-03-16 19:28:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 19:28:48,364 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-16 19:28:48,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:48,407 INFO L225 Difference]: With dead ends: 62322 [2025-03-16 19:28:48,407 INFO L226 Difference]: Without dead ends: 38968 [2025-03-16 19:28:48,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2025-03-16 19:28:48,429 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1266 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:48,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 1014 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:28:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38968 states. [2025-03-16 19:28:48,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38968 to 25147. [2025-03-16 19:28:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25147 states, 25146 states have (on average 1.5227471566054243) internal successors, (38291), 25146 states have internal predecessors, (38291), 0 states have call successors, (0), 0 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-16 19:28:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25147 states to 25147 states and 38291 transitions. [2025-03-16 19:28:48,881 INFO L78 Accepts]: Start accepts. Automaton has 25147 states and 38291 transitions. Word has length 83 [2025-03-16 19:28:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:48,881 INFO L471 AbstractCegarLoop]: Abstraction has 25147 states and 38291 transitions. [2025-03-16 19:28:48,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 8 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-16 19:28:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 25147 states and 38291 transitions. [2025-03-16 19:28:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:48,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:48,888 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-16 19:28:48,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:28:48,888 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:48,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:48,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1906434713, now seen corresponding path program 1 times [2025-03-16 19:28:48,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:48,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154206496] [2025-03-16 19:28:48,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:48,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:48,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:48,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:48,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:48,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:49,029 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-16 19:28:49,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:49,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154206496] [2025-03-16 19:28:49,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154206496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:49,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:49,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:28:49,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760020881] [2025-03-16 19:28:49,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:49,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:28:49,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:49,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:28:49,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:49,031 INFO L87 Difference]: Start difference. First operand 25147 states and 38291 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 19:28:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:49,205 INFO L93 Difference]: Finished difference Result 67551 states and 103213 transitions. [2025-03-16 19:28:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:28:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 19:28:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:49,261 INFO L225 Difference]: With dead ends: 67551 [2025-03-16 19:28:49,261 INFO L226 Difference]: Without dead ends: 44829 [2025-03-16 19:28:49,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:28:49,289 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 191 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:49,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 697 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44829 states. [2025-03-16 19:28:49,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44829 to 44555. [2025-03-16 19:28:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44555 states, 44554 states have (on average 1.5131974682407865) internal successors, (67419), 44554 states have internal predecessors, (67419), 0 states have call successors, (0), 0 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-16 19:28:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44555 states to 44555 states and 67419 transitions. [2025-03-16 19:28:49,873 INFO L78 Accepts]: Start accepts. Automaton has 44555 states and 67419 transitions. Word has length 83 [2025-03-16 19:28:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:49,874 INFO L471 AbstractCegarLoop]: Abstraction has 44555 states and 67419 transitions. [2025-03-16 19:28:49,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 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-16 19:28:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 44555 states and 67419 transitions. [2025-03-16 19:28:49,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:49,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:49,880 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-16 19:28:49,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:28:49,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:49,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1422695109, now seen corresponding path program 1 times [2025-03-16 19:28:49,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:49,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084639449] [2025-03-16 19:28:49,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:49,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:49,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:49,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:49,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:49,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:49,931 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-16 19:28:49,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:49,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084639449] [2025-03-16 19:28:49,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084639449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:49,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:49,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:49,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603074710] [2025-03-16 19:28:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:49,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:49,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:49,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:49,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:49,933 INFO L87 Difference]: Start difference. First operand 44555 states and 67419 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:50,164 INFO L93 Difference]: Finished difference Result 87476 states and 132629 transitions. [2025-03-16 19:28:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:50,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:50,240 INFO L225 Difference]: With dead ends: 87476 [2025-03-16 19:28:50,240 INFO L226 Difference]: Without dead ends: 56754 [2025-03-16 19:28:50,275 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-16 19:28:50,275 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 185 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:50,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 541 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:50,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56754 states. [2025-03-16 19:28:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56754 to 56280. [2025-03-16 19:28:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56280 states, 56279 states have (on average 1.4962064002558682) internal successors, (84205), 56279 states have internal predecessors, (84205), 0 states have call successors, (0), 0 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-16 19:28:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56280 states to 56280 states and 84205 transitions. [2025-03-16 19:28:51,073 INFO L78 Accepts]: Start accepts. Automaton has 56280 states and 84205 transitions. Word has length 83 [2025-03-16 19:28:51,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:51,073 INFO L471 AbstractCegarLoop]: Abstraction has 56280 states and 84205 transitions. [2025-03-16 19:28:51,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand 56280 states and 84205 transitions. [2025-03-16 19:28:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:51,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:51,079 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-16 19:28:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:28:51,079 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1788199692, now seen corresponding path program 1 times [2025-03-16 19:28:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602175458] [2025-03-16 19:28:51,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:51,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:51,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:51,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:51,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:51,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:51,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602175458] [2025-03-16 19:28:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602175458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894962627] [2025-03-16 19:28:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:51,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:51,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:51,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:51,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:51,118 INFO L87 Difference]: Start difference. First operand 56280 states and 84205 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:51,286 INFO L93 Difference]: Finished difference Result 77787 states and 116196 transitions. [2025-03-16 19:28:51,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:51,366 INFO L225 Difference]: With dead ends: 77787 [2025-03-16 19:28:51,367 INFO L226 Difference]: Without dead ends: 62145 [2025-03-16 19:28:51,394 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-16 19:28:51,394 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 166 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:51,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 544 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62145 states. [2025-03-16 19:28:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62145 to 55143. [2025-03-16 19:28:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55143 states, 55142 states have (on average 1.47528199920206) internal successors, (81350), 55142 states have internal predecessors, (81350), 0 states have call successors, (0), 0 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-16 19:28:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55143 states to 55143 states and 81350 transitions. [2025-03-16 19:28:52,036 INFO L78 Accepts]: Start accepts. Automaton has 55143 states and 81350 transitions. Word has length 83 [2025-03-16 19:28:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 55143 states and 81350 transitions. [2025-03-16 19:28:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 55143 states and 81350 transitions. [2025-03-16 19:28:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:52,042 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-16 19:28:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:28:52,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 816554843, now seen corresponding path program 1 times [2025-03-16 19:28:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763551766] [2025-03-16 19:28:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:52,080 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-16 19:28:52,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:52,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763551766] [2025-03-16 19:28:52,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763551766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:52,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:52,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330073887] [2025-03-16 19:28:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:52,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:52,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:52,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:52,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:52,081 INFO L87 Difference]: Start difference. First operand 55143 states and 81350 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:52,660 INFO L93 Difference]: Finished difference Result 126013 states and 186185 transitions. [2025-03-16 19:28:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:52,740 INFO L225 Difference]: With dead ends: 126013 [2025-03-16 19:28:52,740 INFO L226 Difference]: Without dead ends: 76607 [2025-03-16 19:28:52,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:52,763 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 199 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:52,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 546 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76607 states. [2025-03-16 19:28:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76607 to 54255. [2025-03-16 19:28:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54255 states, 54254 states have (on average 1.4608876764846832) internal successors, (79259), 54254 states have internal predecessors, (79259), 0 states have call successors, (0), 0 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-16 19:28:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54255 states to 54255 states and 79259 transitions. [2025-03-16 19:28:53,570 INFO L78 Accepts]: Start accepts. Automaton has 54255 states and 79259 transitions. Word has length 83 [2025-03-16 19:28:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:53,571 INFO L471 AbstractCegarLoop]: Abstraction has 54255 states and 79259 transitions. [2025-03-16 19:28:53,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 54255 states and 79259 transitions. [2025-03-16 19:28:53,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 19:28:53,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:53,577 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-16 19:28:53,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:28:53,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:53,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:53,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1616999002, now seen corresponding path program 1 times [2025-03-16 19:28:53,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:53,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513043656] [2025-03-16 19:28:53,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:53,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:53,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 19:28:53,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 19:28:53,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:53,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:53,628 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-16 19:28:53,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:53,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513043656] [2025-03-16 19:28:53,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513043656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:53,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:53,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:53,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222907296] [2025-03-16 19:28:53,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:53,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:53,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:53,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:53,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:53,629 INFO L87 Difference]: Start difference. First operand 54255 states and 79259 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:53,927 INFO L93 Difference]: Finished difference Result 85100 states and 124274 transitions. [2025-03-16 19:28:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:53,992 INFO L225 Difference]: With dead ends: 85100 [2025-03-16 19:28:53,992 INFO L226 Difference]: Without dead ends: 57698 [2025-03-16 19:28:54,021 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-16 19:28:54,021 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 171 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:54,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 553 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:54,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57698 states. [2025-03-16 19:28:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57698 to 57152. [2025-03-16 19:28:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57152 states, 57151 states have (on average 1.4344805865164214) internal successors, (81982), 57151 states have internal predecessors, (81982), 0 states have call successors, (0), 0 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-16 19:28:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57152 states to 57152 states and 81982 transitions. [2025-03-16 19:28:54,636 INFO L78 Accepts]: Start accepts. Automaton has 57152 states and 81982 transitions. Word has length 83 [2025-03-16 19:28:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:54,636 INFO L471 AbstractCegarLoop]: Abstraction has 57152 states and 81982 transitions. [2025-03-16 19:28:54,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-16 19:28:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 57152 states and 81982 transitions. [2025-03-16 19:28:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:54,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:54,641 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-16 19:28:54,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:28:54,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:54,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash 162833435, now seen corresponding path program 1 times [2025-03-16 19:28:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180727968] [2025-03-16 19:28:54,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:54,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:54,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:28:54,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:54,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180727968] [2025-03-16 19:28:54,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180727968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:54,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:54,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:28:54,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979168342] [2025-03-16 19:28:54,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:54,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:28:54,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:54,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:28:54,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:28:54,814 INFO L87 Difference]: Start difference. First operand 57152 states and 81982 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-16 19:28:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:55,047 INFO L93 Difference]: Finished difference Result 120074 states and 171829 transitions. [2025-03-16 19:28:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:28:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-16 19:28:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:55,132 INFO L225 Difference]: With dead ends: 120074 [2025-03-16 19:28:55,132 INFO L226 Difference]: Without dead ends: 68656 [2025-03-16 19:28:55,175 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-16 19:28:55,176 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 189 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:55,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 617 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:28:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68656 states. [2025-03-16 19:28:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68656 to 68166. [2025-03-16 19:28:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68166 states, 68165 states have (on average 1.4034035061981955) internal successors, (95663), 68165 states have internal predecessors, (95663), 0 states have call successors, (0), 0 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-16 19:28:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68166 states to 68166 states and 95663 transitions. [2025-03-16 19:28:56,249 INFO L78 Accepts]: Start accepts. Automaton has 68166 states and 95663 transitions. Word has length 84 [2025-03-16 19:28:56,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:56,249 INFO L471 AbstractCegarLoop]: Abstraction has 68166 states and 95663 transitions. [2025-03-16 19:28:56,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 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-16 19:28:56,249 INFO L276 IsEmpty]: Start isEmpty. Operand 68166 states and 95663 transitions. [2025-03-16 19:28:56,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:56,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:56,253 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-16 19:28:56,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 19:28:56,253 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:56,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:56,253 INFO L85 PathProgramCache]: Analyzing trace with hash 536461869, now seen corresponding path program 1 times [2025-03-16 19:28:56,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345900832] [2025-03-16 19:28:56,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:56,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:56,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:56,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:56,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:56,334 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-16 19:28:56,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:56,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345900832] [2025-03-16 19:28:56,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345900832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:56,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:56,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:56,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414219368] [2025-03-16 19:28:56,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:56,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:56,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:56,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:56,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:56,335 INFO L87 Difference]: Start difference. First operand 68166 states and 95663 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:28:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:56,722 INFO L93 Difference]: Finished difference Result 173740 states and 245968 transitions. [2025-03-16 19:28:56,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:56,722 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:28:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:56,895 INFO L225 Difference]: With dead ends: 173740 [2025-03-16 19:28:56,895 INFO L226 Difference]: Without dead ends: 144206 [2025-03-16 19:28:56,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:56,950 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 1660 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1660 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:56,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1660 Valid, 1625 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144206 states. [2025-03-16 19:28:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144206 to 97372. [2025-03-16 19:28:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97372 states, 97371 states have (on average 1.4038060613529695) internal successors, (136690), 97371 states have internal predecessors, (136690), 0 states have call successors, (0), 0 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-16 19:28:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97372 states to 97372 states and 136690 transitions. [2025-03-16 19:28:58,451 INFO L78 Accepts]: Start accepts. Automaton has 97372 states and 136690 transitions. Word has length 84 [2025-03-16 19:28:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:28:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 97372 states and 136690 transitions. [2025-03-16 19:28:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:28:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 97372 states and 136690 transitions. [2025-03-16 19:28:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:28:58,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:28:58,457 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-16 19:28:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 19:28:58,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:28:58,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:28:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash -6950537, now seen corresponding path program 1 times [2025-03-16 19:28:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:28:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299287414] [2025-03-16 19:28:58,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:28:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:28:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:28:58,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:28:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:28:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:28:58,563 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-16 19:28:58,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:28:58,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299287414] [2025-03-16 19:28:58,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299287414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:28:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:28:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:28:58,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498788440] [2025-03-16 19:28:58,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:28:58,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:28:58,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:28:58,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:28:58,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:28:58,565 INFO L87 Difference]: Start difference. First operand 97372 states and 136690 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:28:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:28:59,120 INFO L93 Difference]: Finished difference Result 183712 states and 259703 transitions. [2025-03-16 19:28:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:28:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:28:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:28:59,588 INFO L225 Difference]: With dead ends: 183712 [2025-03-16 19:28:59,589 INFO L226 Difference]: Without dead ends: 168050 [2025-03-16 19:28:59,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:28:59,623 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1796 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:28:59,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 1707 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:28:59,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168050 states. [2025-03-16 19:29:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168050 to 107236. [2025-03-16 19:29:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107236 states, 107235 states have (on average 1.4056138387653285) internal successors, (150731), 107235 states have internal predecessors, (150731), 0 states have call successors, (0), 0 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-16 19:29:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107236 states to 107236 states and 150731 transitions. [2025-03-16 19:29:01,014 INFO L78 Accepts]: Start accepts. Automaton has 107236 states and 150731 transitions. Word has length 84 [2025-03-16 19:29:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:01,014 INFO L471 AbstractCegarLoop]: Abstraction has 107236 states and 150731 transitions. [2025-03-16 19:29:01,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 107236 states and 150731 transitions. [2025-03-16 19:29:01,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:01,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:01,019 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-16 19:29:01,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 19:29:01,019 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:01,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1398854679, now seen corresponding path program 1 times [2025-03-16 19:29:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468382191] [2025-03-16 19:29:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:01,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:01,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:01,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:01,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:01,091 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-16 19:29:01,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:01,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468382191] [2025-03-16 19:29:01,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468382191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:01,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:01,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:01,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132505588] [2025-03-16 19:29:01,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:01,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:01,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:01,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:01,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:01,093 INFO L87 Difference]: Start difference. First operand 107236 states and 150731 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:01,872 INFO L93 Difference]: Finished difference Result 181984 states and 257006 transitions. [2025-03-16 19:29:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:01,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:02,102 INFO L225 Difference]: With dead ends: 181984 [2025-03-16 19:29:02,102 INFO L226 Difference]: Without dead ends: 174962 [2025-03-16 19:29:02,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:29:02,138 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 1721 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1721 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:02,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1721 Valid, 1709 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174962 states. [2025-03-16 19:29:03,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174962 to 114148. [2025-03-16 19:29:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114148 states, 114147 states have (on average 1.405888897649522) internal successors, (160478), 114147 states have internal predecessors, (160478), 0 states have call successors, (0), 0 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-16 19:29:03,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114148 states to 114148 states and 160478 transitions. [2025-03-16 19:29:03,937 INFO L78 Accepts]: Start accepts. Automaton has 114148 states and 160478 transitions. Word has length 84 [2025-03-16 19:29:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:03,938 INFO L471 AbstractCegarLoop]: Abstraction has 114148 states and 160478 transitions. [2025-03-16 19:29:03,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 114148 states and 160478 transitions. [2025-03-16 19:29:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-16 19:29:03,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:03,942 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-16 19:29:03,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 19:29:03,942 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:03,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:03,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1059573327, now seen corresponding path program 1 times [2025-03-16 19:29:03,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:03,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369476139] [2025-03-16 19:29:03,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:03,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:03,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-16 19:29:03,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-16 19:29:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:04,016 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-16 19:29:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369476139] [2025-03-16 19:29:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369476139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:04,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791697632] [2025-03-16 19:29:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:04,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:04,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:04,017 INFO L87 Difference]: Start difference. First operand 114148 states and 160478 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:04,796 INFO L93 Difference]: Finished difference Result 214280 states and 302887 transitions. [2025-03-16 19:29:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:04,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:04,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:05,018 INFO L225 Difference]: With dead ends: 214280 [2025-03-16 19:29:05,018 INFO L226 Difference]: Without dead ends: 190266 [2025-03-16 19:29:05,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:29:05,056 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1595 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1595 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:05,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1595 Valid, 1949 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:29:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190266 states. [2025-03-16 19:29:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190266 to 125818. [2025-03-16 19:29:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125818 states, 125817 states have (on average 1.4076873554448126) internal successors, (177111), 125817 states have internal predecessors, (177111), 0 states have call successors, (0), 0 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-16 19:29:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125818 states to 125818 states and 177111 transitions. [2025-03-16 19:29:07,099 INFO L78 Accepts]: Start accepts. Automaton has 125818 states and 177111 transitions. Word has length 84 [2025-03-16 19:29:07,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:07,099 INFO L471 AbstractCegarLoop]: Abstraction has 125818 states and 177111 transitions. [2025-03-16 19:29:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 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-16 19:29:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 125818 states and 177111 transitions. [2025-03-16 19:29:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-16 19:29:07,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:07,103 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-16 19:29:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 19:29:07,103 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:07,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:07,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1226759246, now seen corresponding path program 1 times [2025-03-16 19:29:07,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:07,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241772881] [2025-03-16 19:29:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:07,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:07,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-16 19:29:07,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-16 19:29:07,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:07,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:07,185 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-16 19:29:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:07,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241772881] [2025-03-16 19:29:07,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241772881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:07,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:07,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:29:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45656267] [2025-03-16 19:29:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:07,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:07,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:07,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:07,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:07,187 INFO L87 Difference]: Start difference. First operand 125818 states and 177111 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-16 19:29:07,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:07,791 INFO L93 Difference]: Finished difference Result 252678 states and 356972 transitions. [2025-03-16 19:29:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:29:07,791 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-16 19:29:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:08,474 INFO L225 Difference]: With dead ends: 252678 [2025-03-16 19:29:08,474 INFO L226 Difference]: Without dead ends: 219416 [2025-03-16 19:29:08,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:29:08,506 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 1667 mSDsluCounter, 1416 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:08,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 1868 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:29:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219416 states. [2025-03-16 19:29:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219416 to 142896. [2025-03-16 19:29:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142896 states, 142895 states have (on average 1.4082228209524477) internal successors, (201228), 142895 states have internal predecessors, (201228), 0 states have call successors, (0), 0 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-16 19:29:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142896 states to 142896 states and 201228 transitions. [2025-03-16 19:29:10,476 INFO L78 Accepts]: Start accepts. Automaton has 142896 states and 201228 transitions. Word has length 85 [2025-03-16 19:29:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:10,476 INFO L471 AbstractCegarLoop]: Abstraction has 142896 states and 201228 transitions. [2025-03-16 19:29:10,476 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-16 19:29:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 142896 states and 201228 transitions. [2025-03-16 19:29:10,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:10,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:10,485 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] [2025-03-16 19:29:10,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 19:29:10,485 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:10,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1894338275, now seen corresponding path program 1 times [2025-03-16 19:29:10,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:10,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022442593] [2025-03-16 19:29:10,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:10,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:10,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:10,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:10,606 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-16 19:29:10,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:10,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022442593] [2025-03-16 19:29:10,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022442593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:10,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:10,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:10,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788316964] [2025-03-16 19:29:10,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:10,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:10,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:10,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:10,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:10,608 INFO L87 Difference]: Start difference. First operand 142896 states and 201228 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-16 19:29:12,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:12,219 INFO L93 Difference]: Finished difference Result 363606 states and 511673 transitions. [2025-03-16 19:29:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:12,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 19:29:12,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:12,606 INFO L225 Difference]: With dead ends: 363606 [2025-03-16 19:29:12,606 INFO L226 Difference]: Without dead ends: 310380 [2025-03-16 19:29:12,684 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-16 19:29:12,684 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2114 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:12,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 571 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 19:29:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310380 states. [2025-03-16 19:29:14,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310380 to 142920. [2025-03-16 19:29:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142920 states, 142919 states have (on average 1.4082102449639307) internal successors, (201260), 142919 states have internal predecessors, (201260), 0 states have call successors, (0), 0 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-16 19:29:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142920 states to 142920 states and 201260 transitions. [2025-03-16 19:29:15,171 INFO L78 Accepts]: Start accepts. Automaton has 142920 states and 201260 transitions. Word has length 89 [2025-03-16 19:29:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:29:15,171 INFO L471 AbstractCegarLoop]: Abstraction has 142920 states and 201260 transitions. [2025-03-16 19:29:15,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-16 19:29:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 142920 states and 201260 transitions. [2025-03-16 19:29:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-16 19:29:15,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:29:15,178 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] [2025-03-16 19:29:15,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 19:29:15,178 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:29:15,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:29:15,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1292124277, now seen corresponding path program 1 times [2025-03-16 19:29:15,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:29:15,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217033601] [2025-03-16 19:29:15,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:29:15,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:29:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-16 19:29:15,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-16 19:29:15,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:29:15,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:29:15,567 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-16 19:29:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:29:15,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217033601] [2025-03-16 19:29:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217033601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:29:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:29:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:29:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177689971] [2025-03-16 19:29:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:29:15,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:29:15,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:29:15,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:29:15,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:29:15,568 INFO L87 Difference]: Start difference. First operand 142920 states and 201260 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-16 19:29:16,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:29:16,953 INFO L93 Difference]: Finished difference Result 400455 states and 559701 transitions. [2025-03-16 19:29:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:29:16,953 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2025-03-16 19:29:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:29:17,491 INFO L225 Difference]: With dead ends: 400455 [2025-03-16 19:29:17,491 INFO L226 Difference]: Without dead ends: 352425 [2025-03-16 19:29:17,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:29:17,631 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 1804 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:29:17,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 541 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:29:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352425 states.