./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:09:00,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:09:00,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:09:00,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:09:00,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:09:00,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:09:00,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:09:00,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:09:00,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:09:00,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:09:00,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:09:00,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:09:00,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:09:00,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:09:00,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:09:00,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:09:00,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:09:00,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:09:00,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:00,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:09:00,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:09:00,285 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 -> ccd47f3526eef69b5bf2f51fee8d66c64e4c81e1dda46c7d333fbe79bb4350dd [2025-03-03 15:09:00,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:09:00,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:09:00,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:09:00,528 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:09:00,528 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:09:00,529 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.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:01,682 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e213973d/0ac9bc97dd394643b0eaac7f1a246c1b/FLAGbf4a6bf8f [2025-03-03 15:09:01,965 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:09:01,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:01,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e213973d/0ac9bc97dd394643b0eaac7f1a246c1b/FLAGbf4a6bf8f [2025-03-03 15:09:02,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e213973d/0ac9bc97dd394643b0eaac7f1a246c1b [2025-03-03 15:09:02,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:09:02,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:09:02,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:02,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:09:02,265 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:09:02,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02, skipping insertion in model container [2025-03-03 15:09:02,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:09:02,481 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.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2025-03-03 15:09:02,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:02,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:09:02,595 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.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c[8609,8622] [2025-03-03 15:09:02,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:09:02,641 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:09:02,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02 WrapperNode [2025-03-03 15:09:02,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:09:02,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:02,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:09:02,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:09:02,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,695 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 881 [2025-03-03 15:09:02,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:09:02,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:09:02,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:09:02,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:09:02,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 15:09:02,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,731 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:09:02,732 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:09:02,732 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:09:02,732 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:09:02,733 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (1/1) ... [2025-03-03 15:09:02,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:09:02,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:09:02,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 15:09:02,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 15:09:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:09:02,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:09:02,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:09:02,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:09:02,884 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:09:02,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L565: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L499: havoc main_~node3__m3~2#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L765: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1327: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1195: havoc main_~node4____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L238: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L967: havoc main_~node5____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L407: havoc main_~node5__m5~1#1;havoc main_~node4__m4~1#1;havoc main_~node3__m3~1#1;havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L939: havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L280: havoc main_~node5__m5~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1239: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L679: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:03,460 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L481: havoc main_~node2__m2~2#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L217: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L517: havoc main_~node4__m4~2#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L852: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L259: havoc main_~node4__m4~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1283: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1151: havoc main_~node5____CPAchecker_TMP_1~1#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L824: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L593: havoc main_~node4____CPAchecker_TMP_1~0#1; [2025-03-03 15:09:03,461 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L462: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-03 15:09:03,509 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2025-03-03 15:09:03,509 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:09:03,523 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:09:03,525 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:09:03,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:03 BoogieIcfgContainer [2025-03-03 15:09:03,527 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:09:03,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:09:03,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:09:03,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:09:03,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:09:02" (1/3) ... [2025-03-03 15:09:03,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f09f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:03, skipping insertion in model container [2025-03-03 15:09:03,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:09:02" (2/3) ... [2025-03-03 15:09:03,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f09f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:09:03, skipping insertion in model container [2025-03-03 15:09:03,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:09:03" (3/3) ... [2025-03-03 15:09:03,534 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c [2025-03-03 15:09:03,543 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:09:03,545 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.BOUNDED-10.pals.c.v+nlh-reducer.c that has 1 procedures, 216 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:09:03,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:09:03,593 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;@4b00e52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:09:03,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:09:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 15:09:03,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:03,602 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:03,603 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1721993025, now seen corresponding path program 1 times [2025-03-03 15:09:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:03,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-03-03 15:09:03,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:03,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:03,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 15:09:03,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 15:09:03,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:03,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:04,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:04,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:04,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104768167] [2025-03-03 15:09:04,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104768167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:04,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:04,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:04,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874932718] [2025-03-03 15:09:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:04,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:04,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:04,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:04,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:04,237 INFO L87 Difference]: Start difference. First operand has 216 states, 214 states have (on average 1.719626168224299) internal successors, (368), 215 states have internal predecessors, (368), 0 states have call successors, (0), 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.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:04,467 INFO L93 Difference]: Finished difference Result 868 states and 1404 transitions. [2025-03-03 15:09:04,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:04,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2025-03-03 15:09:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:04,481 INFO L225 Difference]: With dead ends: 868 [2025-03-03 15:09:04,481 INFO L226 Difference]: Without dead ends: 748 [2025-03-03 15:09:04,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:04,487 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 2252 mSDsluCounter, 2659 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2252 SdHoareTripleChecker+Valid, 3032 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:04,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2252 Valid, 3032 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-03 15:09:04,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 329. [2025-03-03 15:09:04,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 1.5) internal successors, (492), 328 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 492 transitions. [2025-03-03 15:09:04,525 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 492 transitions. Word has length 81 [2025-03-03 15:09:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:04,526 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 492 transitions. [2025-03-03 15:09:04,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 492 transitions. [2025-03-03 15:09:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 15:09:04,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:04,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:04,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:09:04,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:04,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:04,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1841215373, now seen corresponding path program 1 times [2025-03-03 15:09:04,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:04,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177000158] [2025-03-03 15:09:04,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:04,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:04,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 15:09:04,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 15:09:04,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:04,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:04,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:04,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177000158] [2025-03-03 15:09:04,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177000158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:04,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:04,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:04,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499654438] [2025-03-03 15:09:04,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:04,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:04,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:04,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:04,804 INFO L87 Difference]: Start difference. First operand 329 states and 492 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:04,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:04,976 INFO L93 Difference]: Finished difference Result 1425 states and 2199 transitions. [2025-03-03 15:09:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:04,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2025-03-03 15:09:04,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:04,981 INFO L225 Difference]: With dead ends: 1425 [2025-03-03 15:09:04,981 INFO L226 Difference]: Without dead ends: 1177 [2025-03-03 15:09:04,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:04,983 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1231 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:04,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1557 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:04,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-03 15:09:05,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1169. [2025-03-03 15:09:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1168 states have (on average 1.538527397260274) internal successors, (1797), 1168 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1797 transitions. [2025-03-03 15:09:05,021 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1797 transitions. Word has length 82 [2025-03-03 15:09:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,021 INFO L471 AbstractCegarLoop]: Abstraction has 1169 states and 1797 transitions. [2025-03-03 15:09:05,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1797 transitions. [2025-03-03 15:09:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:05,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:05,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:05,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:09:05,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:05,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:05,025 INFO L85 PathProgramCache]: Analyzing trace with hash 127113211, now seen corresponding path program 1 times [2025-03-03 15:09:05,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:05,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729082653] [2025-03-03 15:09:05,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:05,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:05,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:05,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:05,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729082653] [2025-03-03 15:09:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729082653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664586065] [2025-03-03 15:09:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:05,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:05,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:05,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:05,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:05,157 INFO L87 Difference]: Start difference. First operand 1169 states and 1797 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:05,408 INFO L93 Difference]: Finished difference Result 3173 states and 4935 transitions. [2025-03-03 15:09:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:05,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:05,416 INFO L225 Difference]: With dead ends: 3173 [2025-03-03 15:09:05,416 INFO L226 Difference]: Without dead ends: 2063 [2025-03-03 15:09:05,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:05,420 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1197 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:05,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 294 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-03-03 15:09:05,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2061. [2025-03-03 15:09:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2061 states, 2060 states have (on average 1.5475728155339805) internal successors, (3188), 2060 states have internal predecessors, (3188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3188 transitions. [2025-03-03 15:09:05,465 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3188 transitions. Word has length 83 [2025-03-03 15:09:05,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,465 INFO L471 AbstractCegarLoop]: Abstraction has 2061 states and 3188 transitions. [2025-03-03 15:09:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3188 transitions. [2025-03-03 15:09:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:05,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:05,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:09:05,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1190830243, now seen corresponding path program 1 times [2025-03-03 15:09:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:05,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477449475] [2025-03-03 15:09:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:05,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:05,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:05,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:05,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:05,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:05,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:05,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477449475] [2025-03-03 15:09:05,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477449475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:05,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:05,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:05,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967182153] [2025-03-03 15:09:05,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:05,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:05,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:05,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:05,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:05,608 INFO L87 Difference]: Start difference. First operand 2061 states and 3188 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:05,832 INFO L93 Difference]: Finished difference Result 5626 states and 8764 transitions. [2025-03-03 15:09:05,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:05,832 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:05,842 INFO L225 Difference]: With dead ends: 5626 [2025-03-03 15:09:05,842 INFO L226 Difference]: Without dead ends: 3677 [2025-03-03 15:09:05,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:05,846 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1127 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:05,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 298 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2025-03-03 15:09:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3675. [2025-03-03 15:09:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3675 states, 3674 states have (on average 1.5484485574305933) internal successors, (5689), 3674 states have internal predecessors, (5689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3675 states to 3675 states and 5689 transitions. [2025-03-03 15:09:05,909 INFO L78 Accepts]: Start accepts. Automaton has 3675 states and 5689 transitions. Word has length 83 [2025-03-03 15:09:05,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:05,909 INFO L471 AbstractCegarLoop]: Abstraction has 3675 states and 5689 transitions. [2025-03-03 15:09:05,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:05,909 INFO L276 IsEmpty]: Start isEmpty. Operand 3675 states and 5689 transitions. [2025-03-03 15:09:05,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:05,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:05,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:09:05,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:05,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1252109321, now seen corresponding path program 1 times [2025-03-03 15:09:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118838810] [2025-03-03 15:09:05,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:05,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:05,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:05,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:05,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:05,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:06,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118838810] [2025-03-03 15:09:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118838810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:06,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:06,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700045625] [2025-03-03 15:09:06,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:06,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:06,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:06,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:06,035 INFO L87 Difference]: Start difference. First operand 3675 states and 5689 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03 15:09:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:06,257 INFO L93 Difference]: Finished difference Result 10406 states and 16202 transitions. [2025-03-03 15:09:06,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:06,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:06,276 INFO L225 Difference]: With dead ends: 10406 [2025-03-03 15:09:06,277 INFO L226 Difference]: Without dead ends: 6877 [2025-03-03 15:09:06,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:06,281 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1113 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:06,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 307 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6877 states. [2025-03-03 15:09:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6877 to 6875. [2025-03-03 15:09:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6875 states, 6874 states have (on average 1.5496072155949956) internal successors, (10652), 6874 states have internal predecessors, (10652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6875 states to 6875 states and 10652 transitions. [2025-03-03 15:09:06,411 INFO L78 Accepts]: Start accepts. Automaton has 6875 states and 10652 transitions. Word has length 83 [2025-03-03 15:09:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:06,411 INFO L471 AbstractCegarLoop]: Abstraction has 6875 states and 10652 transitions. [2025-03-03 15:09:06,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6875 states and 10652 transitions. [2025-03-03 15:09:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:06,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:06,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:09:06,414 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash -485968049, now seen corresponding path program 1 times [2025-03-03 15:09:06,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:06,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722491810] [2025-03-03 15:09:06,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:06,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:06,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:06,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:06,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:06,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:06,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:06,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722491810] [2025-03-03 15:09:06,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722491810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:06,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:06,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:06,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456691074] [2025-03-03 15:09:06,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:06,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:06,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:06,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:06,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:06,540 INFO L87 Difference]: Start difference. First operand 6875 states and 10652 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03 15:09:06,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:06,755 INFO L93 Difference]: Finished difference Result 20166 states and 31321 transitions. [2025-03-03 15:09:06,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:06,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:06,793 INFO L225 Difference]: With dead ends: 20166 [2025-03-03 15:09:06,793 INFO L226 Difference]: Without dead ends: 13373 [2025-03-03 15:09:06,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:06,805 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1147 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:06,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 296 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13373 states. [2025-03-03 15:09:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13373 to 13371. [2025-03-03 15:09:06,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13371 states, 13370 states have (on average 1.5446522064323112) internal successors, (20652), 13370 states have internal predecessors, (20652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:07,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13371 states to 13371 states and 20652 transitions. [2025-03-03 15:09:07,027 INFO L78 Accepts]: Start accepts. Automaton has 13371 states and 20652 transitions. Word has length 83 [2025-03-03 15:09:07,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:07,028 INFO L471 AbstractCegarLoop]: Abstraction has 13371 states and 20652 transitions. [2025-03-03 15:09:07,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 13371 states and 20652 transitions. [2025-03-03 15:09:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 15:09:07,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:07,031 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:07,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:09:07,031 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:07,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 891699879, now seen corresponding path program 1 times [2025-03-03 15:09:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-03-03 15:09:07,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:07,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 15:09:07,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 15:09:07,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:07,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:07,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:07,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322940970] [2025-03-03 15:09:07,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322940970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:07,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:07,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:07,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188295233] [2025-03-03 15:09:07,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:07,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:07,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:07,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:07,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:07,149 INFO L87 Difference]: Start difference. First operand 13371 states and 20652 transitions. Second operand has 5 states, 5 states have (on average 16.6) 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-03 15:09:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:07,421 INFO L93 Difference]: Finished difference Result 39778 states and 61517 transitions. [2025-03-03 15:09:07,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:07,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:07,467 INFO L225 Difference]: With dead ends: 39778 [2025-03-03 15:09:07,467 INFO L226 Difference]: Without dead ends: 26450 [2025-03-03 15:09:07,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:07,488 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1203 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:07,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 292 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:09:07,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26450 states. [2025-03-03 15:09:07,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26450 to 26448. [2025-03-03 15:09:07,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26448 states, 26447 states have (on average 1.535939804136575) internal successors, (40621), 26447 states have internal predecessors, (40621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26448 states to 26448 states and 40621 transitions. [2025-03-03 15:09:07,983 INFO L78 Accepts]: Start accepts. Automaton has 26448 states and 40621 transitions. Word has length 83 [2025-03-03 15:09:07,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:07,983 INFO L471 AbstractCegarLoop]: Abstraction has 26448 states and 40621 transitions. [2025-03-03 15:09:07,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) 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-03 15:09:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 26448 states and 40621 transitions. [2025-03-03 15:09:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-03 15:09:07,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:07,989 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:09:07,989 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1846989109, now seen corresponding path program 1 times [2025-03-03 15:09:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446882438] [2025-03-03 15:09:07,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:08,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-03 15:09:08,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-03 15:09:08,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:08,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:08,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446882438] [2025-03-03 15:09:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446882438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:09:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441754396] [2025-03-03 15:09:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:08,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:09:08,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:08,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:09:08,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:08,255 INFO L87 Difference]: Start difference. First operand 26448 states and 40621 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:08,353 INFO L93 Difference]: Finished difference Result 27090 states and 41582 transitions. [2025-03-03 15:09:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:09:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2025-03-03 15:09:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:08,395 INFO L225 Difference]: With dead ends: 27090 [2025-03-03 15:09:08,395 INFO L226 Difference]: Without dead ends: 27088 [2025-03-03 15:09:08,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:09:08,413 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:08,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1162 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27088 states. [2025-03-03 15:09:08,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27088 to 27088. [2025-03-03 15:09:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27088 states, 27087 states have (on average 1.523276848672795) internal successors, (41261), 27087 states have internal predecessors, (41261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27088 states to 27088 states and 41261 transitions. [2025-03-03 15:09:08,870 INFO L78 Accepts]: Start accepts. Automaton has 27088 states and 41261 transitions. Word has length 84 [2025-03-03 15:09:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:08,871 INFO L471 AbstractCegarLoop]: Abstraction has 27088 states and 41261 transitions. [2025-03-03 15:09:08,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 27088 states and 41261 transitions. [2025-03-03 15:09:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 15:09:08,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:08,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:09:08,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:09:08,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:08,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:08,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1426861629, now seen corresponding path program 1 times [2025-03-03 15:09:08,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:08,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270150020] [2025-03-03 15:09:08,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:08,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:08,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 15:09:08,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 15:09:08,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:08,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:09,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:09,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270150020] [2025-03-03 15:09:09,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270150020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:09,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:09:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290839861] [2025-03-03 15:09:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:09,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 15:09:09,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:09,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 15:09:09,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:09,042 INFO L87 Difference]: Start difference. First operand 27088 states and 41261 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:09,230 INFO L93 Difference]: Finished difference Result 76308 states and 115935 transitions. [2025-03-03 15:09:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 15:09:09,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-03 15:09:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:09,316 INFO L225 Difference]: With dead ends: 76308 [2025-03-03 15:09:09,316 INFO L226 Difference]: Without dead ends: 50066 [2025-03-03 15:09:09,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 15:09:09,347 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 242 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:09,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 719 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50066 states. [2025-03-03 15:09:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50066 to 50064. [2025-03-03 15:09:09,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50064 states, 50063 states have (on average 1.5100373529353015) internal successors, (75597), 50063 states have internal predecessors, (75597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:10,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50064 states to 50064 states and 75597 transitions. [2025-03-03 15:09:10,013 INFO L78 Accepts]: Start accepts. Automaton has 50064 states and 75597 transitions. Word has length 85 [2025-03-03 15:09:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:10,013 INFO L471 AbstractCegarLoop]: Abstraction has 50064 states and 75597 transitions. [2025-03-03 15:09:10,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 50064 states and 75597 transitions. [2025-03-03 15:09:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:10,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:10,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, 1, 1] [2025-03-03 15:09:10,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:09:10,019 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:10,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:10,020 INFO L85 PathProgramCache]: Analyzing trace with hash -934823683, now seen corresponding path program 1 times [2025-03-03 15:09:10,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:10,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280288440] [2025-03-03 15:09:10,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:10,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:10,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:10,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:10,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:10,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280288440] [2025-03-03 15:09:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280288440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:10,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:10,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414556770] [2025-03-03 15:09:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:10,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:10,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:10,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:10,078 INFO L87 Difference]: Start difference. First operand 50064 states and 75597 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:10,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:10,464 INFO L93 Difference]: Finished difference Result 129517 states and 195816 transitions. [2025-03-03 15:09:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:10,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:10,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:10,575 INFO L225 Difference]: With dead ends: 129517 [2025-03-03 15:09:10,576 INFO L226 Difference]: Without dead ends: 87242 [2025-03-03 15:09:10,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:10,607 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 212 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:10,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 567 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87242 states. [2025-03-03 15:09:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87242 to 87112. [2025-03-03 15:09:11,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87112 states, 87111 states have (on average 1.5034266625340083) internal successors, (130965), 87111 states have internal predecessors, (130965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87112 states to 87112 states and 130965 transitions. [2025-03-03 15:09:12,054 INFO L78 Accepts]: Start accepts. Automaton has 87112 states and 130965 transitions. Word has length 86 [2025-03-03 15:09:12,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:12,054 INFO L471 AbstractCegarLoop]: Abstraction has 87112 states and 130965 transitions. [2025-03-03 15:09:12,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,054 INFO L276 IsEmpty]: Start isEmpty. Operand 87112 states and 130965 transitions. [2025-03-03 15:09:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:12,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:12,062 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] [2025-03-03 15:09:12,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:09:12,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:12,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:12,064 INFO L85 PathProgramCache]: Analyzing trace with hash 299013980, now seen corresponding path program 1 times [2025-03-03 15:09:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:12,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512728452] [2025-03-03 15:09:12,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:12,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:12,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:12,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:12,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:12,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:12,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512728452] [2025-03-03 15:09:12,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512728452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:12,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:12,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:12,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344316624] [2025-03-03 15:09:12,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:12,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:12,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:12,295 INFO L87 Difference]: Start difference. First operand 87112 states and 130965 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:12,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:12,972 INFO L93 Difference]: Finished difference Result 218877 states and 330362 transitions. [2025-03-03 15:09:12,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:12,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:12,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:13,202 INFO L225 Difference]: With dead ends: 218877 [2025-03-03 15:09:13,203 INFO L226 Difference]: Without dead ends: 179515 [2025-03-03 15:09:13,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:13,228 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 1668 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:13,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 1956 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:13,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179515 states. [2025-03-03 15:09:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179515 to 124003. [2025-03-03 15:09:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124003 states, 124002 states have (on average 1.5025725391525944) internal successors, (186322), 124002 states have internal predecessors, (186322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124003 states to 124003 states and 186322 transitions. [2025-03-03 15:09:15,040 INFO L78 Accepts]: Start accepts. Automaton has 124003 states and 186322 transitions. Word has length 86 [2025-03-03 15:09:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:15,040 INFO L471 AbstractCegarLoop]: Abstraction has 124003 states and 186322 transitions. [2025-03-03 15:09:15,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:15,040 INFO L276 IsEmpty]: Start isEmpty. Operand 124003 states and 186322 transitions. [2025-03-03 15:09:15,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:15,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:15,052 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] [2025-03-03 15:09:15,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:09:15,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:15,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash -932156067, now seen corresponding path program 1 times [2025-03-03 15:09:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719185094] [2025-03-03 15:09:15,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:15,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:15,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:15,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:15,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:15,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:15,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:15,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719185094] [2025-03-03 15:09:15,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719185094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:15,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:15,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:15,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862453036] [2025-03-03 15:09:15,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:15,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:15,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:15,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:15,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:15,114 INFO L87 Difference]: Start difference. First operand 124003 states and 186322 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:15,815 INFO L93 Difference]: Finished difference Result 250609 states and 376092 transitions. [2025-03-03 15:09:15,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:16,298 INFO L225 Difference]: With dead ends: 250609 [2025-03-03 15:09:16,298 INFO L226 Difference]: Without dead ends: 158855 [2025-03-03 15:09:16,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:16,339 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 192 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:16,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 565 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158855 states. [2025-03-03 15:09:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158855 to 157528. [2025-03-03 15:09:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157528 states, 157527 states have (on average 1.4824696718657755) internal successors, (233529), 157527 states have internal predecessors, (233529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:18,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157528 states to 157528 states and 233529 transitions. [2025-03-03 15:09:18,506 INFO L78 Accepts]: Start accepts. Automaton has 157528 states and 233529 transitions. Word has length 86 [2025-03-03 15:09:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:18,506 INFO L471 AbstractCegarLoop]: Abstraction has 157528 states and 233529 transitions. [2025-03-03 15:09:18,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:18,506 INFO L276 IsEmpty]: Start isEmpty. Operand 157528 states and 233529 transitions. [2025-03-03 15:09:18,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:18,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:18,516 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] [2025-03-03 15:09:18,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:09:18,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:18,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:18,519 INFO L85 PathProgramCache]: Analyzing trace with hash -778223876, now seen corresponding path program 1 times [2025-03-03 15:09:18,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:18,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986896427] [2025-03-03 15:09:18,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:18,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:18,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:18,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:18,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:18,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986896427] [2025-03-03 15:09:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986896427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:18,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:18,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:18,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869623423] [2025-03-03 15:09:18,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:18,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:18,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:18,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:18,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:18,570 INFO L87 Difference]: Start difference. First operand 157528 states and 233529 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:19,609 INFO L93 Difference]: Finished difference Result 268263 states and 396474 transitions. [2025-03-03 15:09:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:19,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:19,869 INFO L225 Difference]: With dead ends: 268263 [2025-03-03 15:09:19,869 INFO L226 Difference]: Without dead ends: 180157 [2025-03-03 15:09:19,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:19,930 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 180 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:19,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 563 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180157 states. [2025-03-03 15:09:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180157 to 178581. [2025-03-03 15:09:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178581 states, 178580 states have (on average 1.4576604322992497) internal successors, (260309), 178580 states have internal predecessors, (260309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:22,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178581 states to 178581 states and 260309 transitions. [2025-03-03 15:09:22,481 INFO L78 Accepts]: Start accepts. Automaton has 178581 states and 260309 transitions. Word has length 86 [2025-03-03 15:09:22,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:22,482 INFO L471 AbstractCegarLoop]: Abstraction has 178581 states and 260309 transitions. [2025-03-03 15:09:22,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:22,482 INFO L276 IsEmpty]: Start isEmpty. Operand 178581 states and 260309 transitions. [2025-03-03 15:09:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:22,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:22,492 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] [2025-03-03 15:09:22,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:09:22,492 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:22,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1380250090, now seen corresponding path program 1 times [2025-03-03 15:09:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402106251] [2025-03-03 15:09:22,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:22,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:22,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:22,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:22,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402106251] [2025-03-03 15:09:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402106251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:09:22,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030643203] [2025-03-03 15:09:22,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:22,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:09:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:22,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:09:22,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:22,542 INFO L87 Difference]: Start difference. First operand 178581 states and 260309 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:23,203 INFO L93 Difference]: Finished difference Result 248121 states and 360147 transitions. [2025-03-03 15:09:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:09:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:23,544 INFO L225 Difference]: With dead ends: 248121 [2025-03-03 15:09:23,544 INFO L226 Difference]: Without dead ends: 183715 [2025-03-03 15:09:23,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:09:23,634 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 172 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:23,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 564 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:09:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183715 states. [2025-03-03 15:09:25,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183715 to 164525. [2025-03-03 15:09:25,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164525 states, 164524 states have (on average 1.4352738810143202) internal successors, (236137), 164524 states have internal predecessors, (236137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164525 states to 164525 states and 236137 transitions. [2025-03-03 15:09:26,380 INFO L78 Accepts]: Start accepts. Automaton has 164525 states and 236137 transitions. Word has length 86 [2025-03-03 15:09:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:26,380 INFO L471 AbstractCegarLoop]: Abstraction has 164525 states and 236137 transitions. [2025-03-03 15:09:26,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 164525 states and 236137 transitions. [2025-03-03 15:09:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:26,390 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] [2025-03-03 15:09:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:09:26,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:26,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash -695634436, now seen corresponding path program 1 times [2025-03-03 15:09:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:26,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-03-03 15:09:26,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:26,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:26,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:26,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:26,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:26,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:26,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:26,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438417931] [2025-03-03 15:09:26,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438417931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:26,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:26,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:26,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060973946] [2025-03-03 15:09:26,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:26,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:26,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:26,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:26,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:26,506 INFO L87 Difference]: Start difference. First operand 164525 states and 236137 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:27,284 INFO L93 Difference]: Finished difference Result 287307 states and 414493 transitions. [2025-03-03 15:09:27,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:28,052 INFO L225 Difference]: With dead ends: 287307 [2025-03-03 15:09:28,052 INFO L226 Difference]: Without dead ends: 263443 [2025-03-03 15:09:28,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:28,108 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 1947 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1947 SdHoareTripleChecker+Valid, 1726 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:28,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1947 Valid, 1726 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263443 states. [2025-03-03 15:09:30,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263443 to 188087. [2025-03-03 15:09:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188087 states, 188086 states have (on average 1.4353806237572175) internal successors, (269975), 188086 states have internal predecessors, (269975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188087 states to 188087 states and 269975 transitions. [2025-03-03 15:09:30,655 INFO L78 Accepts]: Start accepts. Automaton has 188087 states and 269975 transitions. Word has length 86 [2025-03-03 15:09:30,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:30,656 INFO L471 AbstractCegarLoop]: Abstraction has 188087 states and 269975 transitions. [2025-03-03 15:09:30,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:30,656 INFO L276 IsEmpty]: Start isEmpty. Operand 188087 states and 269975 transitions. [2025-03-03 15:09:30,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:30,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:30,669 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] [2025-03-03 15:09:30,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:09:30,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:30,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:30,669 INFO L85 PathProgramCache]: Analyzing trace with hash 861667478, now seen corresponding path program 1 times [2025-03-03 15:09:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099667054] [2025-03-03 15:09:30,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:30,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:30,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:30,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:30,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:30,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099667054] [2025-03-03 15:09:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099667054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436543295] [2025-03-03 15:09:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:30,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:30,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:30,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:30,797 INFO L87 Difference]: Start difference. First operand 188087 states and 269975 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:32,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:32,024 INFO L93 Difference]: Finished difference Result 284577 states and 410199 transitions. [2025-03-03 15:09:32,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:32,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:32,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:32,499 INFO L225 Difference]: With dead ends: 284577 [2025-03-03 15:09:32,499 INFO L226 Difference]: Without dead ends: 273937 [2025-03-03 15:09:32,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:32,585 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 1791 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:32,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1791 Valid, 1795 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:32,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273937 states. [2025-03-03 15:09:34,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273937 to 198581. [2025-03-03 15:09:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198581 states, 198580 states have (on average 1.4355171719206365) internal successors, (285065), 198580 states have internal predecessors, (285065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:35,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198581 states to 198581 states and 285065 transitions. [2025-03-03 15:09:35,737 INFO L78 Accepts]: Start accepts. Automaton has 198581 states and 285065 transitions. Word has length 86 [2025-03-03 15:09:35,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:35,738 INFO L471 AbstractCegarLoop]: Abstraction has 198581 states and 285065 transitions. [2025-03-03 15:09:35,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 198581 states and 285065 transitions. [2025-03-03 15:09:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:35,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:35,749 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] [2025-03-03 15:09:35,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:09:35,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:35,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:35,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1953605853, now seen corresponding path program 1 times [2025-03-03 15:09:35,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:35,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265222198] [2025-03-03 15:09:35,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:35,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:35,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:35,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:35,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:35,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265222198] [2025-03-03 15:09:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265222198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:35,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894889024] [2025-03-03 15:09:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:35,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:35,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:35,876 INFO L87 Difference]: Start difference. First operand 198581 states and 285065 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:36,917 INFO L93 Difference]: Finished difference Result 333991 states and 481793 transitions. [2025-03-03 15:09:36,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:37,400 INFO L225 Difference]: With dead ends: 333991 [2025-03-03 15:09:37,400 INFO L226 Difference]: Without dead ends: 297287 [2025-03-03 15:09:37,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:37,924 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 1644 mSDsluCounter, 1716 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:37,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2176 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:09:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297287 states. [2025-03-03 15:09:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297287 to 226272. [2025-03-03 15:09:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226272 states, 226271 states have (on average 1.4366931688108506) internal successors, (325082), 226271 states have internal predecessors, (325082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226272 states to 226272 states and 325082 transitions. [2025-03-03 15:09:40,558 INFO L78 Accepts]: Start accepts. Automaton has 226272 states and 325082 transitions. Word has length 86 [2025-03-03 15:09:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:09:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 226272 states and 325082 transitions. [2025-03-03 15:09:40,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 226272 states and 325082 transitions. [2025-03-03 15:09:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 15:09:40,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:09:40,571 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] [2025-03-03 15:09:40,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:09:40,571 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:09:40,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:09:40,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1102037635, now seen corresponding path program 1 times [2025-03-03 15:09:40,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:09:40,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-03-03 15:09:40,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:09:40,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:09:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 15:09:40,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 15:09:40,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:09:40,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:09:40,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:09:40,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:09:40,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166870798] [2025-03-03 15:09:40,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166870798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:09:40,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:09:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 15:09:40,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052415352] [2025-03-03 15:09:40,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:09:40,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:09:40,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:09:40,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:09:40,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:09:40,668 INFO L87 Difference]: Start difference. First operand 226272 states and 325082 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:09:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:09:42,208 INFO L93 Difference]: Finished difference Result 381206 states and 549773 transitions. [2025-03-03 15:09:42,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 15:09:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 7 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-03 15:09:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:09:42,779 INFO L225 Difference]: With dead ends: 381206 [2025-03-03 15:09:42,780 INFO L226 Difference]: Without dead ends: 337516 [2025-03-03 15:09:42,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 15:09:42,903 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1789 mSDsluCounter, 1595 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:09:42,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 2073 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]