./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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.3.ufo.BOUNDED-6.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 c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 15:06:13,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 15:06:13,420 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 15:06:13,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 15:06:13,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 15:06:13,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 15:06:13,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 15:06:13,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 15:06:13,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 15:06:13,442 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 15:06:13,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 15:06:13,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 15:06:13,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 15:06:13,443 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 15:06:13,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:13,444 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 15:06:13,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 15:06:13,446 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 -> c39b660f273ecbdfa60a013e46dad0637949d26902d1f41ae3834ad8e3310564 [2025-03-03 15:06:13,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 15:06:13,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 15:06:13,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 15:06:13,679 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 15:06:13,679 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 15:06:13,680 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:06:14,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cf679f8/a26ff40196be48fda713124db0630c0e/FLAG4bee6cea9 [2025-03-03 15:06:15,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 15:06:15,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:06:15,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cf679f8/a26ff40196be48fda713124db0630c0e/FLAG4bee6cea9 [2025-03-03 15:06:15,396 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61cf679f8/a26ff40196be48fda713124db0630c0e [2025-03-03 15:06:15,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 15:06:15,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 15:06:15,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:15,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 15:06:15,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 15:06:15,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c79eda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15, skipping insertion in model container [2025-03-03 15:06:15,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 15:06:15,601 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2025-03-03 15:06:15,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:15,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 15:06:15,690 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.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c[7469,7482] [2025-03-03 15:06:15,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 15:06:15,725 INFO L204 MainTranslator]: Completed translation [2025-03-03 15:06:15,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15 WrapperNode [2025-03-03 15:06:15,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 15:06:15,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:15,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 15:06:15,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 15:06:15,730 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:06:15" (1/1) ... [2025-03-03 15:06:15,737 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:06:15" (1/1) ... [2025-03-03 15:06:15,763 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 665 [2025-03-03 15:06:15,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 15:06:15,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 15:06:15,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 15:06:15,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 15:06:15,775 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,796 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:06:15,796 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,806 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,812 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 15:06:15,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 15:06:15,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 15:06:15,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 15:06:15,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (1/1) ... [2025-03-03 15:06:15,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 15:06:15,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:15,849 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:06:15,851 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:06:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 15:06:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 15:06:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 15:06:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 15:06:15,943 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 15:06:15,944 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 15:06:16,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L598: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:16,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:16,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L334: havoc main_~node2__m2~2#1; [2025-03-03 15:06:16,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L483: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L137: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L352: havoc main_~node3__m3~2#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L684: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L570: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L455: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc main_~node1__m1~3#1;havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L656: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989: havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: 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;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_~node3____CPAchecker_TMP_0~0#1; [2025-03-03 15:06:16,385 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L742: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-03 15:06:16,411 INFO L? ?]: Removed 89 outVars from TransFormulas that were not future-live. [2025-03-03 15:06:16,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 15:06:16,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 15:06:16,421 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 15:06:16,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:16 BoogieIcfgContainer [2025-03-03 15:06:16,421 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 15:06:16,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 15:06:16,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 15:06:16,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 15:06:16,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 03:06:15" (1/3) ... [2025-03-03 15:06:16,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed4062c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:16, skipping insertion in model container [2025-03-03 15:06:16,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 03:06:15" (2/3) ... [2025-03-03 15:06:16,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed4062c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 03:06:16, skipping insertion in model container [2025-03-03 15:06:16,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 03:06:16" (3/3) ... [2025-03-03 15:06:16,431 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2025-03-03 15:06:16,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 15:06:16,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c that has 1 procedures, 162 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 15:06:16,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 15:06:16,489 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;@58a075db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 15:06:16,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 15:06:16,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 0 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:06:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 15:06:16,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:16,498 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] [2025-03-03 15:06:16,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1491072562, now seen corresponding path program 1 times [2025-03-03 15:06:16,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:16,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128686093] [2025-03-03 15:06:16,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:16,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:16,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 15:06:16,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 15:06:16,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:16,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:16,895 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:06:16,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128686093] [2025-03-03 15:06:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128686093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:16,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542328022] [2025-03-03 15:06:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:16,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:16,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:16,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:16,918 INFO L87 Difference]: Start difference. First operand has 162 states, 160 states have (on average 1.70625) internal successors, (273), 161 states have internal predecessors, (273), 0 states have call successors, (0), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:06:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,085 INFO L93 Difference]: Finished difference Result 517 states and 836 transitions. [2025-03-03 15:06:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:17,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 15:06:17,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,097 INFO L225 Difference]: With dead ends: 517 [2025-03-03 15:06:17,097 INFO L226 Difference]: Without dead ends: 438 [2025-03-03 15:06:17,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:06:17,102 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 913 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:17,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1288 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-03-03 15:06:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 256. [2025-03-03 15:06:17,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4980392156862745) internal successors, (382), 255 states have internal predecessors, (382), 0 states have call successors, (0), 0 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:06:17,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2025-03-03 15:06:17,146 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 50 [2025-03-03 15:06:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,146 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2025-03-03 15:06:17,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:06:17,146 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2025-03-03 15:06:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:06:17,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,147 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] [2025-03-03 15:06:17,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 15:06:17,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,148 INFO L85 PathProgramCache]: Analyzing trace with hash -437478874, now seen corresponding path program 1 times [2025-03-03 15:06:17,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294796332] [2025-03-03 15:06:17,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:06:17,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:06:17,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,259 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:06:17,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:17,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294796332] [2025-03-03 15:06:17,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294796332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:17,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:17,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:17,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183006181] [2025-03-03 15:06:17,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:17,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:17,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:17,261 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,294 INFO L93 Difference]: Finished difference Result 628 states and 954 transitions. [2025-03-03 15:06:17,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:17,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:06:17,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,298 INFO L225 Difference]: With dead ends: 628 [2025-03-03 15:06:17,298 INFO L226 Difference]: Without dead ends: 430 [2025-03-03 15:06:17,299 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:06:17,300 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 158 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:17,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 420 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-03 15:06:17,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 428. [2025-03-03 15:06:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 1.484777517564403) internal successors, (634), 427 states have internal predecessors, (634), 0 states have call successors, (0), 0 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:06:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 634 transitions. [2025-03-03 15:06:17,323 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 634 transitions. Word has length 53 [2025-03-03 15:06:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 634 transitions. [2025-03-03 15:06:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 634 transitions. [2025-03-03 15:06:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:06:17,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,325 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] [2025-03-03 15:06:17,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 15:06:17,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 755976069, now seen corresponding path program 1 times [2025-03-03 15:06:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027704312] [2025-03-03 15:06:17,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:06:17,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:06:17,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,444 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:06:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027704312] [2025-03-03 15:06:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027704312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:17,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:17,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10962680] [2025-03-03 15:06:17,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:17,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:17,446 INFO L87 Difference]: Start difference. First operand 428 states and 634 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,468 INFO L93 Difference]: Finished difference Result 1078 states and 1615 transitions. [2025-03-03 15:06:17,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:17,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:06:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,471 INFO L225 Difference]: With dead ends: 1078 [2025-03-03 15:06:17,471 INFO L226 Difference]: Without dead ends: 750 [2025-03-03 15:06:17,472 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:06:17,473 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 157 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 434 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:06:17,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-03-03 15:06:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2025-03-03 15:06:17,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 747 states have (on average 1.4725568942436413) internal successors, (1100), 747 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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:06:17,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1100 transitions. [2025-03-03 15:06:17,489 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1100 transitions. Word has length 53 [2025-03-03 15:06:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,489 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1100 transitions. [2025-03-03 15:06:17,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1100 transitions. [2025-03-03 15:06:17,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 15:06:17,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:17,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 15:06:17,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1992273542, now seen corresponding path program 1 times [2025-03-03 15:06:17,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175419] [2025-03-03 15:06:17,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 15:06:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 15:06:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,562 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:06:17,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175419] [2025-03-03 15:06:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:17,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109102441] [2025-03-03 15:06:17,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:17,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:17,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:17,565 INFO L87 Difference]: Start difference. First operand 748 states and 1100 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,594 INFO L93 Difference]: Finished difference Result 1859 states and 2747 transitions. [2025-03-03 15:06:17,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:17,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 15:06:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,599 INFO L225 Difference]: With dead ends: 1859 [2025-03-03 15:06:17,599 INFO L226 Difference]: Without dead ends: 1295 [2025-03-03 15:06:17,600 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:06:17,600 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 434 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:06:17,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 434 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-03-03 15:06:17,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1293. [2025-03-03 15:06:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 1292 states have (on average 1.4504643962848298) internal successors, (1874), 1292 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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:06:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1874 transitions. [2025-03-03 15:06:17,624 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1874 transitions. Word has length 53 [2025-03-03 15:06:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,624 INFO L471 AbstractCegarLoop]: Abstraction has 1293 states and 1874 transitions. [2025-03-03 15:06:17,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:06:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1874 transitions. [2025-03-03 15:06:17,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:06:17,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:17,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 15:06:17,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash 280394173, now seen corresponding path program 1 times [2025-03-03 15:06:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537936813] [2025-03-03 15:06:17,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:06:17,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:06:17,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:17,744 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:06:17,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:17,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537936813] [2025-03-03 15:06:17,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537936813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:17,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:17,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:17,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801408229] [2025-03-03 15:06:17,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:17,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:17,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:17,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:17,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:17,746 INFO L87 Difference]: Start difference. First operand 1293 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:17,841 INFO L93 Difference]: Finished difference Result 2516 states and 3713 transitions. [2025-03-03 15:06:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:17,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:06:17,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:17,849 INFO L225 Difference]: With dead ends: 2516 [2025-03-03 15:06:17,849 INFO L226 Difference]: Without dead ends: 2150 [2025-03-03 15:06:17,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:17,851 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 623 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:17,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 992 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:17,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2025-03-03 15:06:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1728. [2025-03-03 15:06:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.457440648523451) internal successors, (2517), 1727 states have internal predecessors, (2517), 0 states have call successors, (0), 0 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:06:17,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2517 transitions. [2025-03-03 15:06:17,891 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2517 transitions. Word has length 54 [2025-03-03 15:06:17,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:17,893 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2517 transitions. [2025-03-03 15:06:17,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2517 transitions. [2025-03-03 15:06:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:06:17,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:17,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:17,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 15:06:17,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:17,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:17,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2098766610, now seen corresponding path program 1 times [2025-03-03 15:06:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:17,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434030271] [2025-03-03 15:06:17,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:17,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:06:17,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:06:17,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,022 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:06:18,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434030271] [2025-03-03 15:06:18,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434030271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:18,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677043245] [2025-03-03 15:06:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:18,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:18,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:18,024 INFO L87 Difference]: Start difference. First operand 1728 states and 2517 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:18,097 INFO L93 Difference]: Finished difference Result 2915 states and 4303 transitions. [2025-03-03 15:06:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:06:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:18,106 INFO L225 Difference]: With dead ends: 2915 [2025-03-03 15:06:18,106 INFO L226 Difference]: Without dead ends: 2549 [2025-03-03 15:06:18,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:18,108 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 629 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:18,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 975 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-03-03 15:06:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2064. [2025-03-03 15:06:18,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 2063 states have (on average 1.4624333494910324) internal successors, (3017), 2063 states have internal predecessors, (3017), 0 states have call successors, (0), 0 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:06:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 3017 transitions. [2025-03-03 15:06:18,162 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 3017 transitions. Word has length 54 [2025-03-03 15:06:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:18,163 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 3017 transitions. [2025-03-03 15:06:18,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 3017 transitions. [2025-03-03 15:06:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 15:06:18,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:18,165 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] [2025-03-03 15:06:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 15:06:18,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1259121654, now seen corresponding path program 1 times [2025-03-03 15:06:18,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:18,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766786890] [2025-03-03 15:06:18,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:18,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:18,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-03 15:06:18,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 15:06:18,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:18,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,262 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:06:18,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766786890] [2025-03-03 15:06:18,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766786890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:18,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834224256] [2025-03-03 15:06:18,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:18,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:18,264 INFO L87 Difference]: Start difference. First operand 2064 states and 3017 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:18,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:18,342 INFO L93 Difference]: Finished difference Result 3367 states and 4972 transitions. [2025-03-03 15:06:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2025-03-03 15:06:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:18,351 INFO L225 Difference]: With dead ends: 3367 [2025-03-03 15:06:18,351 INFO L226 Difference]: Without dead ends: 3001 [2025-03-03 15:06:18,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:18,355 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 632 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:18,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1129 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:18,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-03-03 15:06:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2382. [2025-03-03 15:06:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 2381 states have (on average 1.4666106677866442) internal successors, (3492), 2381 states have internal predecessors, (3492), 0 states have call successors, (0), 0 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:06:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 3492 transitions. [2025-03-03 15:06:18,401 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 3492 transitions. Word has length 54 [2025-03-03 15:06:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:18,401 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 3492 transitions. [2025-03-03 15:06:18,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:06:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 3492 transitions. [2025-03-03 15:06:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:06:18,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:18,405 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] [2025-03-03 15:06:18,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 15:06:18,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash -892469633, now seen corresponding path program 1 times [2025-03-03 15:06:18,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:18,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34728694] [2025-03-03 15:06:18,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:18,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:18,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:06:18,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:06:18,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:18,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,520 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:06:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34728694] [2025-03-03 15:06:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34728694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299408750] [2025-03-03 15:06:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:18,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:18,521 INFO L87 Difference]: Start difference. First operand 2382 states and 3492 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:06:18,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:18,727 INFO L93 Difference]: Finished difference Result 5655 states and 8292 transitions. [2025-03-03 15:06:18,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:18,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 15:06:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:18,737 INFO L225 Difference]: With dead ends: 5655 [2025-03-03 15:06:18,737 INFO L226 Difference]: Without dead ends: 3319 [2025-03-03 15:06:18,741 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:06:18,742 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 896 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:18,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 226 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:18,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-03-03 15:06:18,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 3301. [2025-03-03 15:06:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3301 states, 3300 states have (on average 1.455151515151515) internal successors, (4802), 3300 states have internal predecessors, (4802), 0 states have call successors, (0), 0 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:06:18,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 4802 transitions. [2025-03-03 15:06:18,815 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 4802 transitions. Word has length 58 [2025-03-03 15:06:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:18,815 INFO L471 AbstractCegarLoop]: Abstraction has 3301 states and 4802 transitions. [2025-03-03 15:06:18,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:06:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 4802 transitions. [2025-03-03 15:06:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-03 15:06:18,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:18,818 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] [2025-03-03 15:06:18,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 15:06:18,818 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:18,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:18,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1243377130, now seen corresponding path program 1 times [2025-03-03 15:06:18,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:18,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074911195] [2025-03-03 15:06:18,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-03 15:06:18,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-03 15:06:18,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:18,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:18,912 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:06:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074911195] [2025-03-03 15:06:18,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074911195] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:18,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:18,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:18,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190293965] [2025-03-03 15:06:18,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:18,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:18,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:18,914 INFO L87 Difference]: Start difference. First operand 3301 states and 4802 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:06:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:19,118 INFO L93 Difference]: Finished difference Result 7876 states and 11428 transitions. [2025-03-03 15:06:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:19,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2025-03-03 15:06:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:19,132 INFO L225 Difference]: With dead ends: 7876 [2025-03-03 15:06:19,132 INFO L226 Difference]: Without dead ends: 4603 [2025-03-03 15:06:19,137 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:06:19,139 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 883 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:19,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 208 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2025-03-03 15:06:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 4566. [2025-03-03 15:06:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4566 states, 4565 states have (on average 1.4297918948521358) internal successors, (6527), 4565 states have internal predecessors, (6527), 0 states have call successors, (0), 0 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:06:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4566 states to 4566 states and 6527 transitions. [2025-03-03 15:06:19,232 INFO L78 Accepts]: Start accepts. Automaton has 4566 states and 6527 transitions. Word has length 58 [2025-03-03 15:06:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:19,232 INFO L471 AbstractCegarLoop]: Abstraction has 4566 states and 6527 transitions. [2025-03-03 15:06:19,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 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:06:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 4566 states and 6527 transitions. [2025-03-03 15:06:19,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-03 15:06:19,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:19,235 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] [2025-03-03 15:06:19,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 15:06:19,236 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:19,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1969917559, now seen corresponding path program 1 times [2025-03-03 15:06:19,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:19,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902478828] [2025-03-03 15:06:19,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:19,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:19,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-03 15:06:19,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-03 15:06:19,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:19,339 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:06:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902478828] [2025-03-03 15:06:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902478828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 15:06:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642103583] [2025-03-03 15:06:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:19,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:19,341 INFO L87 Difference]: Start difference. First operand 4566 states and 6527 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:06:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:19,537 INFO L93 Difference]: Finished difference Result 10822 states and 15448 transitions. [2025-03-03 15:06:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:19,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-03 15:06:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:19,556 INFO L225 Difference]: With dead ends: 10822 [2025-03-03 15:06:19,556 INFO L226 Difference]: Without dead ends: 6338 [2025-03-03 15:06:19,560 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:06:19,560 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 835 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:19,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 228 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:06:19,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2025-03-03 15:06:19,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 6303. [2025-03-03 15:06:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6303 states, 6302 states have (on average 1.4136781973976515) internal successors, (8909), 6302 states have internal predecessors, (8909), 0 states have call successors, (0), 0 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:06:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6303 states to 6303 states and 8909 transitions. [2025-03-03 15:06:19,651 INFO L78 Accepts]: Start accepts. Automaton has 6303 states and 8909 transitions. Word has length 59 [2025-03-03 15:06:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:19,652 INFO L471 AbstractCegarLoop]: Abstraction has 6303 states and 8909 transitions. [2025-03-03 15:06:19,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 0 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:06:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6303 states and 8909 transitions. [2025-03-03 15:06:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:06:19,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:19,654 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] [2025-03-03 15:06:19,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 15:06:19,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:19,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1462825551, now seen corresponding path program 1 times [2025-03-03 15:06:19,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:19,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707410038] [2025-03-03 15:06:19,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:19,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:06:19,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:06:19,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:19,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:19,762 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:06:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707410038] [2025-03-03 15:06:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707410038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:19,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:19,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:19,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962813046] [2025-03-03 15:06:19,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:19,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:06:19,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:19,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:06:19,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:19,765 INFO L87 Difference]: Start difference. First operand 6303 states and 8909 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:20,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:20,070 INFO L93 Difference]: Finished difference Result 19262 states and 27115 transitions. [2025-03-03 15:06:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:20,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 15:06:20,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:20,105 INFO L225 Difference]: With dead ends: 19262 [2025-03-03 15:06:20,106 INFO L226 Difference]: Without dead ends: 16164 [2025-03-03 15:06:20,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:20,115 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 1445 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:20,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 386 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16164 states. [2025-03-03 15:06:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16164 to 6359. [2025-03-03 15:06:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6359 states, 6358 states have (on average 1.412079270210758) internal successors, (8978), 6358 states have internal predecessors, (8978), 0 states have call successors, (0), 0 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:06:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 8978 transitions. [2025-03-03 15:06:20,275 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 8978 transitions. Word has length 60 [2025-03-03 15:06:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:20,275 INFO L471 AbstractCegarLoop]: Abstraction has 6359 states and 8978 transitions. [2025-03-03 15:06:20,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:20,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 8978 transitions. [2025-03-03 15:06:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:06:20,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:20,278 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] [2025-03-03 15:06:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 15:06:20,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash -905158643, now seen corresponding path program 1 times [2025-03-03 15:06:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:20,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541214605] [2025-03-03 15:06:20,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:20,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:06:20,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:06:20,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:20,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:20,384 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:06:20,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:20,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541214605] [2025-03-03 15:06:20,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541214605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:20,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:20,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:20,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815905514] [2025-03-03 15:06:20,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:20,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:06:20,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:20,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:06:20,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:20,386 INFO L87 Difference]: Start difference. First operand 6359 states and 8978 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:20,639 INFO L93 Difference]: Finished difference Result 14325 states and 20136 transitions. [2025-03-03 15:06:20,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:20,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 15:06:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:20,655 INFO L225 Difference]: With dead ends: 14325 [2025-03-03 15:06:20,655 INFO L226 Difference]: Without dead ends: 11047 [2025-03-03 15:06:20,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:20,662 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1099 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:20,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 325 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11047 states. [2025-03-03 15:06:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11047 to 6379. [2025-03-03 15:06:20,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6379 states, 6378 states have (on average 1.4114142364377549) internal successors, (9002), 6378 states have internal predecessors, (9002), 0 states have call successors, (0), 0 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:06:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6379 states to 6379 states and 9002 transitions. [2025-03-03 15:06:20,783 INFO L78 Accepts]: Start accepts. Automaton has 6379 states and 9002 transitions. Word has length 60 [2025-03-03 15:06:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:20,783 INFO L471 AbstractCegarLoop]: Abstraction has 6379 states and 9002 transitions. [2025-03-03 15:06:20,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6379 states and 9002 transitions. [2025-03-03 15:06:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-03 15:06:20,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:20,786 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] [2025-03-03 15:06:20,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 15:06:20,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:20,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1528767602, now seen corresponding path program 1 times [2025-03-03 15:06:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463512082] [2025-03-03 15:06:20,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:20,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-03 15:06:20,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-03 15:06:20,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:20,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:20,881 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:06:20,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:20,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463512082] [2025-03-03 15:06:20,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463512082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524876631] [2025-03-03 15:06:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:20,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 15:06:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:20,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 15:06:20,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:20,883 INFO L87 Difference]: Start difference. First operand 6379 states and 9002 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:21,142 INFO L93 Difference]: Finished difference Result 16521 states and 23265 transitions. [2025-03-03 15:06:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 15:06:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2025-03-03 15:06:21,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:21,159 INFO L225 Difference]: With dead ends: 16521 [2025-03-03 15:06:21,159 INFO L226 Difference]: Without dead ends: 13415 [2025-03-03 15:06:21,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:06:21,166 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1280 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:21,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 373 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:21,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2025-03-03 15:06:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 6473. [2025-03-03 15:06:21,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6473 states, 6472 states have (on average 1.409610630407911) internal successors, (9123), 6472 states have internal predecessors, (9123), 0 states have call successors, (0), 0 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:06:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6473 states to 6473 states and 9123 transitions. [2025-03-03 15:06:21,264 INFO L78 Accepts]: Start accepts. Automaton has 6473 states and 9123 transitions. Word has length 60 [2025-03-03 15:06:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:21,264 INFO L471 AbstractCegarLoop]: Abstraction has 6473 states and 9123 transitions. [2025-03-03 15:06:21,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 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:06:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 6473 states and 9123 transitions. [2025-03-03 15:06:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:21,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:21,267 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] [2025-03-03 15:06:21,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 15:06:21,268 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:21,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1968296949, now seen corresponding path program 1 times [2025-03-03 15:06:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:21,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221853847] [2025-03-03 15:06:21,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:21,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:21,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:21,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:21,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:21,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:21,536 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:06:21,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221853847] [2025-03-03 15:06:21,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221853847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:21,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:06:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598785703] [2025-03-03 15:06:21,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:21,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:06:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:21,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:06:21,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:06:21,538 INFO L87 Difference]: Start difference. First operand 6473 states and 9123 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:22,016 INFO L93 Difference]: Finished difference Result 15340 states and 21713 transitions. [2025-03-03 15:06:22,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:06:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 15:06:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:22,031 INFO L225 Difference]: With dead ends: 15340 [2025-03-03 15:06:22,031 INFO L226 Difference]: Without dead ends: 10138 [2025-03-03 15:06:22,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:22,038 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 944 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:22,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 743 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:06:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10138 states. [2025-03-03 15:06:22,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10138 to 6341. [2025-03-03 15:06:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6341 states, 6340 states have (on average 1.407570977917981) internal successors, (8924), 6340 states have internal predecessors, (8924), 0 states have call successors, (0), 0 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:06:22,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6341 states to 6341 states and 8924 transitions. [2025-03-03 15:06:22,118 INFO L78 Accepts]: Start accepts. Automaton has 6341 states and 8924 transitions. Word has length 62 [2025-03-03 15:06:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:22,118 INFO L471 AbstractCegarLoop]: Abstraction has 6341 states and 8924 transitions. [2025-03-03 15:06:22,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 6341 states and 8924 transitions. [2025-03-03 15:06:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:22,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:22,121 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] [2025-03-03 15:06:22,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 15:06:22,121 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:22,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:22,122 INFO L85 PathProgramCache]: Analyzing trace with hash -731999476, now seen corresponding path program 1 times [2025-03-03 15:06:22,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:22,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410211788] [2025-03-03 15:06:22,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:22,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:22,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:22,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:22,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:22,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:22,416 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:06:22,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:22,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410211788] [2025-03-03 15:06:22,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410211788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:22,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:22,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:06:22,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675393406] [2025-03-03 15:06:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:22,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:06:22,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:22,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:06:22,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:06:22,418 INFO L87 Difference]: Start difference. First operand 6341 states and 8924 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:22,963 INFO L93 Difference]: Finished difference Result 15400 states and 21735 transitions. [2025-03-03 15:06:22,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 15:06:22,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 15:06:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:22,979 INFO L225 Difference]: With dead ends: 15400 [2025-03-03 15:06:22,980 INFO L226 Difference]: Without dead ends: 10105 [2025-03-03 15:06:22,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:22,987 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1036 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:22,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 875 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:22,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10105 states. [2025-03-03 15:06:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10105 to 6144. [2025-03-03 15:06:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6144 states, 6143 states have (on average 1.4061533452710402) internal successors, (8638), 6143 states have internal predecessors, (8638), 0 states have call successors, (0), 0 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:06:23,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6144 states to 6144 states and 8638 transitions. [2025-03-03 15:06:23,067 INFO L78 Accepts]: Start accepts. Automaton has 6144 states and 8638 transitions. Word has length 62 [2025-03-03 15:06:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:23,067 INFO L471 AbstractCegarLoop]: Abstraction has 6144 states and 8638 transitions. [2025-03-03 15:06:23,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 6144 states and 8638 transitions. [2025-03-03 15:06:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-03-03 15:06:23,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:23,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:23,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 15:06:23,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:23,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:23,071 INFO L85 PathProgramCache]: Analyzing trace with hash -255068851, now seen corresponding path program 1 times [2025-03-03 15:06:23,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:23,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13082063] [2025-03-03 15:06:23,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:23,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:23,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-03 15:06:23,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-03 15:06:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:23,313 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:06:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13082063] [2025-03-03 15:06:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13082063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:23,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 15:06:23,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016551148] [2025-03-03 15:06:23,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:23,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 15:06:23,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:23,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 15:06:23,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-03 15:06:23,317 INFO L87 Difference]: Start difference. First operand 6144 states and 8638 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:23,744 INFO L93 Difference]: Finished difference Result 14988 states and 21182 transitions. [2025-03-03 15:06:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 15:06:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2025-03-03 15:06:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:23,757 INFO L225 Difference]: With dead ends: 14988 [2025-03-03 15:06:23,757 INFO L226 Difference]: Without dead ends: 9752 [2025-03-03 15:06:23,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2025-03-03 15:06:23,764 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1209 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:23,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 740 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:06:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9752 states. [2025-03-03 15:06:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9752 to 6003. [2025-03-03 15:06:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6003 states, 6002 states have (on average 1.406697767410863) internal successors, (8443), 6002 states have internal predecessors, (8443), 0 states have call successors, (0), 0 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:06:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6003 states to 6003 states and 8443 transitions. [2025-03-03 15:06:23,840 INFO L78 Accepts]: Start accepts. Automaton has 6003 states and 8443 transitions. Word has length 62 [2025-03-03 15:06:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:23,841 INFO L471 AbstractCegarLoop]: Abstraction has 6003 states and 8443 transitions. [2025-03-03 15:06:23,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 9 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:06:23,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6003 states and 8443 transitions. [2025-03-03 15:06:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:06:23,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:23,843 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] [2025-03-03 15:06:23,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 15:06:23,843 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 31598955, now seen corresponding path program 1 times [2025-03-03 15:06:23,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:23,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034984253] [2025-03-03 15:06:23,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:23,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:06:23,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:06:23,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:23,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:23,883 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:06:23,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:23,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034984253] [2025-03-03 15:06:23,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034984253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:23,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:23,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:23,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805028127] [2025-03-03 15:06:23,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:23,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:23,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:23,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:23,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:23,884 INFO L87 Difference]: Start difference. First operand 6003 states and 8443 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:23,912 INFO L93 Difference]: Finished difference Result 9060 states and 12752 transitions. [2025-03-03 15:06:23,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:23,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:06:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:23,920 INFO L225 Difference]: With dead ends: 9060 [2025-03-03 15:06:23,920 INFO L226 Difference]: Without dead ends: 5806 [2025-03-03 15:06:23,923 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:06:23,924 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 148 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:23,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 523 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2025-03-03 15:06:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5804. [2025-03-03 15:06:23,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5804 states, 5803 states have (on average 1.387558159572635) internal successors, (8052), 5803 states have internal predecessors, (8052), 0 states have call successors, (0), 0 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:06:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 8052 transitions. [2025-03-03 15:06:23,974 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 8052 transitions. Word has length 63 [2025-03-03 15:06:23,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:23,974 INFO L471 AbstractCegarLoop]: Abstraction has 5804 states and 8052 transitions. [2025-03-03 15:06:23,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:23,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 8052 transitions. [2025-03-03 15:06:23,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:06:23,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:23,976 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] [2025-03-03 15:06:23,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 15:06:23,976 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:23,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1192185867, now seen corresponding path program 1 times [2025-03-03 15:06:23,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:23,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230714127] [2025-03-03 15:06:23,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:23,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:23,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:06:23,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:06:23,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:23,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,017 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:06:24,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230714127] [2025-03-03 15:06:24,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230714127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:24,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:24,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899136541] [2025-03-03 15:06:24,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:24,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:24,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:24,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:24,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:24,019 INFO L87 Difference]: Start difference. First operand 5804 states and 8052 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:24,043 INFO L93 Difference]: Finished difference Result 8100 states and 11237 transitions. [2025-03-03 15:06:24,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:24,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:06:24,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:24,050 INFO L225 Difference]: With dead ends: 8100 [2025-03-03 15:06:24,051 INFO L226 Difference]: Without dead ends: 5002 [2025-03-03 15:06:24,054 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:06:24,054 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 146 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 523 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:06:24,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 523 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:24,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2025-03-03 15:06:24,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 5000. [2025-03-03 15:06:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5000 states, 4999 states have (on average 1.3652730546109222) internal successors, (6825), 4999 states have internal predecessors, (6825), 0 states have call successors, (0), 0 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:06:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5000 states to 5000 states and 6825 transitions. [2025-03-03 15:06:24,114 INFO L78 Accepts]: Start accepts. Automaton has 5000 states and 6825 transitions. Word has length 63 [2025-03-03 15:06:24,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,115 INFO L471 AbstractCegarLoop]: Abstraction has 5000 states and 6825 transitions. [2025-03-03 15:06:24,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:24,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5000 states and 6825 transitions. [2025-03-03 15:06:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 15:06:24,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,118 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] [2025-03-03 15:06:24,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 15:06:24,118 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1538920789, now seen corresponding path program 1 times [2025-03-03 15:06:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925606443] [2025-03-03 15:06:24,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-03 15:06:24,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 15:06:24,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925606443] [2025-03-03 15:06:24,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925606443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:24,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:24,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:24,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302184948] [2025-03-03 15:06:24,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:24,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:24,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:24,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:24,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:24,157 INFO L87 Difference]: Start difference. First operand 5000 states and 6825 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:24,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:24,178 INFO L93 Difference]: Finished difference Result 6596 states and 8998 transitions. [2025-03-03 15:06:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:24,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-03 15:06:24,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:24,184 INFO L225 Difference]: With dead ends: 6596 [2025-03-03 15:06:24,184 INFO L226 Difference]: Without dead ends: 3867 [2025-03-03 15:06:24,186 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:06:24,187 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 134 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 523 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:06:24,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 523 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3867 states. [2025-03-03 15:06:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3867 to 3865. [2025-03-03 15:06:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3865 states, 3864 states have (on average 1.3382505175983437) internal successors, (5171), 3864 states have internal predecessors, (5171), 0 states have call successors, (0), 0 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:06:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 5171 transitions. [2025-03-03 15:06:24,219 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 5171 transitions. Word has length 63 [2025-03-03 15:06:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,219 INFO L471 AbstractCegarLoop]: Abstraction has 3865 states and 5171 transitions. [2025-03-03 15:06:24,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 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:06:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 5171 transitions. [2025-03-03 15:06:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:24,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,222 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] [2025-03-03 15:06:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 15:06:24,222 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 686058653, now seen corresponding path program 1 times [2025-03-03 15:06:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603319304] [2025-03-03 15:06:24,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:24,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:24,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,252 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:06:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603319304] [2025-03-03 15:06:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603319304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494205280] [2025-03-03 15:06:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:24,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:24,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:24,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:24,254 INFO L87 Difference]: Start difference. First operand 3865 states and 5171 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:24,302 INFO L93 Difference]: Finished difference Result 7176 states and 9651 transitions. [2025-03-03 15:06:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:24,309 INFO L225 Difference]: With dead ends: 7176 [2025-03-03 15:06:24,309 INFO L226 Difference]: Without dead ends: 5235 [2025-03-03 15:06:24,311 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:06:24,312 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 174 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:24,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 341 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2025-03-03 15:06:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 3643. [2025-03-03 15:06:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 3642 states have (on average 1.3374519494783086) internal successors, (4871), 3642 states have internal predecessors, (4871), 0 states have call successors, (0), 0 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:06:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4871 transitions. [2025-03-03 15:06:24,341 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4871 transitions. Word has length 64 [2025-03-03 15:06:24,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,341 INFO L471 AbstractCegarLoop]: Abstraction has 3643 states and 4871 transitions. [2025-03-03 15:06:24,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:24,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4871 transitions. [2025-03-03 15:06:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:24,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,343 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] [2025-03-03 15:06:24,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 15:06:24,343 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1555716861, now seen corresponding path program 1 times [2025-03-03 15:06:24,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670126420] [2025-03-03 15:06:24,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:24,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:24,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:24,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670126420] [2025-03-03 15:06:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670126420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162318958] [2025-03-03 15:06:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:24,379 INFO L87 Difference]: Start difference. First operand 3643 states and 4871 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:24,413 INFO L93 Difference]: Finished difference Result 6730 states and 9052 transitions. [2025-03-03 15:06:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:24,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:24,417 INFO L225 Difference]: With dead ends: 6730 [2025-03-03 15:06:24,417 INFO L226 Difference]: Without dead ends: 4927 [2025-03-03 15:06:24,419 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:06:24,420 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 167 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:24,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 339 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:24,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2025-03-03 15:06:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 3461. [2025-03-03 15:06:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3461 states, 3460 states have (on average 1.336127167630058) internal successors, (4623), 3460 states have internal predecessors, (4623), 0 states have call successors, (0), 0 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:06:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 4623 transitions. [2025-03-03 15:06:24,445 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 4623 transitions. Word has length 64 [2025-03-03 15:06:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:24,445 INFO L471 AbstractCegarLoop]: Abstraction has 3461 states and 4623 transitions. [2025-03-03 15:06:24,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 4623 transitions. [2025-03-03 15:06:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:24,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:24,447 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] [2025-03-03 15:06:24,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 15:06:24,447 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1323961782, now seen corresponding path program 1 times [2025-03-03 15:06:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443730660] [2025-03-03 15:06:24,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:24,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:24,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:24,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:24,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:25,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:06:25,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:25,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443730660] [2025-03-03 15:06:25,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443730660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:25,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:25,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-03 15:06:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131747168] [2025-03-03 15:06:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:25,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 15:06:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:25,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 15:06:25,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:06:25,542 INFO L87 Difference]: Start difference. First operand 3461 states and 4623 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:27,542 INFO L93 Difference]: Finished difference Result 6456 states and 8679 transitions. [2025-03-03 15:06:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 15:06:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:27,552 INFO L225 Difference]: With dead ends: 6456 [2025-03-03 15:06:27,552 INFO L226 Difference]: Without dead ends: 6389 [2025-03-03 15:06:27,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 15:06:27,556 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 1598 mSDsluCounter, 3824 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 4083 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:27,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 4083 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:06:27,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6389 states. [2025-03-03 15:06:27,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6389 to 3473. [2025-03-03 15:06:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3472 states have (on average 1.3358294930875576) internal successors, (4638), 3472 states have internal predecessors, (4638), 0 states have call successors, (0), 0 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:06:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 4638 transitions. [2025-03-03 15:06:27,594 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 4638 transitions. Word has length 64 [2025-03-03 15:06:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:27,594 INFO L471 AbstractCegarLoop]: Abstraction has 3473 states and 4638 transitions. [2025-03-03 15:06:27,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 23 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 4638 transitions. [2025-03-03 15:06:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:27,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:27,596 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] [2025-03-03 15:06:27,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 15:06:27,596 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:27,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:27,597 INFO L85 PathProgramCache]: Analyzing trace with hash -777995691, now seen corresponding path program 1 times [2025-03-03 15:06:27,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:27,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639599468] [2025-03-03 15:06:27,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:27,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:27,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:27,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:27,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:27,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:28,043 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:06:28,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639599468] [2025-03-03 15:06:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639599468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:28,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 15:06:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863951436] [2025-03-03 15:06:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:28,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:06:28,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:28,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:06:28,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-03 15:06:28,045 INFO L87 Difference]: Start difference. First operand 3473 states and 4638 transitions. Second operand has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:28,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:28,574 INFO L93 Difference]: Finished difference Result 5430 states and 7304 transitions. [2025-03-03 15:06:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 15:06:28,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:28,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:28,582 INFO L225 Difference]: With dead ends: 5430 [2025-03-03 15:06:28,582 INFO L226 Difference]: Without dead ends: 5105 [2025-03-03 15:06:28,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:06:28,584 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1319 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:28,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1526 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2025-03-03 15:06:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 3424. [2025-03-03 15:06:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3423 states have (on average 1.3353783231083844) internal successors, (4571), 3423 states have internal predecessors, (4571), 0 states have call successors, (0), 0 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:06:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 4571 transitions. [2025-03-03 15:06:28,615 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 4571 transitions. Word has length 64 [2025-03-03 15:06:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:28,615 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 4571 transitions. [2025-03-03 15:06:28,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.923076923076923) internal successors, (64), 13 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 4571 transitions. [2025-03-03 15:06:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:28,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:28,617 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] [2025-03-03 15:06:28,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 15:06:28,617 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:28,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash 461441588, now seen corresponding path program 1 times [2025-03-03 15:06:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:28,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249011506] [2025-03-03 15:06:28,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:28,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:28,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:28,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:28,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:28,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:29,041 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:06:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249011506] [2025-03-03 15:06:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249011506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 15:06:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937510262] [2025-03-03 15:06:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:29,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:29,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:29,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:29,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:29,043 INFO L87 Difference]: Start difference. First operand 3424 states and 4571 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:29,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:29,832 INFO L93 Difference]: Finished difference Result 8429 states and 11363 transitions. [2025-03-03 15:06:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 15:06:29,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:29,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:29,845 INFO L225 Difference]: With dead ends: 8429 [2025-03-03 15:06:29,845 INFO L226 Difference]: Without dead ends: 8087 [2025-03-03 15:06:29,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=618, Unknown=0, NotChecked=0, Total=812 [2025-03-03 15:06:29,848 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 1620 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1620 SdHoareTripleChecker+Valid, 2295 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:29,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1620 Valid, 2295 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:06:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8087 states. [2025-03-03 15:06:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8087 to 3352. [2025-03-03 15:06:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3352 states, 3351 states have (on average 1.336317517159057) internal successors, (4478), 3351 states have internal predecessors, (4478), 0 states have call successors, (0), 0 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:06:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3352 states to 3352 states and 4478 transitions. [2025-03-03 15:06:29,892 INFO L78 Accepts]: Start accepts. Automaton has 3352 states and 4478 transitions. Word has length 64 [2025-03-03 15:06:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:29,892 INFO L471 AbstractCegarLoop]: Abstraction has 3352 states and 4478 transitions. [2025-03-03 15:06:29,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 3352 states and 4478 transitions. [2025-03-03 15:06:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-03 15:06:29,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:29,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:29,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 15:06:29,894 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:29,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:29,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1743229389, now seen corresponding path program 1 times [2025-03-03 15:06:29,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137567392] [2025-03-03 15:06:29,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:29,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:29,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-03 15:06:29,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-03 15:06:29,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:29,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:29,922 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:06:29,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:29,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137567392] [2025-03-03 15:06:29,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137567392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:29,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:29,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:29,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177573995] [2025-03-03 15:06:29,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:29,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:29,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:29,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:29,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:29,924 INFO L87 Difference]: Start difference. First operand 3352 states and 4478 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:29,956 INFO L93 Difference]: Finished difference Result 6257 states and 8415 transitions. [2025-03-03 15:06:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:29,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-03 15:06:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:29,961 INFO L225 Difference]: With dead ends: 6257 [2025-03-03 15:06:29,961 INFO L226 Difference]: Without dead ends: 4483 [2025-03-03 15:06:29,963 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:06:29,963 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 166 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:29,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 348 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:29,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4483 states. [2025-03-03 15:06:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4483 to 3142. [2025-03-03 15:06:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 3141 states have (on average 1.3358802929003502) internal successors, (4196), 3141 states have internal predecessors, (4196), 0 states have call successors, (0), 0 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:06:29,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4196 transitions. [2025-03-03 15:06:29,987 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4196 transitions. Word has length 64 [2025-03-03 15:06:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:29,987 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 4196 transitions. [2025-03-03 15:06:29,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 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:06:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4196 transitions. [2025-03-03 15:06:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-03 15:06:29,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:29,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] [2025-03-03 15:06:29,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 15:06:29,990 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:29,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1683452360, now seen corresponding path program 1 times [2025-03-03 15:06:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:29,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581050860] [2025-03-03 15:06:29,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:29,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:29,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-03 15:06:30,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-03 15:06:30,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:30,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:30,056 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:06:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:30,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581050860] [2025-03-03 15:06:30,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581050860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:30,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653091987] [2025-03-03 15:06:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:30,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:30,058 INFO L87 Difference]: Start difference. First operand 3142 states and 4196 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:06:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:30,099 INFO L93 Difference]: Finished difference Result 3148 states and 4199 transitions. [2025-03-03 15:06:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 15:06:30,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2025-03-03 15:06:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:30,102 INFO L225 Difference]: With dead ends: 3148 [2025-03-03 15:06:30,103 INFO L226 Difference]: Without dead ends: 2705 [2025-03-03 15:06:30,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:30,104 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 623 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:30,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 583 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:30,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2705 states. [2025-03-03 15:06:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2705 to 2701. [2025-03-03 15:06:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.3403703703703704) internal successors, (3619), 2700 states have internal predecessors, (3619), 0 states have call successors, (0), 0 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:06:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3619 transitions. [2025-03-03 15:06:30,122 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3619 transitions. Word has length 69 [2025-03-03 15:06:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:30,122 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3619 transitions. [2025-03-03 15:06:30,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 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:06:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3619 transitions. [2025-03-03 15:06:30,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-03 15:06:30,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:30,124 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] [2025-03-03 15:06:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 15:06:30,125 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:30,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:30,125 INFO L85 PathProgramCache]: Analyzing trace with hash -975909036, now seen corresponding path program 1 times [2025-03-03 15:06:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:30,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151871143] [2025-03-03 15:06:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-03 15:06:30,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-03 15:06:30,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:30,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:30,186 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:06:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151871143] [2025-03-03 15:06:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151871143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:30,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83716182] [2025-03-03 15:06:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:30,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:30,188 INFO L87 Difference]: Start difference. First operand 2701 states and 3619 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:06:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:30,226 INFO L93 Difference]: Finished difference Result 6990 states and 9463 transitions. [2025-03-03 15:06:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:30,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2025-03-03 15:06:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:30,232 INFO L225 Difference]: With dead ends: 6990 [2025-03-03 15:06:30,233 INFO L226 Difference]: Without dead ends: 4682 [2025-03-03 15:06:30,235 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:06:30,236 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 113 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:30,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 426 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2025-03-03 15:06:30,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4386. [2025-03-03 15:06:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4386 states, 4385 states have (on average 1.3388825541619156) internal successors, (5871), 4385 states have internal predecessors, (5871), 0 states have call successors, (0), 0 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:06:30,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4386 states to 4386 states and 5871 transitions. [2025-03-03 15:06:30,272 INFO L78 Accepts]: Start accepts. Automaton has 4386 states and 5871 transitions. Word has length 72 [2025-03-03 15:06:30,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:30,272 INFO L471 AbstractCegarLoop]: Abstraction has 4386 states and 5871 transitions. [2025-03-03 15:06:30,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:06:30,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4386 states and 5871 transitions. [2025-03-03 15:06:30,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-03 15:06:30,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:30,274 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] [2025-03-03 15:06:30,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 15:06:30,274 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:30,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:30,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2045297549, now seen corresponding path program 1 times [2025-03-03 15:06:30,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:30,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117838482] [2025-03-03 15:06:30,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:30,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-03 15:06:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-03 15:06:30,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:30,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:30,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:30,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117838482] [2025-03-03 15:06:30,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117838482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:30,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:30,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784554457] [2025-03-03 15:06:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:30,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:30,336 INFO L87 Difference]: Start difference. First operand 4386 states and 5871 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:06:30,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:30,362 INFO L93 Difference]: Finished difference Result 11938 states and 16077 transitions. [2025-03-03 15:06:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:30,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2025-03-03 15:06:30,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:30,374 INFO L225 Difference]: With dead ends: 11938 [2025-03-03 15:06:30,374 INFO L226 Difference]: Without dead ends: 7957 [2025-03-03 15:06:30,379 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:06:30,379 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 103 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:30,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 418 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7957 states. [2025-03-03 15:06:30,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7957 to 7367. [2025-03-03 15:06:30,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7367 states, 7366 states have (on average 1.3349171870757535) internal successors, (9833), 7366 states have internal predecessors, (9833), 0 states have call successors, (0), 0 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:06:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7367 states to 7367 states and 9833 transitions. [2025-03-03 15:06:30,438 INFO L78 Accepts]: Start accepts. Automaton has 7367 states and 9833 transitions. Word has length 73 [2025-03-03 15:06:30,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:30,438 INFO L471 AbstractCegarLoop]: Abstraction has 7367 states and 9833 transitions. [2025-03-03 15:06:30,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 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:06:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7367 states and 9833 transitions. [2025-03-03 15:06:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 15:06:30,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:30,440 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] [2025-03-03 15:06:30,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 15:06:30,440 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -926075687, now seen corresponding path program 1 times [2025-03-03 15:06:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057302284] [2025-03-03 15:06:30,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 15:06:30,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 15:06:30,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:30,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:30,493 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:06:30,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:30,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057302284] [2025-03-03 15:06:30,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057302284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:30,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:30,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:30,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074880304] [2025-03-03 15:06:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:30,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:30,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:30,495 INFO L87 Difference]: Start difference. First operand 7367 states and 9833 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:06:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:30,532 INFO L93 Difference]: Finished difference Result 20471 states and 27331 transitions. [2025-03-03 15:06:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:30,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2025-03-03 15:06:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:30,545 INFO L225 Difference]: With dead ends: 20471 [2025-03-03 15:06:30,546 INFO L226 Difference]: Without dead ends: 13509 [2025-03-03 15:06:30,555 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:06:30,555 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 93 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:30,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 408 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13509 states. [2025-03-03 15:06:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13509 to 12331. [2025-03-03 15:06:30,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12331 states, 12330 states have (on average 1.3220600162206002) internal successors, (16301), 12330 states have internal predecessors, (16301), 0 states have call successors, (0), 0 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:06:30,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12331 states to 12331 states and 16301 transitions. [2025-03-03 15:06:30,662 INFO L78 Accepts]: Start accepts. Automaton has 12331 states and 16301 transitions. Word has length 74 [2025-03-03 15:06:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:30,662 INFO L471 AbstractCegarLoop]: Abstraction has 12331 states and 16301 transitions. [2025-03-03 15:06:30,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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:06:30,662 INFO L276 IsEmpty]: Start isEmpty. Operand 12331 states and 16301 transitions. [2025-03-03 15:06:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 15:06:30,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:30,663 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] [2025-03-03 15:06:30,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 15:06:30,664 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:30,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1230066519, now seen corresponding path program 1 times [2025-03-03 15:06:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480361092] [2025-03-03 15:06:30,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:30,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:30,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 15:06:30,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 15:06:30,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:30,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:30,830 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:06:30,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:30,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480361092] [2025-03-03 15:06:30,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480361092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:30,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:30,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 15:06:30,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40233739] [2025-03-03 15:06:30,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:30,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 15:06:30,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:30,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 15:06:30,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:06:30,832 INFO L87 Difference]: Start difference. First operand 12331 states and 16301 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:06:30,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:30,874 INFO L93 Difference]: Finished difference Result 13605 states and 17998 transitions. [2025-03-03 15:06:30,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:06:30,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 15:06:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:30,891 INFO L225 Difference]: With dead ends: 13605 [2025-03-03 15:06:30,891 INFO L226 Difference]: Without dead ends: 13603 [2025-03-03 15:06:30,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 15:06:30,896 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:30,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 944 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:30,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13603 states. [2025-03-03 15:06:30,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13603 to 13603. [2025-03-03 15:06:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13603 states, 13602 states have (on average 1.2919423614174386) internal successors, (17573), 13602 states have internal predecessors, (17573), 0 states have call successors, (0), 0 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:06:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13603 states to 13603 states and 17573 transitions. [2025-03-03 15:06:31,015 INFO L78 Accepts]: Start accepts. Automaton has 13603 states and 17573 transitions. Word has length 77 [2025-03-03 15:06:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:31,015 INFO L471 AbstractCegarLoop]: Abstraction has 13603 states and 17573 transitions. [2025-03-03 15:06:31,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 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:06:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13603 states and 17573 transitions. [2025-03-03 15:06:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 15:06:31,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:31,016 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:31,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 15:06:31,017 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:31,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 670440263, now seen corresponding path program 1 times [2025-03-03 15:06:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:31,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119095956] [2025-03-03 15:06:31,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:31,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:31,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 15:06:31,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 15:06:31,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:31,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:31,049 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:06:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119095956] [2025-03-03 15:06:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119095956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:06:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553469105] [2025-03-03 15:06:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:06:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:31,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:06:31,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:06:31,051 INFO L87 Difference]: Start difference. First operand 13603 states and 17573 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:31,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:31,105 INFO L93 Difference]: Finished difference Result 33419 states and 42967 transitions. [2025-03-03 15:06:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:06:31,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2025-03-03 15:06:31,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:31,133 INFO L225 Difference]: With dead ends: 33419 [2025-03-03 15:06:31,133 INFO L226 Difference]: Without dead ends: 20221 [2025-03-03 15:06:31,144 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:06:31,146 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 129 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:31,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 338 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:06:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20221 states. [2025-03-03 15:06:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20221 to 20219. [2025-03-03 15:06:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20219 states, 20218 states have (on average 1.2678306459590465) internal successors, (25633), 20218 states have internal predecessors, (25633), 0 states have call successors, (0), 0 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:06:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20219 states to 20219 states and 25633 transitions. [2025-03-03 15:06:31,346 INFO L78 Accepts]: Start accepts. Automaton has 20219 states and 25633 transitions. Word has length 78 [2025-03-03 15:06:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:31,347 INFO L471 AbstractCegarLoop]: Abstraction has 20219 states and 25633 transitions. [2025-03-03 15:06:31,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 15:06:31,347 INFO L276 IsEmpty]: Start isEmpty. Operand 20219 states and 25633 transitions. [2025-03-03 15:06:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 15:06:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:31,351 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:31,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 15:06:31,351 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -927831153, now seen corresponding path program 1 times [2025-03-03 15:06:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:31,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655259028] [2025-03-03 15:06:31,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:06:31,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:06:31,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:31,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:31,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655259028] [2025-03-03 15:06:31,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655259028] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:31,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196048701] [2025-03-03 15:06:31,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:31,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:31,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:31,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:31,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 15:06:31,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 15:06:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 15:06:31,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:31,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:31,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:06:31,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:32,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:32,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196048701] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:33,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:33,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 14] total 30 [2025-03-03 15:06:33,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266719487] [2025-03-03 15:06:33,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:33,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 15:06:33,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:33,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 15:06:33,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:06:33,665 INFO L87 Difference]: Start difference. First operand 20219 states and 25633 transitions. Second operand has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 30 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:06:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:52,133 INFO L93 Difference]: Finished difference Result 170013 states and 213202 transitions. [2025-03-03 15:06:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2025-03-03 15:06:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 30 states have internal predecessors, (277), 0 states have call successors, (0), 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 97 [2025-03-03 15:06:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:52,295 INFO L225 Difference]: With dead ends: 170013 [2025-03-03 15:06:52,295 INFO L226 Difference]: Without dead ends: 150199 [2025-03-03 15:06:52,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 406 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74642 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15994, Invalid=150062, Unknown=0, NotChecked=0, Total=166056 [2025-03-03 15:06:52,332 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 9920 mSDsluCounter, 8653 mSDsCounter, 0 mSdLazyCounter, 9826 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9920 SdHoareTripleChecker+Valid, 9167 SdHoareTripleChecker+Invalid, 10030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 9826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:52,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9920 Valid, 9167 Invalid, 10030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 9826 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-03 15:06:52,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150199 states. [2025-03-03 15:06:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150199 to 40648. [2025-03-03 15:06:53,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40648 states, 40647 states have (on average 1.266686348315989) internal successors, (51487), 40647 states have internal predecessors, (51487), 0 states have call successors, (0), 0 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:06:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40648 states to 40648 states and 51487 transitions. [2025-03-03 15:06:53,212 INFO L78 Accepts]: Start accepts. Automaton has 40648 states and 51487 transitions. Word has length 97 [2025-03-03 15:06:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:53,213 INFO L471 AbstractCegarLoop]: Abstraction has 40648 states and 51487 transitions. [2025-03-03 15:06:53,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 9.233333333333333) internal successors, (277), 30 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:06:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 40648 states and 51487 transitions. [2025-03-03 15:06:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 15:06:53,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:53,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:53,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 15:06:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-03 15:06:53,423 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:53,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1007462841, now seen corresponding path program 1 times [2025-03-03 15:06:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553409278] [2025-03-03 15:06:53,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:53,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:06:53,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:06:53,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:53,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553409278] [2025-03-03 15:06:53,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553409278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:53,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567009498] [2025-03-03 15:06:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:53,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:53,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:53,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:53,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 15:06:53,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-03 15:06:53,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-03 15:06:53,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:53,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:53,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:53,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:53,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:53,836 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:53,972 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567009498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:53,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:53,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871433920] [2025-03-03 15:06:53,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:53,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:53,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:53,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:53,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:53,974 INFO L87 Difference]: Start difference. First operand 40648 states and 51487 transitions. Second operand has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:06:54,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:54,325 INFO L93 Difference]: Finished difference Result 84945 states and 107772 transitions. [2025-03-03 15:06:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:54,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 0 states have call successors, (0), 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 105 [2025-03-03 15:06:54,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:54,372 INFO L225 Difference]: With dead ends: 84945 [2025-03-03 15:06:54,372 INFO L226 Difference]: Without dead ends: 44719 [2025-03-03 15:06:54,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:54,401 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1326 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:54,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 777 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44719 states. [2025-03-03 15:06:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44719 to 40005. [2025-03-03 15:06:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40005 states, 40004 states have (on average 1.2479002099790022) internal successors, (49921), 40004 states have internal predecessors, (49921), 0 states have call successors, (0), 0 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:06:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40005 states to 40005 states and 49921 transitions. [2025-03-03 15:06:54,932 INFO L78 Accepts]: Start accepts. Automaton has 40005 states and 49921 transitions. Word has length 105 [2025-03-03 15:06:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:54,932 INFO L471 AbstractCegarLoop]: Abstraction has 40005 states and 49921 transitions. [2025-03-03 15:06:54,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.642857142857142) internal successors, (289), 14 states have internal predecessors, (289), 0 states have call successors, (0), 0 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:06:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40005 states and 49921 transitions. [2025-03-03 15:06:54,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:06:54,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:54,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:54,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:55,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-03 15:06:55,141 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash 959077854, now seen corresponding path program 1 times [2025-03-03 15:06:55,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:55,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530271261] [2025-03-03 15:06:55,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:55,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:55,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:55,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:55,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:55,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530271261] [2025-03-03 15:06:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530271261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783244854] [2025-03-03 15:06:55,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:55,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:55,208 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:55,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 15:06:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:55,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:55,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:55,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:55,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 15:06:55,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:55,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:06:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:55,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783244854] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:06:55,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:06:55,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-03 15:06:55,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387095856] [2025-03-03 15:06:55,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:06:55,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:55,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:55,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:55,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-03 15:06:55,685 INFO L87 Difference]: Start difference. First operand 40005 states and 49921 transitions. Second operand has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:06:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:56,200 INFO L93 Difference]: Finished difference Result 90649 states and 112884 transitions. [2025-03-03 15:06:56,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 15:06:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 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 107 [2025-03-03 15:06:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:56,257 INFO L225 Difference]: With dead ends: 90649 [2025-03-03 15:06:56,257 INFO L226 Difference]: Without dead ends: 51018 [2025-03-03 15:06:56,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-03-03 15:06:56,277 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 1945 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 792 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:56,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51018 states. [2025-03-03 15:06:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51018 to 42327. [2025-03-03 15:06:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42327 states, 42326 states have (on average 1.2283466427255114) internal successors, (51991), 42326 states have internal predecessors, (51991), 0 states have call successors, (0), 0 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:06:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42327 states to 42327 states and 51991 transitions. [2025-03-03 15:06:56,823 INFO L78 Accepts]: Start accepts. Automaton has 42327 states and 51991 transitions. Word has length 107 [2025-03-03 15:06:56,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:56,824 INFO L471 AbstractCegarLoop]: Abstraction has 42327 states and 51991 transitions. [2025-03-03 15:06:56,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 20.357142857142858) internal successors, (285), 14 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:06:56,824 INFO L276 IsEmpty]: Start isEmpty. Operand 42327 states and 51991 transitions. [2025-03-03 15:06:56,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 15:06:56,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:56,832 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:56,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 15:06:57,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:57,032 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:57,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1422509753, now seen corresponding path program 1 times [2025-03-03 15:06:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090226793] [2025-03-03 15:06:57,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 15:06:57,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 15:06:57,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:57,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:57,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090226793] [2025-03-03 15:06:57,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090226793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:57,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:06:57,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 15:06:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297281292] [2025-03-03 15:06:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:57,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 15:06:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:57,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 15:06:57,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 15:06:57,107 INFO L87 Difference]: Start difference. First operand 42327 states and 51991 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:06:57,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:57,431 INFO L93 Difference]: Finished difference Result 84840 states and 104179 transitions. [2025-03-03 15:06:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 15:06:57,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2025-03-03 15:06:57,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:57,474 INFO L225 Difference]: With dead ends: 84840 [2025-03-03 15:06:57,475 INFO L226 Difference]: Without dead ends: 42927 [2025-03-03 15:06:57,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 15:06:57,501 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 354 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:57,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 343 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 15:06:57,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42927 states. [2025-03-03 15:06:57,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42927 to 40668. [2025-03-03 15:06:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40668 states, 40667 states have (on average 1.2073179728035015) internal successors, (49098), 40667 states have internal predecessors, (49098), 0 states have call successors, (0), 0 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:06:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40668 states to 40668 states and 49098 transitions. [2025-03-03 15:06:57,898 INFO L78 Accepts]: Start accepts. Automaton has 40668 states and 49098 transitions. Word has length 107 [2025-03-03 15:06:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:06:57,899 INFO L471 AbstractCegarLoop]: Abstraction has 40668 states and 49098 transitions. [2025-03-03 15:06:57,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:06:57,899 INFO L276 IsEmpty]: Start isEmpty. Operand 40668 states and 49098 transitions. [2025-03-03 15:06:57,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 15:06:57,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:06:57,906 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:06:57,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 15:06:57,906 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:06:57,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:06:57,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1272476400, now seen corresponding path program 1 times [2025-03-03 15:06:57,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:06:57,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685085478] [2025-03-03 15:06:57,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:06:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:06:57,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:06:57,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:57,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:58,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:58,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:06:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685085478] [2025-03-03 15:06:58,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685085478] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:06:58,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318566326] [2025-03-03 15:06:58,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:06:58,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:06:58,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:06:58,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:06:58,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 15:06:58,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 15:06:58,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 15:06:58,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:06:58,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:06:58,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-03 15:06:58,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:06:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:06:58,856 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:06:58,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318566326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:06:58,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:06:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [9] total 20 [2025-03-03 15:06:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075731786] [2025-03-03 15:06:58,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:06:58,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 15:06:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:06:58,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 15:06:58,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-03 15:06:58,858 INFO L87 Difference]: Start difference. First operand 40668 states and 49098 transitions. Second operand has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:06:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:06:59,705 INFO L93 Difference]: Finished difference Result 74026 states and 89438 transitions. [2025-03-03 15:06:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 15:06:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2025-03-03 15:06:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:06:59,771 INFO L225 Difference]: With dead ends: 74026 [2025-03-03 15:06:59,771 INFO L226 Difference]: Without dead ends: 67612 [2025-03-03 15:06:59,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=858, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 15:06:59,791 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 668 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 15:06:59,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1767 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 15:06:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67612 states. [2025-03-03 15:07:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67612 to 49090. [2025-03-03 15:07:00,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49090 states, 49089 states have (on average 1.2068691560227343) internal successors, (59244), 49089 states have internal predecessors, (59244), 0 states have call successors, (0), 0 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:07:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49090 states to 49090 states and 59244 transitions. [2025-03-03 15:07:00,355 INFO L78 Accepts]: Start accepts. Automaton has 49090 states and 59244 transitions. Word has length 108 [2025-03-03 15:07:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:00,355 INFO L471 AbstractCegarLoop]: Abstraction has 49090 states and 59244 transitions. [2025-03-03 15:07:00,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 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:07:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49090 states and 59244 transitions. [2025-03-03 15:07:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:07:00,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:00,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:00,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:00,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:00,563 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:00,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1784922206, now seen corresponding path program 1 times [2025-03-03 15:07:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956795419] [2025-03-03 15:07:00,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:00,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:00,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:00,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:00,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:00,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:00,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956795419] [2025-03-03 15:07:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956795419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:00,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 15:07:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469826469] [2025-03-03 15:07:00,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 15:07:00,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:00,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 15:07:00,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-03 15:07:00,889 INFO L87 Difference]: Start difference. First operand 49090 states and 59244 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:07:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:01,570 INFO L93 Difference]: Finished difference Result 64252 states and 77640 transitions. [2025-03-03 15:07:01,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 15:07:01,571 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:07:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:01,632 INFO L225 Difference]: With dead ends: 64252 [2025-03-03 15:07:01,633 INFO L226 Difference]: Without dead ends: 57782 [2025-03-03 15:07:01,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2025-03-03 15:07:01,654 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 790 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:01,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1140 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 15:07:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57782 states. [2025-03-03 15:07:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57782 to 53830. [2025-03-03 15:07:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53830 states, 53829 states have (on average 1.2079362425458395) internal successors, (65022), 53829 states have internal predecessors, (65022), 0 states have call successors, (0), 0 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:07:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53830 states to 53830 states and 65022 transitions. [2025-03-03 15:07:02,565 INFO L78 Accepts]: Start accepts. Automaton has 53830 states and 65022 transitions. Word has length 110 [2025-03-03 15:07:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:02,565 INFO L471 AbstractCegarLoop]: Abstraction has 53830 states and 65022 transitions. [2025-03-03 15:07:02,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:07:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53830 states and 65022 transitions. [2025-03-03 15:07:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:07:02,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:02,573 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 15:07:02,573 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2083766792, now seen corresponding path program 1 times [2025-03-03 15:07:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065120184] [2025-03-03 15:07:02,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:02,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:02,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:02,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065120184] [2025-03-03 15:07:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065120184] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002074078] [2025-03-03 15:07:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:02,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:02,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:02,937 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:02,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 15:07:03,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:03,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:03,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:03,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:03,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 15:07:03,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:03,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:07:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:04,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002074078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:07:04,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:07:04,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 37 [2025-03-03 15:07:04,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483369931] [2025-03-03 15:07:04,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:07:04,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 15:07:04,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:04,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 15:07:04,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 15:07:04,280 INFO L87 Difference]: Start difference. First operand 53830 states and 65022 transitions. Second operand has 37 states, 37 states have (on average 7.27027027027027) internal successors, (269), 37 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:07:05,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:05,781 INFO L93 Difference]: Finished difference Result 110795 states and 133709 transitions. [2025-03-03 15:07:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-03 15:07:05,782 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 7.27027027027027) internal successors, (269), 37 states have internal predecessors, (269), 0 states have call successors, (0), 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 110 [2025-03-03 15:07:05,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:05,891 INFO L225 Difference]: With dead ends: 110795 [2025-03-03 15:07:05,891 INFO L226 Difference]: Without dead ends: 95866 [2025-03-03 15:07:05,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=554, Invalid=3228, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 15:07:05,926 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 2241 mSDsluCounter, 7104 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 7488 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:05,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2241 Valid, 7488 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 15:07:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95866 states. [2025-03-03 15:07:06,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95866 to 54375. [2025-03-03 15:07:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54375 states, 54374 states have (on average 1.207801522786626) internal successors, (65673), 54374 states have internal predecessors, (65673), 0 states have call successors, (0), 0 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:07:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54375 states to 54375 states and 65673 transitions. [2025-03-03 15:07:06,811 INFO L78 Accepts]: Start accepts. Automaton has 54375 states and 65673 transitions. Word has length 110 [2025-03-03 15:07:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:06,811 INFO L471 AbstractCegarLoop]: Abstraction has 54375 states and 65673 transitions. [2025-03-03 15:07:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 7.27027027027027) internal successors, (269), 37 states have internal predecessors, (269), 0 states have call successors, (0), 0 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:07:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 54375 states and 65673 transitions. [2025-03-03 15:07:06,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:07:06,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:06,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:06,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:07,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-03 15:07:07,019 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:07,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:07,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1850038173, now seen corresponding path program 1 times [2025-03-03 15:07:07,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:07,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961652833] [2025-03-03 15:07:07,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:07,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:07,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:07,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:07,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:07,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:07,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961652833] [2025-03-03 15:07:07,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961652833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:07,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320362396] [2025-03-03 15:07:07,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:07,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:07,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:07,460 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:07,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 15:07:07,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:07,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:07,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:07,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:07,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 15:07:07,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:08,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:07:08,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320362396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:08,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:07:08,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [11] total 23 [2025-03-03 15:07:08,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180474733] [2025-03-03 15:07:08,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:08,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 15:07:08,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:08,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 15:07:08,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-03-03 15:07:08,158 INFO L87 Difference]: Start difference. First operand 54375 states and 65673 transitions. Second operand has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:07:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:08,805 INFO L93 Difference]: Finished difference Result 88760 states and 107281 transitions. [2025-03-03 15:07:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 15:07:08,805 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2025-03-03 15:07:08,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:08,884 INFO L225 Difference]: With dead ends: 88760 [2025-03-03 15:07:08,884 INFO L226 Difference]: Without dead ends: 76637 [2025-03-03 15:07:08,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2025-03-03 15:07:08,904 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 554 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:08,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 2724 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:08,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76637 states. [2025-03-03 15:07:09,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76637 to 56991. [2025-03-03 15:07:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56991 states, 56990 states have (on average 1.2068959466573084) internal successors, (68781), 56990 states have internal predecessors, (68781), 0 states have call successors, (0), 0 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:07:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56991 states to 56991 states and 68781 transitions. [2025-03-03 15:07:09,577 INFO L78 Accepts]: Start accepts. Automaton has 56991 states and 68781 transitions. Word has length 110 [2025-03-03 15:07:09,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:09,577 INFO L471 AbstractCegarLoop]: Abstraction has 56991 states and 68781 transitions. [2025-03-03 15:07:09,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.461538461538462) internal successors, (110), 13 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:07:09,577 INFO L276 IsEmpty]: Start isEmpty. Operand 56991 states and 68781 transitions. [2025-03-03 15:07:09,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 15:07:09,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:09,586 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:09,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-03 15:07:09,787 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:09,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:09,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1566401817, now seen corresponding path program 1 times [2025-03-03 15:07:09,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:09,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502939224] [2025-03-03 15:07:09,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:09,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:09,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:09,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:09,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:09,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:10,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:10,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502939224] [2025-03-03 15:07:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502939224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362103360] [2025-03-03 15:07:10,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:10,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:10,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:10,024 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:10,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 15:07:10,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 15:07:10,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 15:07:10,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:10,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:10,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 15:07:10,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:11,060 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:11,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:07:11,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:11,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362103360] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:07:11,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:07:11,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 31 [2025-03-03 15:07:11,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458364856] [2025-03-03 15:07:11,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:07:11,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 15:07:11,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:11,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 15:07:11,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:07:11,671 INFO L87 Difference]: Start difference. First operand 56991 states and 68781 transitions. Second operand has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:07:13,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:13,727 INFO L93 Difference]: Finished difference Result 127218 states and 152862 transitions. [2025-03-03 15:07:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 15:07:13,731 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 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 110 [2025-03-03 15:07:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:13,875 INFO L225 Difference]: With dead ends: 127218 [2025-03-03 15:07:13,875 INFO L226 Difference]: Without dead ends: 100504 [2025-03-03 15:07:13,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=663, Invalid=2529, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 15:07:13,919 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 1727 mSDsluCounter, 3509 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 3713 SdHoareTripleChecker+Invalid, 3074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:13,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 3713 Invalid, 3074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 15:07:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100504 states. [2025-03-03 15:07:14,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100504 to 57306. [2025-03-03 15:07:14,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57306 states, 57305 states have (on average 1.2062647238460866) internal successors, (69125), 57305 states have internal predecessors, (69125), 0 states have call successors, (0), 0 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:07:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57306 states to 57306 states and 69125 transitions. [2025-03-03 15:07:14,685 INFO L78 Accepts]: Start accepts. Automaton has 57306 states and 69125 transitions. Word has length 110 [2025-03-03 15:07:14,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:14,685 INFO L471 AbstractCegarLoop]: Abstraction has 57306 states and 69125 transitions. [2025-03-03 15:07:14,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.64516129032258) internal successors, (268), 31 states have internal predecessors, (268), 0 states have call successors, (0), 0 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:07:14,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57306 states and 69125 transitions. [2025-03-03 15:07:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:07:14,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:14,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:14,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:14,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:14,893 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:14,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:14,893 INFO L85 PathProgramCache]: Analyzing trace with hash 854418218, now seen corresponding path program 1 times [2025-03-03 15:07:14,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:14,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123330180] [2025-03-03 15:07:14,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:14,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:07:14,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:07:14,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:14,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123330180] [2025-03-03 15:07:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123330180] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658156008] [2025-03-03 15:07:15,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:15,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:15,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:15,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:15,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 15:07:15,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:07:15,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:07:15,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:15,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:15,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 15:07:15,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:16,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 15:07:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658156008] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 15:07:17,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 15:07:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 15] total 49 [2025-03-03 15:07:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276134075] [2025-03-03 15:07:17,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 15:07:17,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 15:07:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:17,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 15:07:17,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 15:07:17,402 INFO L87 Difference]: Start difference. First operand 57306 states and 69125 transitions. Second operand has 49 states, 49 states have (on average 6.3061224489795915) internal successors, (309), 49 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:07:23,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:23,458 INFO L93 Difference]: Finished difference Result 152828 states and 183842 transitions. [2025-03-03 15:07:23,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2025-03-03 15:07:23,458 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 6.3061224489795915) internal successors, (309), 49 states have internal predecessors, (309), 0 states have call successors, (0), 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 111 [2025-03-03 15:07:23,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:23,597 INFO L225 Difference]: With dead ends: 152828 [2025-03-03 15:07:23,597 INFO L226 Difference]: Without dead ends: 134966 [2025-03-03 15:07:23,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4438 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2718, Invalid=16188, Unknown=0, NotChecked=0, Total=18906 [2025-03-03 15:07:23,637 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 3380 mSDsluCounter, 12731 mSDsCounter, 0 mSdLazyCounter, 6559 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3380 SdHoareTripleChecker+Valid, 13167 SdHoareTripleChecker+Invalid, 6598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 6559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:23,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3380 Valid, 13167 Invalid, 6598 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 6559 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 15:07:23,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134966 states. [2025-03-03 15:07:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134966 to 75837. [2025-03-03 15:07:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75837 states, 75836 states have (on average 1.2049949891871934) internal successors, (91382), 75836 states have internal predecessors, (91382), 0 states have call successors, (0), 0 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:07:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75837 states to 75837 states and 91382 transitions. [2025-03-03 15:07:24,624 INFO L78 Accepts]: Start accepts. Automaton has 75837 states and 91382 transitions. Word has length 111 [2025-03-03 15:07:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 75837 states and 91382 transitions. [2025-03-03 15:07:24,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 6.3061224489795915) internal successors, (309), 49 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:07:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 75837 states and 91382 transitions. [2025-03-03 15:07:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:07:24,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:24,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:24,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 15:07:24,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-03-03 15:07:24,834 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1278003339, now seen corresponding path program 1 times [2025-03-03 15:07:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:24,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624714610] [2025-03-03 15:07:24,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:24,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:07:24,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:07:24,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:24,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:24,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624714610] [2025-03-03 15:07:24,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624714610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:24,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:24,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 15:07:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260142565] [2025-03-03 15:07:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:24,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 15:07:24,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:24,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 15:07:24,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 15:07:24,868 INFO L87 Difference]: Start difference. First operand 75837 states and 91382 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:07:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:25,069 INFO L93 Difference]: Finished difference Result 116056 states and 139587 transitions. [2025-03-03 15:07:25,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 15:07:25,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:07:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:25,168 INFO L225 Difference]: With dead ends: 116056 [2025-03-03 15:07:25,169 INFO L226 Difference]: Without dead ends: 96909 [2025-03-03 15:07:25,404 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:07:25,405 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 77 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:25,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 428 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 15:07:25,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96909 states. [2025-03-03 15:07:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96909 to 79260. [2025-03-03 15:07:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79260 states, 79259 states have (on average 1.1996744849165395) internal successors, (95085), 79259 states have internal predecessors, (95085), 0 states have call successors, (0), 0 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:07:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79260 states to 79260 states and 95085 transitions. [2025-03-03 15:07:26,229 INFO L78 Accepts]: Start accepts. Automaton has 79260 states and 95085 transitions. Word has length 111 [2025-03-03 15:07:26,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:26,229 INFO L471 AbstractCegarLoop]: Abstraction has 79260 states and 95085 transitions. [2025-03-03 15:07:26,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:07:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 79260 states and 95085 transitions. [2025-03-03 15:07:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 15:07:26,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:26,239 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:26,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 15:07:26,239 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:26,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2025524350, now seen corresponding path program 1 times [2025-03-03 15:07:26,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:26,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089504463] [2025-03-03 15:07:26,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:26,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:26,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 15:07:26,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 15:07:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089504463] [2025-03-03 15:07:26,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089504463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:26,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 15:07:26,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-03 15:07:26,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693451468] [2025-03-03 15:07:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:26,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 15:07:26,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:26,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 15:07:26,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-03 15:07:26,729 INFO L87 Difference]: Start difference. First operand 79260 states and 95085 transitions. Second operand has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:07:27,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:27,548 INFO L93 Difference]: Finished difference Result 114032 states and 136989 transitions. [2025-03-03 15:07:27,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 15:07:27,549 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-03-03 15:07:27,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:27,674 INFO L225 Difference]: With dead ends: 114032 [2025-03-03 15:07:27,674 INFO L226 Difference]: Without dead ends: 105562 [2025-03-03 15:07:27,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:07:27,711 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 850 mSDsluCounter, 2366 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:27,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 2658 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105562 states. [2025-03-03 15:07:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105562 to 80664. [2025-03-03 15:07:28,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80664 states, 80663 states have (on average 1.1994594795631206) internal successors, (96752), 80663 states have internal predecessors, (96752), 0 states have call successors, (0), 0 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:07:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80664 states to 80664 states and 96752 transitions. [2025-03-03 15:07:29,014 INFO L78 Accepts]: Start accepts. Automaton has 80664 states and 96752 transitions. Word has length 111 [2025-03-03 15:07:29,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:29,014 INFO L471 AbstractCegarLoop]: Abstraction has 80664 states and 96752 transitions. [2025-03-03 15:07:29,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.9375) internal successors, (111), 16 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:07:29,014 INFO L276 IsEmpty]: Start isEmpty. Operand 80664 states and 96752 transitions. [2025-03-03 15:07:29,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:07:29,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:29,023 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:29,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 15:07:29,023 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:29,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1591067065, now seen corresponding path program 1 times [2025-03-03 15:07:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:29,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447508422] [2025-03-03 15:07:29,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:29,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:07:29,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:07:29,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:29,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:30,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447508422] [2025-03-03 15:07:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447508422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717267925] [2025-03-03 15:07:30,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:30,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:30,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:30,030 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:30,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 15:07:30,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:07:30,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:07:30,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:30,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:30,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 15:07:30,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 15:07:30,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:07:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717267925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:07:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 25 [2025-03-03 15:07:30,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031298405] [2025-03-03 15:07:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 15:07:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 15:07:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2025-03-03 15:07:30,729 INFO L87 Difference]: Start difference. First operand 80664 states and 96752 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:07:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:31,146 INFO L93 Difference]: Finished difference Result 114364 states and 137398 transitions. [2025-03-03 15:07:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 15:07:31,146 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 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 112 [2025-03-03 15:07:31,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:31,241 INFO L225 Difference]: With dead ends: 114364 [2025-03-03 15:07:31,241 INFO L226 Difference]: Without dead ends: 98254 [2025-03-03 15:07:31,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-03-03 15:07:31,276 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 434 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:31,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1175 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 15:07:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98254 states. [2025-03-03 15:07:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98254 to 72489. [2025-03-03 15:07:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72489 states, 72488 states have (on average 1.1997296104182762) internal successors, (86966), 72488 states have internal predecessors, (86966), 0 states have call successors, (0), 0 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:07:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72489 states to 72489 states and 86966 transitions. [2025-03-03 15:07:32,036 INFO L78 Accepts]: Start accepts. Automaton has 72489 states and 86966 transitions. Word has length 112 [2025-03-03 15:07:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 15:07:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 72489 states and 86966 transitions. [2025-03-03 15:07:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 11 states have internal predecessors, (107), 0 states have call successors, (0), 0 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:07:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 72489 states and 86966 transitions. [2025-03-03 15:07:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 15:07:32,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 15:07:32,043 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 15:07:32,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 15:07:32,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:32,245 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 15:07:32,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 15:07:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1487746505, now seen corresponding path program 1 times [2025-03-03 15:07:32,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 15:07:32,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313089982] [2025-03-03 15:07:32,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:32,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 15:07:32,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:07:32,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:07:32,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:32,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 15:07:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313089982] [2025-03-03 15:07:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313089982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 15:07:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163699396] [2025-03-03 15:07:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 15:07:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 15:07:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 15:07:33,188 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 15:07:33,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 15:07:33,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 15:07:33,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 15:07:33,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 15:07:33,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 15:07:33,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 15:07:33,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 15:07:34,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 15:07:34,291 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 15:07:34,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163699396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 15:07:34,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 15:07:34,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [21] total 34 [2025-03-03 15:07:34,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052844971] [2025-03-03 15:07:34,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 15:07:34,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 15:07:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 15:07:34,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 15:07:34,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1019, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 15:07:34,292 INFO L87 Difference]: Start difference. First operand 72489 states and 86966 transitions. Second operand has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 0 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:07:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 15:07:35,004 INFO L93 Difference]: Finished difference Result 102804 states and 123376 transitions. [2025-03-03 15:07:35,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 15:07:35,005 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2025-03-03 15:07:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 15:07:35,114 INFO L225 Difference]: With dead ends: 102804 [2025-03-03 15:07:35,114 INFO L226 Difference]: Without dead ends: 93508 [2025-03-03 15:07:35,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 99 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=1476, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 15:07:35,146 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 552 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 15:07:35,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 2729 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 15:07:35,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93508 states.